01Trie求最大異或

#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>

#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;
typedef long long LL;
const int maxn=100000+5;
const int maxm=1000+5;
int ch[32*maxn][2];
LL value[32*maxn];
int node_cnt;
void insert(LL x);
LL query(LL x);
int main()
{
    //freopen("in.txt","r",stdin);
    int n,m,t,now=1;
    scanf("%d",&t);
    while(now<=t){
        printf("Case #%d:\n",now);
        now++;
        scanf("%d %d",&n,&m);
        node_cnt=1;
        memset(ch[0],0,sizeof(ch));
        int i;
        for(i=1;i<=n;i++){
            int x;
            scanf("%d",&x);
            insert(x);
        }
        while(m--){
            int x;
            scanf("%d",&x);
            cout<<query(x)<<'\n';
        }
    }
    return 0;
}
void insert(LL x){
    int cur=0;
    for(int i=32;i>=0;i--){
        int idx=(x>>i)&1;//取第i位的值
        if(!ch[cur][idx]){
            ch[cur][idx]=node_cnt;
            value[node_cnt++]=0;
        }
        cur=ch[cur][idx];
    }
    value[cur]=x;//把x插入最後一位
}
LL query(LL x){
    int cur=0;
    for(int i=32;i>=0;i--){
        int idx=(x>>i)&1;
        if(ch[cur][idx^1])
            cur=ch[cur][idx^1];
        else cur=ch[cur][idx];
    }
    return value[cur];
}