# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
522002 | maks007 | XOR Sum (info1cup17_xorsum) | C++14 | 878 ms | 8976 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);
map <int,int> idx;
for(int i = 0; i < n; i ++ ) {
cin >> a[i];
idx[a[i]] ++;
}
int ans = 0;
sort(a.begin(), a.end());
a.erase(unique(a.begin(), a.end()), a.end());
for(int i = 0; i < a.size(); i ++) {
for(int j = 0; j <= i; j ++) {
if(a[i] < a[j] and idx[a[i]] % 2 == idx[a[j]] % 2 and idx[a[i]] % 2 == 1) {
ans ^= (a[i] + a[j]);
}else {
if(idx[a[i]] % 2 == idx[a[j]] % 2 and idx[a[i]] % 2 == 1 and 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... |