HDU - 4825 01字典树套路题

/*H E A D*/
struct Trie{
    int son[maxn<<2][2];
    int b[67],tot;
    void init(){
//      memset(son,0,sizeof son);
        tot=0;
        son[0][0]=son[0][1]=0;
    }
    void insert(ll x){
        int now=0;
        rep(i,0,32) b[i]=(x>>i)&1;
        rrep(i,32,0){
            if(!son[now][b[i]]){
                son[now][b[i]]=++tot;
                son[tot][0]=son[tot][1]=0;
            }
            now=son[now][b[i]];
        }
    }
    ll find(ll x){
        int now=0;
        ll  ans=0;
        rep(i,0,32) b[i]=(x>>i)&1;
        rrep(i,32,0){
            if(son[now][b[i]^1]){
                now=son[now][b[i]^1];
                ans+=1ll<<i;
            }else{
                now=son[now][b[i]];
            }
        }
        return ans;
    }
}trie;
int main(){
    int T=read();
    int kase=0;
    while(T--){
        int n=read();
        int m=read();
        trie.init();
        rep(i,1,n){
            ll t=read();
            trie.insert(t);
        }
        printf("Case #%d:\n",++kase);
        rep(i,1,m){
            ll t=read();
            ll tt=trie.find(t);
            println(t^tt);
        }
    }
    return 0;
}

转载于:https://www.cnblogs.com/caturra/p/8427018.html