# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
766205 | Ahmed57 | XOR Sum (info1cup17_xorsum) | C++17 | 1651 ms | 12640 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;
signed main(){
ios_base::sync_with_stdio(false);cin.tie(0);
int n;
cin>>n;
int arr[n];
for(int i = 0;i<n;i++){
cin>>arr[i];
}
sort(arr,arr+n);
long long all = 0;
reverse(arr,arr+n);
for(int i = 0;i<30;i++){
vector<int> v;
long long ans = 0;
for(int j = 0;j<n;j++){
if((arr[j]+arr[j])&(1LL<<i)){
ans++;
}
v.push_back(arr[j]&((1LL<<(i+1))-1));
}
sort(v.begin(),v.end());
int il = 0 , ir = 0;
int ll = 0;
for(int j = v.size()-1;j>=0;j--){
long long l=(1LL<<i),r=(1LL<<(i+1));
l-=v[j] , r-=v[j];
l%=((1LL<<(i+1)));
l+=(1LL<<(i+1));
l&=((1LL<<(i+1))-1);
while(ir<v.size()&&v[ir]<r)ir++;
if(l>=ll){
while(il<v.size()&&v[il]<l)il++;
}else{
il = 0;
while(il<v.size()&&v[il]<l)il++;
}
//cout<<l<<" "<<r<<" "<<il<<" "<<ir<<" "<<v[il]<<" "<<v[ir]<<endl;
ll = l;
if(l<=r)ans+=(ir-il);
else ans+=ir+(n-il);
}
//cout<<endl;
if(((ans/2)&1))all+=(1LL<<i);
}
cout<<all<<endl;
}
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... |