# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
521812 | 2022-02-03T08:23:05 Z | maks007 | XOR Sum (info1cup17_xorsum) | C++14 | 1600 ms | 4384 KB |
#include <bits/stdc++.h> using namespace std; int main(void) { int n; cin>> n; vector <int> a(n); map <int,int> idx; for(int i = 0; i < n; i ++ ) { cin >> a[i]; idx[a[i]] ++; } int ans = 0; for(int i = 0; i < a.size(); i ++) { if(idx[a[i]] % 2 == 1){ for(int j = 0; j < a.size(); j ++) { ans ^= (a[i] + a[j]); //cout << a[i] + a[j] << " "; } } } cout << ans; return false; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 14 ms | 460 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1687 ms | 4384 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1687 ms | 4384 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 14 ms | 460 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 14 ms | 460 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |