# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
48550 | 2018-05-15T22:46:11 Z | Pajaraja | XOR Sum (info1cup17_xorsum) | C++17 | 935 ms | 37680 KB |
#include <bits/stdc++.h> using namespace std; int a[1000007],c[1000007]; int main() { int n,sol=0; scanf("%d",&n); for(int i=1;i<=n;i++) scanf("%d",&a[i]); for(int j=0;j<31;j++) { int b=(1<<j),t=0; long long bc=0; if(j) for(int i=1;i<=n;i++) if((a[i] | (1<<(j-1)))!=a[i]) c[++t]=a[i]; if(j) for(int i=1;i<=n;i++) if((a[i] | (1<<(j-1)))==a[i]) c[++t]=a[i]; if(j) for(int i=1;i<=n;i++) {a[i]=c[i]; c[i]=a[i]%b;} for(int i=1;i<=n;i++) if((a[i] | b) == a[i]) bc++; long long k=0; int t1=1,t2=n; while(t1<=n) { while(c[t2]+c[t1]>=b) t2--; k+=(n-t2); t1++; } for(int i=1;i<=n;i++) if(2*c[i]>=b) k++; if((k/2+bc*(n-bc))%2==1) sol+=b; } printf("%d",sol); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 376 KB | Output is correct |
2 | Correct | 6 ms | 396 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 532 ms | 8536 KB | Output is correct |
2 | Correct | 504 ms | 8536 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 532 ms | 8536 KB | Output is correct |
2 | Correct | 504 ms | 8536 KB | Output is correct |
3 | Correct | 786 ms | 8536 KB | Output is correct |
4 | Correct | 669 ms | 8536 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 376 KB | Output is correct |
2 | Correct | 6 ms | 396 KB | Output is correct |
3 | Correct | 104 ms | 8536 KB | Output is correct |
4 | Correct | 96 ms | 8536 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 376 KB | Output is correct |
2 | Correct | 6 ms | 396 KB | Output is correct |
3 | Correct | 532 ms | 8536 KB | Output is correct |
4 | Correct | 504 ms | 8536 KB | Output is correct |
5 | Correct | 786 ms | 8536 KB | Output is correct |
6 | Correct | 669 ms | 8536 KB | Output is correct |
7 | Correct | 104 ms | 8536 KB | Output is correct |
8 | Correct | 96 ms | 8536 KB | Output is correct |
9 | Correct | 935 ms | 18952 KB | Output is correct |
10 | Correct | 920 ms | 28288 KB | Output is correct |
11 | Correct | 891 ms | 37680 KB | Output is correct |