Description
给定一个非负整数序列 a a ,初始长度为 N N 。
有个操作,有以下两种操作类型:
- A x:添加操作,表示在序列末尾添加一个数 x x ,序列的长度。
- Q l r x:询问操作,你需要找到一个位置 p p ,满足,使得: a[p]xora[p+1]xor...xora[N]xorx a [ p ] x o r a [ p + 1 ] x o r . . . x o r a [ N ] x o r x 最大,输出最大是多少。
Solution
考虑前缀和转化,设 b[p]=a[1]xora[2]xor...xora[p] b [ p ] = a [ 1 ] x o r a [ 2 ] x o r . . . x o r a [ p ]
a[p]xora[p+1]xor...xora[N]xorx=b[p−1]xorb[n]xorx a [ p ] x o r a [ p + 1 ] x o r . . . x o r a [ N ] x o r x = b [ p − 1 ] x o r b [ n ] x o r x ,其中 p∈[l,r] p ∈ [ l , r ]
而 b[n]xorx b [ n ] x o r x 为定值,接下来只需要用可持久化Trie解决。
#include <bits/stdc++.h>
using namespace std;
const int maxn = 600005;
int n, m, A[maxn], B[maxn];
inline int gi()
{
char c = getchar();
while (c < '0' || c > '9') c = getchar();
int sum = 0;
while ('0' <= c && c <= '9') sum = sum * 10 + c - 48, c = getchar();
return sum;
}
int ch[maxn * 40][2], root[maxn], sum[maxn * 40], tot;
inline void insert(int x, int &y, int val)
{
int tmp; y = ++tot; tmp = y;
for (int i = 23, t; i >= 0; --i) {
ch[y][0] = ch[x][0]; ch[y][1] = ch[x][1];
sum[y] = sum[x] + 1;
t = (val >> i) & 1;
x = ch[x][t];
ch[y][t] = ++tot;
y = ch[y][t];
}
sum[y] = sum[x] + 1; y = tmp;
}
inline int query(int x, int y, int val)
{
int ans = 0;
for (int i = 23, t; i >= 0; --i) {
t = !((val >> i) & 1);
if (sum[ch[y][t]] - sum[ch[x][t]]) ans += 1 << i;
else t ^= 1;
x = ch[x][t]; y = ch[y][t];
}
return ans;
}
int main()
{
n = gi() + 1; m = gi();
for (int i = 2; i <= n; ++i) A[i] = gi();
for (int i = 1; i <= n; ++i) B[i] = B[i - 1] ^ A[i];
for (int i = 1; i <= n; ++i) {
insert(root[i - 1], root[i], B[i]);
}
for (int i = 1, l, r; i <= m; ++i) {
char c = getchar();
while (c < 'A' || c > 'Z') c = getchar();
if (c == 'A') {
++n; A[n] = gi(); B[n] = B[n - 1] ^ A[n];
insert(root[n - 1], root[n], B[n]);
} else {
l = gi(); r = gi();
printf("%d\n", query(root[l - 1], root[r], gi() ^ B[n]));
}
}
return 0;
}