#include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
int n; cin>>n;
if(n<5e3)
{
int ans=0;
vector<int> a(n);
for(int i=0; i<n; i++) cin>>a[i];
for(int i=0; i<n; i++)
{
for(int l=i; l<n; l++)
{
ans^=(a[i]+a[l]);
}
}
cout<<ans;
}
else
{
int ans=0;
map<int, int> a;
for(int i=0; i<n; i++){ int x; cin>>x; a[x]++;}
for(int i=0; i<5e3; i++)
{
for(int l=i; l<5e3; l++)
{
if(a.count(l)>0&&a.count(i)>0)
{
if(l==i&&a[l]>2)
{
if(((a[l]*(a[l]-1))%2)==1) ans^=(l+i);
}
}
else
{
if((a[l]*a[i])%2) ans^=(l+i);
}
}
}
cout<<ans;
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
212 KB |
Output is correct |
2 |
Correct |
5 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
902 ms |
536 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
902 ms |
536 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
212 KB |
Output is correct |
2 |
Correct |
5 ms |
212 KB |
Output is correct |
3 |
Incorrect |
723 ms |
5228 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
212 KB |
Output is correct |
2 |
Correct |
5 ms |
212 KB |
Output is correct |
3 |
Incorrect |
902 ms |
536 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |