LuoGu4735 最大异或和

最新推荐文章于 2024-02-16 20:32:05 发布

Agakiss

最新推荐文章于 2024-02-16 20:32:05 发布

阅读量111

点赞数 2

分类专栏：题解文章标签：可持久化01trie

本文链接：https://blog.csdn.net/qq_15647239/article/details/90415941

版权

题解专栏收录该内容

6 篇文章 0 订阅

订阅专栏

不要万能头！！！
不要scanf！！！

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
#define SIZE 480010
int n, m, tot;
int trie[24 * SIZE][2], latest[24 * SIZE];
int s[SIZE], root[SIZE];

inline int read(){
	int s = 0, w = 1;
	char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') w = -1;
	for (; isdigit(c); c = getchar()) s = (s << 1) + (s << 3) + (c ^ 48);
	return s * w;
}

void insert(int i, int k, int p, int q) {
	if (k < 0) {
		latest[q] = i;
		return;
	}
	int c = s[i] >> k & 1;
	if (p) trie[q][c ^ 1] = trie[p][c ^ 1];
	trie[q][c] = ++tot;
	insert(i, k - 1, trie[p][c], trie[q][c]);
	latest[q] = max(latest[trie[q][0]], latest[trie[q][1]]);
}

int ask(int now, int val, int k, int limit) {
	if (k < 0) return s[latest[now]] ^ val;
	int c = val >> k & 1;
	if (latest[trie[now][c ^ 1]] >= limit)
		return ask(trie[now][c ^ 1], val, k - 1, limit);
	else
		return ask(trie[now][c], val, k - 1, limit);
}

int main() {
	n = read(), m = read();
	latest[0] = -1;
	root[0] = ++tot;
	insert(0, 23, 0, root[0]);
	int x;
	for (register int i = 1; i <= n; i++) {
		x = read();
		s[i] = s[i - 1] ^ x;
		root[i] = ++tot;
		insert(i, 23, root[i - 1], root[i]);
	}
	char op[2];
	int l, r;
	for (register int i = 1; i <= m ; i++) {
		scanf("%s", op);
		if (op[0] == 'A') {
			x = read();
			root[++n] = ++tot;
			s[n] = s[n - 1] ^ x;
			insert(n, 23, root[n - 1], root[n]);
		}
		else {
			l = read(), r = read(), x = read();
			printf("%d\n", ask(root[r - 1], x ^ s[n], 23, l - 1));
		}
	}
	return 0;
}