可持久化数据结构(2) P4735 可持久化01Trie 解决与val的最大XOR问题

//#define LOCAL
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mem(a, b) memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
#define DNF 0x7f
#define DBG printf("this is a input\n")
#define fi first
#define se second
#define mk(a, b) make_pair(a,b)
#define pb push_back
#define LF putchar('\n')
#define SP putchar(' ')
#define p_queue priority_queue
#define CLOSE ios::sync_with_stdio(0); cin.tie(0)

template<typename T>
void read(T &x) {x = 0;char ch = getchar();ll f = 1;while(!isdigit(ch)){if(ch == '-')f *= -1;ch = getchar();}while(isdigit(ch)){x = x * 10 + ch - 48; ch = getchar();}x *= f;}
template<typename T, typename... Args>
void read(T &first, Args& ... args) {read(first);read(args...);}
template<typename T>
void write(T arg) {T x = arg;if(x < 0) {putchar('-'); x =- x;}if(x > 9) {write(x / 10);}putchar(x % 10 + '0');}
template<typename T, typename ... Ts>
void write(T arg, Ts ... args) {write(arg);if(sizeof...(args) != 0) {putchar(' ');write(args ...);}}
using namespace std;

ll gcd(ll a, ll b) {
    return b == 0 ? a : gcd(b, a % b);
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}
const int N = 18000005;
int n , m, s, x , cnt , L , R;
int b[N], root[N] , siz[N], trie[N][2] ;
void split(int num)
{
    for (int i = 0 ; i <= 24 ; i ++)
    {
        if(num & 1) b[i] = 1 ; else b[i] = 0;
        num >>= 1;
    }
}
void update(int& rt , int pre)
{
    rt = ++ cnt;
    int now = rt;
    siz[now] = siz[pre] + 1;
    for (int i = 24 ; i >= 0 ; i --)
    {
        trie[now][b[i]] = ++ cnt;
        trie[now][b[i]^1] = trie[pre][b[i]^1];
        now = trie[now][b[i]] , pre = trie[pre][b[i]];
        siz[now] = siz[pre] + 1;
    }
}
int query(int l , int r)
{
    int ans = 0;
    for (int i = 24 ; i >= 0 ; i --)
    {
        ans <<= 1;
        if (siz[trie[r][b[i]^1]] - siz[trie[l][b[i]^1]] > 0)
        {
            ans |= 1;
            l = trie[l][b[i]^1] , r = trie[r][b[i]^1];
        }
        else
            l = trie[l][b[i]] , r = trie[r][b[i]];
    }
    return ans;
}
int main()
{
    read(n , m);
    update(root[0], 0);
    for (int i = 1 ; i <= n ; i ++)
    {
        read(x);
        s ^= x;
        split(s);
        update(root[i] , root[i-1]);
    }
    char ch[5];
    for (int i = 1 ; i <= m ; i ++)
    {
        scanf("%s", ch);
        if(ch[0] == 'A')
        {
            ++ n;
            read(x);
            s ^= x;
            split(s);
            update(root[n], root[n-1]);
        }
        else
        {
            read(L,R,x);
            split(s ^ x);
            write(query(root[L-2],root[R-1])),LF;
            //这个地方是维护区间 l <= p + 1 <= r => l -1 <= p <= r - 1 => query(l-2,r);
        }
    }
}

//#define LOCAL
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mem(a, b) memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
#define DNF 0x7f
#define DBG printf("this is a input\n")
#define fi first
#define se second
#define mk(a, b) make_pair(a,b)
#define pb push_back
#define LF putchar('\n')
#define SP putchar(' ')
#define p_queue priority_queue
#define CLOSE ios::sync_with_stdio(0); cin.tie(0)

template<typename T>
void read(T &x) {x = 0;char ch = getchar();ll f = 1;while(!isdigit(ch)){if(ch == '-')f *= -1;ch = getchar();}while(isdigit(ch)){x = x * 10 + ch - 48; ch = getchar();}x *= f;}
template<typename T, typename... Args>
void read(T &first, Args& ... args) {read(first);read(args...);}
template<typename T>
void write(T arg) {T x = arg;if(x < 0) {putchar('-'); x =- x;}if(x > 9) {write(x / 10);}putchar(x % 10 + '0');}
template<typename T, typename ... Ts>
void write(T arg, Ts ... args) {write(arg);if(sizeof...(args) != 0) {putchar(' ');write(args ...);}}
using namespace std;

ll gcd(ll a, ll b) {
    return b == 0 ? a : gcd(b, a % b);
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}
const int N = 18000005;
int trie[N][2] , latest[N];
int s[N] , root[N], n , m , tot;
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()
{
    cin >> n >> m;
    latest[0] = -1;
    root[0] = ++ tot;
    insert (0, 23, 0 , root[0]);
    for (int i = 1 ;i <= n ; i ++)
    {
        int x;
        read(x);
        s[i] = s[i-1] ^ x;
        root[i] = ++ tot;
        insert(i , 23, root[i - 1], root[i]);
    }
    for (int i = 1; i <= m ; i ++)
    {
        char op[2];
        scanf("%s", op);
        if(op[0] == 'A')
        {
            int x;
            read(x);
            root[ ++ n] = ++ tot;
            s[n] = s[n-1] ^ x;
            insert(n ,23, root[n-1], root[n]);
        }
        else
        {
            int l , r, x;
            read(l , r, x);
            write(ask(root[r-1], x ^ s[n], 23, l - 1)), LF;
        }
    }
}