baoshuo/OI-codes
baoshuo/OI-codes
0
1
Fork 0
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-12-24 03:31:59 +00:00
Code Releases Activity

#113. 最大异或和

Browse Source 
https://loj.ac/s/1025630
This commit is contained in:
Baoshuo Ren 2021-01-03 10:08:09 +08:00 committed by Baoshuo Ren
parent a7928020ad
commit 837ed43d29
Signed by: baoshuo
GPG Key ID: 70F90A673FB1AB68
1 changed files with 34 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

34
LibreOJ/113/113.cpp Normal file
View File

@ -0,0 +1,34 @@
#include <bits/stdc++.h>
using namespace std;
int n;
long long t, ans, p[60];
void insert(long long x) {
for (int i = 50; i >= 0; i--) {
if (x & (1ll << i)) {
if (!p[i]) {
p[i] = x;
break;
} else {
x ^= p[i];
}
}
}
}
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> t;
insert(t);
}
for (int i = 50; i >= 0; i--) {
if ((ans ^ p[i]) > ans) {
ans ^= p[i];
}
}
cout << ans << endl;
return 0;
}