Submission #1142441

#TimeUsernameProblemLanguageResultExecution timeMemory
1142441imarnXOR Sum (info1cup17_xorsum)C++20
0 / 100
1694 ms24300 KiB
#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define plx pair<ll,int>
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(),x.end()
#define vi vector<int>
#define vvi vector<vi>
#define pp pair<ll,int>
#define ub(x,i) upper_bound(all(x),i)-x.begin()
#define lb(x,i) lower_bound(all(x),i)-x.begin()
#define t3 tuple<int,int,int>
using namespace std;
const int mxn=5e5+5;
int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    int n;cin>>n;
    ll v[n];ll rs=0;
    for(int i=0;i<n;i++)cin>>v[i];
    ll x=1;
    for(int p=1;p<32;p++){
        x*=2;
        vector<ll>md;
        for(int i=0;i<n;i++)md.pb((v[i]%x+x)%x);
        sort(all(md));ll cnt=0;
        ll l=x>>1,r=x-1;
        for(int i=0;i<n;i++){
            ll tl=((l-v[i])%x+x)%x,tr=((r-v[i])%x+x)%x;
            if(tl<=tr)cnt+=upper_bound(all(md),tr)-lower_bound(all(md),tl);
            else {
                cnt+=upper_bound(all(md),2e12)-lower_bound(all(md),tl);
                cnt+=upper_bound(all(md),tr)-lower_bound(all(md),0);
            }
        }if(cnt%2==1)rs+=x/2;
    }cout<<rs;
}
















#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...