# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
81687 | farukkastamonuda | XOR Sum (info1cup17_xorsum) | C++14 | 1209 ms | 62936 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>
#define fi first
#define se second
#define lo long long
#define inf 1000000000
#define md 1000000007
#define li 1000005
#define mp make_pair
#define pb push_back
#define pi pair<lo int, int>
using namespace std;
lo int n,A[li],c[li],t,gg,sum;
int main(){
scanf("%lld",&n);
for(int i=1;i<=n;i++) scanf("%lld",&A[i]);
for(int i=0;i<=30;i++){
int b=(1<<i);
t=0;
gg=0;
if(i){
for(int j=1;j<=n;j++){
if((A[j]|(1<<(i-1)))!=A[j]) c[++t]=A[j];
}
}
if(i){
for(int j=1;j<=n;j++){
if((A[j]|(1<<(i-1)))==A[j]) c[++t]=A[j];
}
}
if(i){
for(int j=1;j<=n;j++){
A[j]=c[j];
c[j]%=b;
}
}
for(int j=1;j<=n;j++){
if((A[j]|b)==A[j]) gg++;
}
lo int t1=1,t2=n,k=0;
while(t1<=n){
while(c[t1]+c[t2]>=b) {t2--;}
k+=n-t2;
t1++;
}
for(int j=1;j<=n;j++){
if(c[j]*2>=b) k++;
}
if((k/2+gg*(n-gg))%2==1) sum+=b;
}
printf("%lld\n",sum);
return 0;
}
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... |