CodeForces 842D Vitya and Strange Lesson

Chen丶HC

于 2017-09-02 18:59:39 发布

阅读量279

点赞数

分类专栏：字典树

本文链接：https://blog.csdn.net/chcnsn/article/details/77803038

版权

字典树专栏收录该内容

3 篇文章 0 订阅

订阅专栏

思路：首先明确对[1,2^n]区间内的所有数亦或x，仍然是[1,2^n]的所有数。
设给定集合为A，全集C，A的补集为B。
易知每次亦或A无需真的改动A数组，A^x1^x2 = A^(x1^x2)。
每次query对A中每个数亦或x, 然后查询min(C-A^x)。
又A^x+B^x = A + B = C，得所求即为min(B^x)。用字典树来求解亦或最值问题。

#include <iostream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <utility>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <cctype>
#define CLEAR(a, b) memset(a, b, sizeof(a))
#define IN() freopen("in.txt", "r", stdin)
#define OUT() freopen("out.txt", "w", stdout)
#define LL long long
#define maxn 524288
#define maxm 6000005
#define mod  10007
#define INF 1000000007
#define EPS 1e-7
#define PI 3.1415926535898
#define N 4294967296
using namespace std;
//-------------------------CHC------------------------------//
struct Node {
	Node *next[2];
	Node() { next[0] = next[1] = NULL; }
}node[maxm];
int total;

void insert(int num, Node *root) {
	Node *cur = root;
	for (int i = 19; i >= 0; --i) {
		int id = num >> i & 1;
		if (!cur->next[id]) cur->next[id] = &node[total++];
		cur = cur->next[id];
	}
}

int query(int num, Node *root) {
	int ret = 0;
	Node *cur = root;
	for (int i = 19; i >= 0; --i) {
		int id = num >> i & 1;
		if (!cur->next[id]) id = !id, ret |= (1 << i);
		cur = cur->next[id];
	}
	return ret;
}

bool vis[maxn+10];

int main() {
	int n, q;
	scanf("%d%d", &n, &q);
	int x;
	for (int i = 0; i < n; ++i) scanf("%d", &x), vis[x] = 1;
	Node *root = &node[total++];
	for (int i = 0; i <= maxn; ++i) if (!vis[i]) insert(i, root);
	int y = 0;
	while (q--) {
		scanf("%d", &x);
		y ^= x;
		printf("%d\n", query(y, root));
	}
	return 0;
}