# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
128616 | E869120 | XOR Sum (info1cup17_xorsum) | C++14 | 196 ms | 22780 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
using namespace std;
#pragma warning (disable: 4996)
long long N, A[1 << 20], V[1 << 20], ans;
int main() {
scanf("%lld", &N);
for (int i = 1; i <= N; i++) scanf("%lld", &A[i]);
if (N <= 5000) {
for (int i = 1; i <= N; i++) {
for (int j = i; j <= N; j++) ans ^= (A[i] + A[j]);
}
printf("%lld\n", ans);
}
else {
for (int i = 1; i <= N; i++) V[A[i]]++;
for (int i = 0; i <= 5000; i++) {
for (int j = i + 1; j <= 5000; j++) {
if ((1LL * V[i] * V[j]) % 2LL == 1LL) ans ^= (i + j);
}
if ((1LL * V[i] * (V[i] + 1)) / 2LL % 2LL == 1LL) ans ^= (i + i);
}
printf("%lld\n", ans);
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |