# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
348954 | 2021-01-16T07:34:29 Z | ali_tavakoli | XOR Sum (info1cup17_xorsum) | C++14 | 126 ms | 14956 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 + 1; j < mxn; j++) if((cnt[i] * cnt[j]) % 2) ans ^= (i + j); //cout << ans << '\n'; for(int i = 0; i < mxn; i++) if((cnt[i] * (cnt[i] - 1) / 2 + cnt[i]) % 2) ans ^= (i + i); 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
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 364 KB | Output is correct |
2 | Correct | 3 ms | 384 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 120 ms | 4332 KB | Output is correct |
2 | Correct | 112 ms | 8320 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 120 ms | 4332 KB | Output is correct |
2 | Correct | 112 ms | 8320 KB | Output is correct |
3 | Incorrect | 126 ms | 14956 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 364 KB | Output is correct |
2 | Correct | 3 ms | 384 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 | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 364 KB | Output is correct |
2 | Correct | 3 ms | 384 KB | Output is correct |
3 | Correct | 120 ms | 4332 KB | Output is correct |
4 | Correct | 112 ms | 8320 KB | Output is correct |
5 | Incorrect | 126 ms | 14956 KB | Output isn't correct |
6 | Halted | 0 ms | 0 KB | - |