HDU 4825 Xor Sum 01字典树模板

题目链接

思路

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<vector>
#include<string>
#include<queue>
#include<stack>
#include<set>
#include<map>
#define ll long long
#define uint unsigned int
using namespace std;
const int INF = ( 2e9 ) + 2;
const ll maxn = 1e5+100;
int t[maxn*33][2];
int tot;
void insert(int rt,int st,uint a)
{
if(st==-1)return;
int cur=(uint)(a>>st)&1;
if(!t[rt][cur])t[rt][cur]=++tot,t[tot][0]=0,t[tot][1]=0;
insert(t[rt][cur],st-1,a);
}
uint find(int rt,int st,uint a)
{
if(st==-1)return 0;
int cur=(uint)(a>>st)&1;
if(t[rt][cur^1])return (uint)((cur^1)<<st)+find(t[rt][cur^1],st-1,a);
else return (uint)(cur<<st)+find(t[rt][cur],st-1,a);
}
int main()
{
int T,n,m;
uint temp;
scanf("%d",&T);
for(int cas=1;cas<=T;cas++)
{
t[0][1]=t[0][0<
4000
/span>]=0;
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)
{
scanf("%u",&temp);
insert(0,31,temp);
}
printf("Case #%d:\n",cas);
for(int i=1;i<=m;i++)
{
scanf("%u",&temp);
printf("%u\n",find(0,31,temp));
}
}
}