hdoj 4825 Xor Sum

题目链接：Xor Sum

题目大意：有n个数，现在有m次查询，要求每次查询的这个数在数列种找到和它异或最大值，找出这个能够得到最大值的数

题目思路：直接01字典树往上套就好了

#include <map>
#include <stack>
#include <queue>
#include <cmath>
#include <vector>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>

using namespace std;
typedef long long ll;
const int maxn = 1e5+10;

int ch[maxn*32][2],cnt[maxn*32];
ll value[maxn*32];
int node_cnt;

inline void init(){
    node_cnt = 1;
    memset(ch[0],0,sizeof(ch));
}

inline void Insert(ll x,int f){
    int cur = 0;
    for(int i = 32;i >= 0;i--){
        int idx = (x >> i)&1;
        if(!ch[cur][idx]){
            memset(ch[node_cnt],0,sizeof(ch[node_cnt]));
            ch[cur][idx] = node_cnt;
            cnt[node_cnt] = 0;
            value[node_cnt++] = 0;
        }
        cur = ch[cur][idx];
        cnt[cur] += f;
    }
    value[cur] = x;
}

inline ll Query(ll x){
    int cur = 0;
    for(int i = 32;i >= 0;i--){
        int idx = (x>>i)&1;
        if(ch[cur][idx^1]&&cnt[ch[cur][idx^1]]) cur = ch[cur][idx^1];
        else cur = ch[cur][idx];
    }
    return value[cur];
}

int main(){
    int T,m,temp,n;
    scanf("%d",&T);
    for(int Case = 1;Case <= T;Case++){
        init();
        scanf("%d%d",&n,&m);
        for(int i = 0;i < n;i++){
            scanf("%d",&temp);
            Insert(temp,1);
        }
        printf("Case #%d:\n",Case);
        for(int i = 0;i < m;i++){
            scanf("%d",&temp);
            printf("%lld\n",Query(temp));
        }
    }
    return 0;
}