【CodeForces - 706D 】Vasiliy's Multiset 【01 Trie 插入删除查询操作】

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.

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
10
+ 8
+ 9
+ 11
+ 6
+ 1
? 3
- 8
? 3
? 8
? 11
Output
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 .

就是 考01Trie 的三种操作的。

#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int>pii;
#define first fi
#define second se
#define  LL long long
#define fread() freopen("in.txt","r",stdin)
#define fwrite() freopen("out.txt","w",stdout)
#define CLOSE() ios_base::sync_with_stdio(false)

const int MAXN = 200000+11;
const int MAXM = 1e6;
const int mod = 1e9+7;
const int inf = 0x3f3f3f3f;

int ch[MAXN*32][2],sz;
int num[MAXN*32];
void init() {
    memset(ch[0],0,sizeof(ch[0]));
    sz=1;
    memset(num,0,sizeof(num));
}
void Insert(int a) {
    int u=0;
    for(int i=31; i>=0; i--) {
        int c=1&(a>>i);
        if(!ch[u][c]) {
            memset(ch[sz],0,sizeof(ch[sz]));
            ch[u][c]=sz++;
        }
        u=ch[u][c];
        num[u]++;
    }
}
void Delete(int a) {
    int u=0;
    for(int i=31; i>=0; i--) {
        int c=1&(a>>i);
        u=ch[u][c];
        num[u]--;
    }
}
int Query(int a) {
    int u=0;
    int ans=0;
    for(int i=31; i>=0; i--) {
        int c=1&(a>>i);
        if(ch[u][c^1]&&num[ch[u][c^1]]) {
            ans|=1<<i;
            u=ch[u][c^1];
        } else
            u=ch[u][c];
    }
    return ans;
}
int main() {
    CLOSE();
//  fread();
//  fwrite();
    init();
    Insert(0); //  一开始忘了这里，TAT
    int q;
    scanf("%d",&q);
    char op[10];
    int a;
    while(q--) {
        scanf("%s %d",op,&a);
        if(op[0]=='+') Insert(a);
        else if(op[0]=='-') Delete(a);
        else printf("%d\n",Query(a));
    }
    return 0;
}