# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
521978 | maks007 | XOR Sum (info1cup17_xorsum) | C++14 | 1676 ms | 10028 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin>> n;
vector <int> a(n);
vector <int> idx((int)1e6, 0);
for(int i = 0; i < n; i ++ ) {
cin >> a[i];
idx[a[i]] ++;
}
int ans = 0;
vector <int> even;
sort(a.begin(), a.end());
//a.erase(unique(a.begin(), a.end()), a.end());
for(int k = 0; k < a.size(); k ++) {
int i = a[k];
if(idx[i] == 0) continue;
if(idx[i] % 2 == 1) continue;
for(auto j : even) {
//cout << i + j << ' ';
ans ^= (j+i);
}
even.push_back(i);
ans ^= (i*2);
}
for(int i = 0; i < a.size(); i ++) {
if(idx[a[i]] % 2 == 1){
for(int j = i; j < a.size(); j ++) {
// cout << (a[i] + a[j]) << " ";
ans ^= (a[i] + a[j]);
}
}
}
cout << ans;
return false;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |