异或满足结合律吗_异或1⊕0的结果是

输入样例：
5 5
2 6 4 3 6
A 1 
Q 3 5 4 
A 4 
Q 5 7 0 
Q 3 6 6 
输出样例：
4
5
6

#include<bits/stdc++.h>
using namespace std;
const int K = 25;
const int M = 6e6 + 10;
const int N = 6e6 + 10;
int trie[M * K][2],ctx;
int root[N],max_id[M * K];
int s[N];
int query(int l,int p,int C){ 
   
    if(root == 0)return 0;
    for(int i = 24;i >= 0;i --){ 
   
        int a = ((C >> i) & 1);
        if(trie[p][a ^ 1] && max_id[trie[p][a ^ 1]] >= l){ 
   
            p = trie[p][a ^ 1];
        }else { 
   
            p = trie[p][a];
        }
    }
    return s[max_id[p]];
}
void insert(int bit,int x,int p,int q,int d){ 
   
    if(bit < 0){ 
   
        max_id[p] = d;
        return;
    }else{ 
   
        int a = ((x >> bit) & 1);
        if(q)trie[p][a ^ 1] = trie[q][a ^ 1];
        trie[p][a] = ++ ctx;
        int t = p;
        q = trie[q][a],p = trie[p][a];
        insert(bit - 1,x,p,q,d);
        max_id[t] = max(max_id[trie[t][0]],max_id[trie[t][1]]);
    }
}
int main(){ 
   
    int n,m;
    cin>>n>>m;
    int now = 0,x;
    int e = 0;
    for(int i = 0;i < n;i ++){ 
   
        scanf("%d",&x);
        root[i + 1] = ++ ctx;
        insert(24,x ^ now,root[i + 1],root[i],i + 1);
        now ^= x;
        s[i + 1] = now;
        e = x;
    }
    char t;
    int l,r;
    int c = 1;
    for(int i = 0;i < m; i++){ 
   
        scanf(" %c",&t);
        if(t == 'A'){ 
   
            scanf("%d",&x);
            root[n + c] = ++ ctx;
            insert(24,now ^ x,root[n + c],root[n + c - 1],n + c);
            now ^= x;
            s[n + c] = now;
            e = x;
            c ++;
        }
        else { 
   
            scanf("%d %d %d",&l,&r,&x);
            printf("%d\n",(query(l - 1,root[r - 1],now ^ x) ^ (now ^ x)));
        }
    }
}