#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define NeedForSpeed ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<int> vii;
typedef vector<pll> vpll;
typedef vector<pii> vpii;
template<class T> bool umin(T& a, const T& b) {return a > b? a = b, true:false;}
template<class T> bool umax(T& a, const T& b) {return a < b? a = b, true:false;}
int msb(int val){return sizeof(int)*8-__builtin_clzll(val)-1;}
const int N = 1e6+5;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);
#define MULTI 0
int n, m, s, k, ans, a[N], cnt[N];
void solve(int t_case){
cin>>n;
int mx = -1;
for(int i=0;i<n;i++) cin>>a[i], cnt[a[i]]++, mx = max(a[i], mx);
ll res = 0;
for(int i=0;i<=mx;i++){
if(!cnt[i]) continue;
if(((cnt[i] * (cnt[i]-1) /2) + cnt[i]) % 2) res ^= (i + i); //{ cout<<i<<" "<<i<<"\n"; res ^= (i + i); }
for(int j=0;j<i;j++){
if(!cnt[j]) continue;
if(cnt[j]%2 && cnt[i] % 2) res ^= (i+j); //{ cout<<i<<" "<<j<<"\n"; res ^= (i + j); }
}
}cout<<res<<"\n";
}
signed main(){
NeedForSpeed
if(!MULTI){
solve(1);
} else{
int t;
cin>>t;
for(int t_case = 1; t_case <= t; t_case++) solve(t_case);
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
2 ms |
492 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
114 ms |
4332 KB |
Output is correct |
2 |
Correct |
110 ms |
8300 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
114 ms |
4332 KB |
Output is correct |
2 |
Correct |
110 ms |
8300 KB |
Output is correct |
3 |
Execution timed out |
1678 ms |
14956 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
2 ms |
492 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
2 ms |
492 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |