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;
#define ll long long
#define all(v) v.begin(),v.end()
#define endl '\n'
const int N = 1e6 + 10;
ll n, a[N], ans;
map<ll,ll>mp;
void solve(){
cin >> n;
for(int i = 1; i <= n; i++){
cin >> a[i];
mp[a[i]]++;
}
for(auto i : mp){
for(auto j : mp){
if(j.first <= i.first) continue;
if((j.second * i.second)&1){
ans ^= (j.first + i.first);
}
}
ans ^= (2*i.first);
}
cout << ans << endl;
}
int main(){
int t = 1;
// cin >> t;
while(t--){
solve();
}
return 0;
}
# | 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... |