【 Codeforces Round #367 (Div. 2) D】 Vasiliy's Multiset (Trie 按数位建字典树)
来源:互联网 发布:can数据帧的格式结构 编辑:程序博客网 时间:2024/05/19 02:19
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
11101413
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 .
#include <bits/stdc++.h>using namespace std;#define maxn 200005int ch[maxn * 32 * 2][2], sz[maxn * 32 * 2], tot;void insert(int x, int v){ int k = 0, y; for(int i = 30; i >= 0; --i){ y = (x >> i) & 1; if(ch[k][y] == 0){ ch[k][y] = ++tot; ch[tot][0] = ch[tot][1] = 0; } k = ch[k][y]; sz[k] += v; }}int query(int x){ int k = 0, y, ans = 0; for(int i = 30; i >= 0; --i){ y = (x >> i) & 1; if(sz[ch[k][y ^ 1]] > 0){ y ^= 1; ans |= 1 << i; } k = ch[k][y]; } return ans;}int main(){ int n, x; cin >> n; char s[2]; tot = ch[0][0] = ch[0][1] = 0; memset(sz, 0, sizeof(sz)); insert(0, 1); for(int i = 1; i <= n; ++i){ scanf("%s %d", s, &x); if(s[0] == '+'){ insert(x, 1); } else if(s[0] == '-'){ insert(x, -1); } else{ printf("%d\n", query(x)); } }} /*题意:给2e5次操作,每次询问给一个整数x,要么将其加入集合(multiset),要么从集合删除,要么找出集合中和它异或最大的答案,集合中保证一定有0。思路:建Trie,插入和删除操作用sz[i]来维护,大于0说明这个结点没被删掉。在Trie上找与x异或最大的值,实际上就是对于x,假设某一位上值为y,我们优先访问y^1即可。因为最高位能异或得到1一定让它优先为1。遍历时维护一下答案即可。*/
- 【 Codeforces Round #367 (Div. 2) D】 Vasiliy's Multiset (Trie 按数位建字典树)
- Codeforces Round #367 (Div. 2) D——Vasiliy's Multiset(异或字典树)
- Codeforces Round #367 (Div. 2) D Vasiliy's Multiset(字典树)
- Codeforces Round #367 (Div. 2) D. Vasiliy's Multiset(字典树模板)
- Codeforces Round #367 (Div. 2) D. Vasiliy's Multiset (字典树二进制)
- Codeforces Round #367 (Div. 2) Vasiliy's Multiset(字典树)
- Codeforces Round #367 (Div. 2) D. Vasiliy's Multiset (01trie树)
- HDU-4825 Xor Sum &&Codeforces Round #367 (Div. 2) D. Vasiliy's Multiset (Trie树)
- Codeforces Round #367 (Div. 2) D. Vasiliy's Multiset 二进制树、Trie
- Codeforces Round #367 (Div. 2) D Vasiliy's Multiset(01Trie)
- 【Codeforces Round 367 (Div 2) D】【字典树典型题】Vasiliy's Multiset
- Codeforces Round #367 (Div. 2) [D] Vasiliy's Multiset(01字典树模板)
- Codeforces Round #367 (Div. 2) D Vasiliy's Multiset(字典树+贪心)
- Codeforces Round #367 (Div. 2) D. Vasiliy's Multiset (multiset)
- Codeforces Round #367 (Div. 2) Vasiliy's Multiset xor trie
- 字典树(Codeforces Round #367 (Div. 2) Vasiliy's Multiset,Xor问题 )
- Codeforces Round #367 (Div. 2):Vasiliy's Multiset(01字典树)
- Codeforces Round #367 (Div. 2) D. Vasiliy's Multiset (tire 树)
- 拷贝构造函数、赋值函数浅析
- SSH 无法启动的原因分析及解决方法
- 使用commons-beanutils-1.8.3.jar提供的BeanUtils类快速封装属性时,遇到的错误
- LeakCanary使用(Android试手)
- Android Studio之maven Central,JCenter
- 【 Codeforces Round #367 (Div. 2) D】 Vasiliy's Multiset (Trie 按数位建字典树)
- 选择排序(简单选择排序--改进的简单选择排序--堆排序)
- post提交参数有Date类型,总是返回400格式错误
- 【学术】 一个博士的经历(小木虫精华帖,留着细细体会!)
- mongodb根据objectid修改
- Fresco基本用法
- struts2使用AbstractInterceptor实现拦截器
- 浏览器默认的弹出框
- 背景色设置透明,兼容ie浏览器设置