# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
67829 | 2018-08-15T10:43:22 Z | ege_eksi | XOR Sum (info1cup17_xorsum) | C++14 | 1600 ms | 8516 KB |
#include<iostream> #include<cstdio> #include<cstdlib> #include<climits> #include<algorithm> using namespace std; int *v; int main() { int n; scanf("%d",&n); v = new int[n]; int x = 0; for(int i = 0 ; i < n ; i++) { scanf("%d",&v[i]); x = max(x , v[i]); } if(n < x){ long long int ans = 0; int i , j; for(i = 0 ; i < n ; i++) { for(j = i ; j < n ; j++) { ans = ans ^ (v[i] + v[j]); } } printf("%lli",ans); return 0; } if(x < n) { int cnt[4001] = {0}; int i , j; for(i = 0 ; i < n ; i++) { cnt[v[i]]++; } /* for(i = 1 ; i <= x ; i++) { printf("%d: %d\n",i , cnt[i]); } */ long long int ans = 0; for(i = 1 ; i <= x ; i++) { if(cnt[i] != 0) { if((cnt[i] + cnt[i] * (cnt[i]-1) / 2) % 2 != 0) { ans = ans ^ (i+i); } for(j = i+1 ; j <= x ; j++) { if(cnt[j] != 0) { if((cnt[i] * cnt[j]) % 2 != 0) { ans = ans ^ (i+j); } } } } } printf("%lli" , ans); return 0; } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 12 ms | 376 KB | Output is correct |
2 | Correct | 12 ms | 376 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 167 ms | 4512 KB | Output is correct |
2 | Correct | 142 ms | 4512 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 167 ms | 4512 KB | Output is correct |
2 | Correct | 142 ms | 4512 KB | Output is correct |
3 | Runtime error | 166 ms | 8516 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 12 ms | 376 KB | Output is correct |
2 | Correct | 12 ms | 376 KB | Output is correct |
3 | Execution timed out | 1660 ms | 8516 KB | Time limit exceeded |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 12 ms | 376 KB | Output is correct |
2 | Correct | 12 ms | 376 KB | Output is correct |
3 | Correct | 167 ms | 4512 KB | Output is correct |
4 | Correct | 142 ms | 4512 KB | Output is correct |
5 | Runtime error | 166 ms | 8516 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
6 | Halted | 0 ms | 0 KB | - |