# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
412781 | 2021-05-27T13:37:29 Z | aris12345678 | XOR Sum (info1cup17_xorsum) | C++14 | 1600 ms | 8744 KB |
#include <bits/stdc++.h> using namespace std; const int mxN = 1e6+5; int v[mxN]; int main() { int n; scanf("%d", &n); for(int i = 0; i < n; i++) scanf("%d", &v[i]); int ans = 0; for(int i = 0; i < n; i++) { for(int j = i; j < n; j++) ans ^= (v[i]+v[j]); } printf("%d\n", ans); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 332 KB | Output is correct |
2 | Correct | 5 ms | 320 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1671 ms | 8744 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1671 ms | 8744 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 332 KB | Output is correct |
2 | Correct | 5 ms | 320 KB | Output is correct |
3 | Execution timed out | 1671 ms | 1560 KB | Time limit exceeded |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 332 KB | Output is correct |
2 | Correct | 5 ms | 320 KB | Output is correct |
3 | Execution timed out | 1671 ms | 8744 KB | Time limit exceeded |
4 | Halted | 0 ms | 0 KB | - |