CF706 D. Vasiliy's Multiset（异或最值问题——带删除的01字典树）

Problem Link：http://codeforces.com/contest/706/problem/D

 

D. Vasiliy's Multiset

time limit per test

4 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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:

1. "+ x" — add integer x to multiset A.
2. "- 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.
3. "? 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.

Input

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.

Output

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.

Example

input

Copy

10
+ 8
+ 9
+ 11
+ 6
+ 1
? 3
- 8
? 3
? 8
? 11

output

Copy

11
10
14
13

Note

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 .

 

AC code：

#include<bits/stdc++.h>
#define LL long long
using namespace std;
const int maxn=100010;
int n,m;
LL x;
int a[maxn*32];
int ch[maxn*32][2];
int val[maxn*32];//以根节点到当前结点作为前缀的总个数
int sz;

void init()
{
	sz=1;
	memset(ch,0,sizeof(ch));
	memset(val,0,sizeof(val));
}

void _insert(LL x)
{
	int u=0;
	for(int i=32;i>=0;i--)
	{
		int c=(x>>i)&1;
		if(!ch[u][c])
		{
			ch[u][c]=sz++;
		}
		u=ch[u][c];
		val[u]++;
	}
}

void _delete(LL x)
{
	int u=0;
	for(int i=32;i>=0;i--)
	{
		int c=(x>>i)&1;
		u=ch[u][c];
		--val[u];
	}
}

LL query(LL x)//输出最大异或值res或与x异或结果最大的元素maxx 
{
	LL res=0;//输出最大异或值 
	LL maxx=0;//输出与x异或结果最大的元素maxx 
	int u=0;
	for(int i=32;i>=0;i--)
	{
		int c=(x>>i)&1;
		if(ch[u][c^1] && val[ch[u][c^1]])
		{
			res+=(1<<i);//第i位与x第i位不同，该位异或结果为1 
			maxx+=((c^1)<<i);//maxx第i位为((c^1)<<i)
			u=ch[u][c^1];
		}
		else
		{
			u=ch[u][c];
			maxx+=((c)<<i);//maxx第i位为((c)<<i)
		}
	}
	return res;//输出最大异或值
	//return maxx; 
}

int main()
{
	//freopen("D:\\in.txt","r",stdin);
	int q;
	char op[2];
	scanf("%d",&q);
	init();
	_insert(0);
	while(q--)
	{
		scanf("%s%I64d\n",&op,&x);
		if(op[0]=='+')
		{
			_insert(x);
		}
		else if(op[0]=='-')
		{
			_delete(x);
		}
		else
		{
			LL ans=query(x);
			printf("%I64d\n",ans);
		}
	}
	return 0;
}