[ACwing] 256. 最大异或和 (可持久化数据结构)

题目链接：256. 最大异或和

题解

可持久化Trie树，评测机貌似不稳定，T了的代码再交一次就过了？

代码

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<deque>
#include<iomanip>
#include<list>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<vector>
#include<unordered_set>
#include<unordered_map>
using namespace std;
//extern "C"{void *__dso_handle=0;}
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define lowbit(x) x&-x

const double PI=acos(-1.0);
const double eps=1e-6;
const ll mod=1e9+7;
const int inf=0x3f3f3f3f;
const int maxn=6e5+10;
const int maxm=maxn*24;
#define ios ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);

int trie[maxm][2],root[maxn],s[maxn],max_id[maxm];
int sz=0;
void insert(int i,int dig,int p,int now)
{
	if(dig<0)
	{
		max_id[now]=i;
		return ;
	}
	int v = (s[i]>>dig)&1;
	if(p) trie[now][v ^ 1]=trie[p][v ^ 1];
	trie[now][v]=++sz;
	insert(i, dig-1, trie[p][v],trie[now][v]);
	max_id[now]=max(max_id[trie[now][0]],max_id[trie[now][1]]);
}

int query(int root,int c,int l)
{
	int p=root;
	for(int i=23;i>=0;i--)
	{
		int v = (c>>i)&1;
		if(trie[p][v^1] && max_id[trie[p][v^1]]>=l) p=trie[p][v^1];
		else p=trie[p][v];
	}
	return c^s[max_id[p]];
}

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