# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
67694 | 2018-08-15T08:46:04 Z | tatatan | XOR Sum (info1cup17_xorsum) | C++11 | 1600 ms | 8320 KB |
#include <bits/stdc++.h> #define mp make_pair #define pb push_back #define pii pair<int,int> #define LL long long #define st first #define nd second #define endl '\n' using namespace std; const int MAXN=1000005; LL n,a[MAXN],b[MAXN]; LL ans; int main() { scanf("%lld",&n); for(int i=0;i<n;++i) scanf("%lld",&a[i]); LL ans2=0; for(int i=0;i<n;++i) for(int j=i;j<n;++j) ans2^=a[i]+a[j]; printf("%lld\n",ans2); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 10 ms | 376 KB | Output is correct |
2 | Correct | 11 ms | 376 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1662 ms | 8320 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1662 ms | 8320 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 10 ms | 376 KB | Output is correct |
2 | Correct | 11 ms | 376 KB | Output is correct |
3 | Execution timed out | 1675 ms | 8320 KB | Time limit exceeded |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 10 ms | 376 KB | Output is correct |
2 | Correct | 11 ms | 376 KB | Output is correct |
3 | Execution timed out | 1662 ms | 8320 KB | Time limit exceeded |
4 | Halted | 0 ms | 0 KB | - |