# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
498783 | ahmedfouadnew | XOR Sum (info1cup17_xorsum) | C++17 | 1692 ms | 118012 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;
//#define int long long
#define pb push_back
int n;
vector<int>a[33];
signed main()
{
scanf("%d",&n);
long long cnto=0,cnte=0;
for(int i=0;i<n;i++)
{
int x;
scanf("%d",&x);
cnto+=(x%2);
cnte+=(x%2==0);
int cur=0;
for(int j=0;j<30;j++)
{
cur+=x&(1<<j);
a[j].pb(cur);
}
}
for(int i=0;i<30;i++) sort(a[i].begin(),a[i].end());
int ans=0;
for(int i=0;i<30;i++)
{
int cur=0;
for(int j=0;j<n;j++)
{
cur+=n-(lower_bound(a[i].begin(),a[i].end(),(1<<(i+1))-a[i][j])-a[i].begin());
}
ans|=(cur&1)*(1<<(i+1));
}
ans|=(1ll*cnto*cnte)&1ll;
cout<<ans<<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... |