cf1322 B. Present

最新推荐文章于 2021-11-07 17:09:05 发布

*ACoder*

最新推荐文章于 2021-11-07 17:09:05 发布

阅读量233

点赞数

本文链接：https://blog.csdn.net/FSAHFGSADHSAKNDAS/article/details/105346096

版权

Link

Solution

我一位一位地统计

我只要统计出第 $k$ 位上有 $c n t$ 个括号的结果是 $1$ ，根据 $c n t$ 的奇偶我就可以知道在答案中这一位应该是 $0$ 还是 $1$

如果我只保留第 $0$ 位到第 $k$ 位，假设当前数字为 $a$

那么满足条件的取值区间为 $2^k \le a+x \le 2^{k+1}-1$ 和 $3\times 2^{k} \le a+x \le 2^{k+2}-1$

二分一下就出来了，复杂度是两个 $l o g$

如果把二分换成指针的话，还能少一个 $l o g$

Code

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define iinf 0x3f3f3f3f
#define linf (1ll<<60)
#define eps 1e-8
#define maxn 1000010
#define maxe 1000010
#define cl(x) memset(x,0,sizeof(x))
#define rep(i,a,b) for(i=a;i<=b;i++)
#define drep(i,a,b) for(i=a;i>=b;i--)
#define em(x) emplace(x)
#define emb(x) emplace_back(x)
#define emf(x) emplace_front(x)
#define fi first
#define se second
#define de(x) cerr<<#x<<" = "<<x<<endl
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll read(ll x=0)
{
    ll c, f(1);
    for(c=getchar();!isdigit(c);c=getchar())if(c=='-')f=-f;
    for(;isdigit(c);c=getchar())x=x*10+c-0x30;
    return f*x;
}
ll a[maxn], b[maxn], n, ans;
int main()
{
    ll i, k;
    n = read();
    rep(i,1,n)a[i] = read();
    for(k=1;k<(1<<25);k<<=1)
    {
        ll cnt = 0;
        rep(i,1,n)b[i]=a[i]&((k<<1)-1);
        sort(b+1,b+n+1);
        rep(i,1,n)
        {
            ll L = k-b[i], R=2*k-1-b[i], l, r, mid, lpos, rpos;
            
            l=1, r=n;
            while(l<r)
            {
                mid = l+r>>1;
                if(b[mid]<L)l=mid+1;
                else r=mid;
            }
            lpos = l;

            l=1, r=n;
            while(l<r)
            {
                mid = l+r+1>>1;
                if(b[mid]>R)r=mid-1;
                else l=mid;
            }
            rpos = l;

            if(L<=b[lpos] and b[lpos]<=R)
            {
                cnt += rpos-lpos+1;
            }

            L = 3*k-b[i], R = 4*k-1-b[i];

            l=1, r=n;
            while(l<r)
            {
                mid = l+r>>1;
                if(b[mid]<L)l=mid+1;
                else r=mid;
            }
            lpos = l;

            l=1, r=n;
            while(l<r)
            {
                mid = l+r+1>>1;
                if(b[mid]>R)r=mid-1;
                else l=mid;
            }
            rpos = l;

            if(L<=b[lpos] and b[lpos]<=R)
            {
                cnt += rpos-lpos+1;
            }

            // printf("    %lld [%lld,%lld] cnt=%lld\n",b[i],lpos,rpos,cnt);
        }
        rep(i,1,n)if(b[i]+b[i]&k)cnt --;
        cnt >>= 1;
        // printf("k=%lld cnt=%lld\n",k,cnt);
        if(cnt&1)
        {
            ans += k;
        }
    }
    printf("%lld",ans);
    return 0;
}