写这题的时候发现的;
根节点从0开始的话,有些trie树中可能不存在的边,然后你遍历下去了,因为不存在,所以没有赋过值,所以那个son[p][u]=0,然后p=son[p][u],结果p又变成0了,就相当于又继续从根节点开始遍历;所以也许从1开始是比较好的
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10, M = 31 * N;
int son[M][2], cnt[M], idx = 1;
void insert(int x, int num)
{
int p = 1;
for(int i = 30; ~ i; i --)
{
int u = x >> i & 1;
if(!son[p][u]) son[p][u] = ++ idx;
p = son[p][u];
cnt[p] += num;
}
}
int find(int x, int h)
{
int p = 1, res = 0;
for(int i = 30; ~ i; i -- )
{
int cx = x >> i & 1;
int ch = h >> i & 1;
if(ch == 0)
{
res += cnt[son[p][!cx]];
p = son[p][cx];
}
else p = son[p][!cx];
}
return res;
}
int main()
{
int n, hp;
scanf("%d%d", &n, &hp);
while(n -- )
{
int op, x, h;
scanf("%d", &op);
if(op == 0)
{
scanf("%d", &x);
insert(x, 1);
}
else if(op == 1)
{
scanf("%d", &x);
insert(x, -1);
}
else
{
scanf("%d%d", &x, &h);
int res = find(x, h);
printf("%d\n", res);
if(res == 0) hp -- ;
}
}
printf("%d\n", hp);
return 0;
}