oj.uz

Submission #687659

# Submission time Handle Problem Language Result Execution time Memory
687659 2023-01-26T18:18:24 Z alexdd XOR Sum (info1cup17_xorsum) C++17
77 / 100
 1600 ms 43972 KB 
#pragma GCC optimize("O3,unroll-loops")
#include<bits/stdc++.h>
using namespace std;
//#define int long long
const int MAX_VAL = 100000001;
int n;
int v[1000001];
int pre[1000001];
int newv[1000001];
bitset<MAX_VAL> bl;
unordered_map<int,int> fr;
int mxm=0;
void precalc(int bit)
{
    if(n>100000)
        bl.reset();
    mxm=0;
    fr.clear();
    for(int i=0;i<n;i++)
    {
        ///calc v[i]
        if(((1<<bit)&(newv[i]))!=0)
            pre[i] = ((pre[i]) | (1<<bit));
        v[i] = pre[i];
        mxm=max(mxm, v[i]);
        if(((1<<bit)&(v[i]+v[i]))!=0)
            fr[v[i]]++;
        if(n>100000)
        {
            bl[v[i]] = !bl[v[i]];
        }
    }
    if(n<=100000)
        sort(v,v+n);
    else
        for(int i=1;i<=mxm;i++)
            bl[i] = (bl[i] ^ bl[i-1]);
}
int qry(int x)///returneaza cate numere <= x apar in sirul modificat
{
    if(x<0)
        return 0;
    if(n<=100000)
    {
        int st,dr,mij;
        if(v[0]>x)
            return 0;
        st=0;
        dr=n-1;
        while(st<=dr)
        {
            mij=(st+dr)/2;
            if(v[mij]<=x && (mij==n-1 || v[mij+1]>x))
                return mij+1;
            else if(v[mij]<=x)
                st=mij+1;
            else
                dr=mij-1;
        }
        return st+1;
    }

    return bl[min(mxm,x)];
}
signed main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);

    cin>>n;
    for(int i=0;i<n;i++)
    {
        cin>>v[i];
        newv[i] = v[i];
        pre[i]=0;
    }
    int rez=0;
    for(int bit=0;bit<=28;bit++)
    {
        precalc(bit);
        int cntb=0;
        int cnt2=0;
        for(int i=0;i<n;i++)
        {
            int st1,dr1,st2,dr2;
            st1 = max((int)0, (1<<bit) - v[i]);
            dr1 = (1<<(bit+1)) - v[i] - 1;
            dr1 = min(dr1,v[i]-1);
            if(st1<=dr1)
                cntb += 2 + qry(dr1) - qry(st1-1);
            cntb%=2;
            st2 = (1<<bit) + (1<<(bit+1)) - v[i];
            dr2 = (1<<(bit+1))-1;
            dr2 = min(dr2, v[i]-1);
            if(st2<=dr2)
                cntb += 2 + qry(dr2) - qry(st2-1);
            cntb%=2;

            if(((1<<bit)&(v[i]+v[i]))!=0)
            {
                cnt2 += fr[v[i]] - 1;
                cnt2 %= 4;
                cntb++;
                cntb%=2;
            }
        }
        cnt2/=2;
        cntb+=cnt2;
        cntb=cntb%2;
        if(cntb==1)
            rez += (1<<bit);
    }
    cout<<rez;
    return 0;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 488 KB Output is correct
2 Correct 16 ms 484 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 661 ms 24356 KB Output is correct
2 Correct 633 ms 23648 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 661 ms 24356 KB Output is correct
2 Correct 633 ms 23648 KB Output is correct
3 Correct 1473 ms 35040 KB Output is correct
4 Correct 1273 ms 34764 KB Output is correct

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 488 KB Output is correct
2 Correct 16 ms 484 KB Output is correct
3 Correct 416 ms 3852 KB Output is correct
4 Correct 408 ms 3800 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 488 KB Output is correct
2 Correct 16 ms 484 KB Output is correct
3 Correct 661 ms 24356 KB Output is correct
4 Correct 633 ms 23648 KB Output is correct
5 Correct 1473 ms 35040 KB Output is correct
6 Correct 1273 ms 34764 KB Output is correct
7 Correct 416 ms 3852 KB Output is correct
8 Correct 408 ms 3800 KB Output is correct
9 Execution timed out 1680 ms 43972 KB Time limit exceeded
10 Halted 0 ms 0 KB -