Codeforces 948D Perfect Security

01字典树

#include<bits/stdc++.h>
using namespace std;
const int maxn=3e5+10;
#define ll long long
ll a[maxn],b[maxn],sn,ans[maxn],siz,cnt[maxn*40][2];
ll sum[maxn*40];

inline void insert(ll x)
{
    int n=0;
    for(ll i=32;i>=0;i--)
    {
        ll p=(x>>i)&1;
        if(!cnt[n][p])cnt[n][p]=++siz;
        sum[cnt[n][p]]++;
        n=cnt[n][p];
    }
}

void work(int id,ll x)
{
    int n=0;ll res=0;
    for(ll i=32;i>=0;i--)
    {
        ll p=(x>>i)&1;
        if(sum[cnt[n][p]]==0)res+=(1ll<<i),p=1-p;
        sum[cnt[n][p]]--;
        n=cnt[n][p];
    }
    ans[id]=res;
}

int main()
{
    scanf("%lld",&sn);
    for(int i=1;i<=sn;i++)scanf("%lld",a+i);
    for(int i=1;i<=sn;i++)
    {
        scanf("%lld",b+i);
        insert(b[i]);
    }
    for(int i=1;i<=sn;i++)work(i,a[i]);
    for(int i=1;i<=sn;i++)printf("%lld ",ans[i]);
    printf("\n");
}