three arrays

three arrays

字典树上贪心

#include<bits/stdc++.h>
using namespace std;
int trie[][][];
int siz[][];
int A[];
int tot[];
bool ed[][];
int val[][];
int N;
void init()
{
    tot[]=tot[]=;
    for(int i=; i<=*N; i++)
    {
        val[i][]=val[i][]=;
        ed[i][]=ed[i][]=;
        trie[i][][]=trie[i][][]=trie[i][][]=trie[i][][]=;
        siz[i][]=siz[i][]=;
    }

}
void insert(int x,bool f)
{
    int k=;
    int y=x;
    while(x)
    {
        A[k++]=x%;
        x/=;
    }
    while(k<)A[k++]=;
    int t=;
    int j=;
    int len=;
    while(j>=)
    {
        ++siz[t][f];
        if(trie[t][A[j]][f]==)
        {
            trie[t][A[j]][f]=++tot[f];
        }
        t=trie[t][A[j]][f];

        j--;
      //  cout<<t<<"t"<<endl;
        len++;
    }
    //cout<<len<<" leN\n";
    ++siz[t][f];
    ed[t][f]=;
    val[t][f]=y;
    //cout<<t<<'\n';

}
int query()
{
    int t0=,t1=;
    int len=;
    while(!ed[t0][]&&!ed[t1][])
    {
        --siz[t0][];
        --siz[t1][];
       // cout<<t0<<t1<<endl;//siz[t0][0]<<siz[t1][1]<<endl;
        if(siz[trie[t0][][]][]&&siz[trie[t1][][]][])
        {
            t0=trie[t0][][];
            t1=trie[t1][][];
        }
        else if(siz[trie[t0][][]][]&&siz[trie[t1][][]][])
        {
            t0=trie[t0][][];
            t1=trie[t1][][];
        }
        else
        {
            if(siz[trie[t0][][]][])
                t0=trie[t0][][];
            else t0=trie[t0][][];
            if(siz[trie[t1][][]][])
                t1=trie[t1][][];
            else t1=trie[t1][][];

        }
      //  ++len;
    }
    //cout<<len<<"LEN"<<'\n';
    siz[t0][]--;
    siz[t1][]--;
    //cout<<t0<<t1<<'\n';
   //cout<<ed[t0][0]<<' '<<ed[t1][1]<<'\n';
    return val[t0][]^val[t1][];
}
int T;
int a,b;
int C[];
int main()
{
    //freopen("1.in","r",stdin);
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d",&N);
        init();
        for(int i=; i<N; i++)
        {
            scanf("%d",&a);
            insert(a,);
        }
        for(int i=; i<N; i++)
        {
            scanf("%d",&b);
            insert(b,);
        }
        for(int i=;i<N;i++){
            C[i]=query();
        }
        sort(C,C+N);
        for(int i=; i<N; i++)
        {
            cout<<C[i]<<((i!=N-1)?' ':'\n');
        }
    }

}