#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ll,ii>
#define endl '\n'
struct node{
int s,e,m;
vector<int> val;
node *l,*r;
node (int _s,int _e){
s=_s,e=_e,m=s+e>>1;
if (s!=e){
l=new node(s,m);
r=new node(m+1,e);
}
}
void update(int i,int j){
val.push_back(j);
if (s==e) return;
else if (i<=m) l->update(i,j);
else r->update(i,j);
}
int query(int i,int j,int k){
if (s==i && e==j){
int ans=0;
for (auto &it:val) ans=max(ans,it^k);
return ans;
}
else if (j<=m) return l->query(i,j,k);
else if (m<i) return r->query(i,j,k);
else return max(l->query(i,m,k),r->query(m+1,j,k));
}
}*root=new node(0,300005);
struct Q{
char t;
int a,b;
Q (char _t,int _a,int _b){
t=_t,a=_a,b=_b;
}
};
int n;
vector<int> al[300005];
int val[300005];
int in[300005];
int out[300005];
int DFS_TIME=0;
void dfs(int i,int p){
in[i]=++DFS_TIME;
for (auto &it:al[i]){
if (it==p) continue;
dfs(it,i);
}
out[i]=DFS_TIME;
}
vector<Q> queries;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cin>>n;
string s;
int a,b;
for (int x=0;x<n;x++){
cin>>s>>a>>b;
queries.push_back(Q(s[0],a,b));
}
int index=2;
for (auto &it:queries){
if (it.t=='A'){
al[it.a].push_back(index);
al[index].push_back(it.a);
val[index]=val[it.a]^it.b;
index++;
}
}
dfs(1,-1);
//for (int x=1;x<index;x++) cout<<val[x]<<" "<<in[x]<<" "<<out[x]<<endl;
index=2;
for (auto &it:queries){
if (it.t=='A'){
//cout<<in[index]<<" "<<val[index]<<endl;
root->update(in[index],val[index]);
index++;
}
else{
//cout<<in[it.b]<<" "<<out[it.b]<<" "<<val[it.a]<<endl;
cout<<root->query(in[it.b],out[it.b],val[it.a])<<endl;
}
}
}
Compilation message
klasika.cpp: In constructor 'node::node(int, int)':
klasika.cpp:15:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
s=_s,e=_e,m=s+e>>1;
~^~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
69 ms |
45048 KB |
Output is correct |
2 |
Incorrect |
49 ms |
44920 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
69 ms |
45048 KB |
Output is correct |
2 |
Incorrect |
49 ms |
44920 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
4841 ms |
58972 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
69 ms |
45048 KB |
Output is correct |
2 |
Incorrect |
49 ms |
44920 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |