# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
348950 | 2021-01-16T07:16:42 Z | ali_tavakoli | XOR Sum (info1cup17_xorsum) | C++14 | 100 ms | 4332 KB |
//In The Name Of Allah #include<bits/stdc++.h> using namespace std; typedef long long ll; #define pb push_back #define F first #define S second #pragma GCC optimize("Ofast") const int maxn = 1e6 + 5, mxn = 4e3 + 5; int n, a[maxn], cnt[maxn]; void sub1() { ll ans = 0; for(int i = 0; i < n; i++) for(int j = i; j < n; j++) ans ^= (a[i] + a[j]); cout << ans << '\n'; } void sub2() { ll ans = 0; for(int i = 0; i < n; i++) cnt[a[i]] ++; for(int i = 0; i < mxn; i++) for(int j = i; j < mxn; j++) if((cnt[i] * cnt[j]) % 2) ans ^= (i + j); cout << ans << '\n'; } int main() { ios::sync_with_stdio(0);cin.tie(0);cout.tie(0); auto t = clock(); cin >> n; for(int i = 0; i < n; i++) cin >> a[i]; if(n <= (4e3)) sub1(); else sub2(); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 364 KB | Output is correct |
2 | Correct | 3 ms | 364 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 100 ms | 4332 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 100 ms | 4332 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 364 KB | Output is correct |
2 | Correct | 3 ms | 364 KB | Output is correct |
3 | Runtime error | 13 ms | 1260 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 | 3 ms | 364 KB | Output is correct |
2 | Correct | 3 ms | 364 KB | Output is correct |
3 | Incorrect | 100 ms | 4332 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |