Author has gone out of the stories about Vasiliy, so here is just a formal task description.
You are given q queries and a multiset A, initially containing only integer 0. There are three types of queries:
- "+ x" — add integer x to multiset A.
- "- x" — erase one occurrence of integer x from multiset A. It's guaranteed that at least one x is present in the multiset A before this query.
- "? x" — you are given integer x and need to compute the value , i.e. the maximum value of bitwise exclusive OR (also know as XOR) of integer x and some integer y from the multiset A.
Multiset is a set, where equal elements are allowed.
The first line of the input contains a single integer q (1 ≤ q ≤ 200 000) — the number of queries Vasiliy has to perform.
Each of the following q lines of the input contains one of three characters '+', '-' or '?' and an integer xi (1 ≤ xi ≤ 109). It's guaranteed that there is at least one query of the third type.
Note, that the integer 0 will always be present in the set A.
For each query of the type '?' print one integer — the maximum value of bitwise exclusive OR (XOR) of integer xi and some integer from the multiset A.
10 + 8 + 9 + 11 + 6 + 1 ? 3 - 8 ? 3 ? 8 ? 11
11 10 14 13
After first five operations multiset A contains integers 0, 8, 9, 11, 6 and 1.
The answer for the sixth query is integer — maximum among integers , , , and .
题目大意:
有一个开始只有0的集合,有3种操作,向集合中添加一个数字,删去集合中的一个数字,寻找输入数字与集合中的所有数字的最大异或值。
解题思路:
新姿势get√
据说这是一个经典的异或字典树,我们把每个数字的每一个二进制位拆开处理。最高位作根节点,插入和删除和普通字典树相同,对于查询,我们可以贪心的从高位往下找,如果这一位存在可以异或得到1的儿子,则沿这个儿子的方向向下走,否则沿另一个儿子的方向。
O(Q*log len)。
AC代码:
#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn=200000+3;
int Q;
struct Node
{
int nxt[2];//保存2个儿子下标
int cnt;//保存此节点的数字数
void new_node()//建立节点
{
memset(nxt,0,sizeof nxt);
cnt=0;
}
}data[maxn*32];//没必要开1LL<<32,最坏的情况只会用maxn*32
int tot,root;
void update(int x,int v)
{
int p=root;
for(int i=30;i>=0;--i)
{
int id=x>>i&1;
if(!data[p].nxt[id])
{
data[++tot].new_node();
data[p].nxt[id]=tot;
}
p=data[p].nxt[id];
data[p].cnt+=v;
}
}
int query(int x)
{
int res=0,p=root;
for(int i=30;i>=0;--i)
{
int id=x>>i&1;
if(!data[p].nxt[id^1]||!data[data[p].nxt[id^1]].cnt)//能够通过异或使这一位为1的数字不存在
p=data[p].nxt[id];
else
{
p=data[p].nxt[id^1];
res|=1<<i;
}
}
return res;
}
int main()
{
scanf("%d",&Q);
data[root=++tot].new_node();
update(0,1);//插入初始的0
while(Q--)
{
char op[5];
int x;
scanf("%s%d",op,&x);
if(op[0]!='?')
update(x,op[0]=='+'?1:-1);
else printf("%d\n",query(x));
}
return 0;
}