# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
522867 | n3rm1n | XOR Sum (info1cup17_xorsum) | C++17 | 5 ms | 460 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<bits/stdc++.h>
#define endl '\n'
using namespace std;
const int MAXN = 4 * 1e3 + 10;
void speed()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
int n, a[MAXN];
int used[MAXN];
int ans;
void read()
{
cin >> n;
for (int i = 1; i <= n; ++ i)
{
cin >> a[i];
if(a[i] < MAXN) used[a[i]] ++;
}
}
void solve_N2()
{
for (int i = 1; i <= n; ++ i)
{
for (int j = i; j <= n; ++ j)
{
ans = (ans ^ (a[i]+a[j]));
}
}
cout << ans << endl;
}
void solve_11()
{
for (int i = 0; i <= 4*1e3; ++ i)
{
if(used[i])
{
//ans = ans *
if(used[i] %2 == 0 || used[i] == 1)
ans = ans ^ (i + i);
for (int j = i+1; j <= 4*1e3; ++ j)
{
if(used[j])
{
/**cout << "/***" << endl;
cout << i << " " << j << endl;
cout << used[i] << " " << used[j] << endl;
cout << i + j << endl;*/
if(used[j] %2 == 0 || used[i] %2 == 0) ans = ans;
else
{
ans = ans ^ (i + j);
///cout << "xor: " << i + j << endl;
}
}
}
}
}
cout << ans << endl;
}
int main()
{
speed();
read();
if(n <= MAXN)solve_N2();
else solve_11();
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... |