wa on #4

#include<bits/stdc++.h>
#define int long long
#define lc(p) (p<<1)
#define rc(p) (p<<1|1)
using namespace std;
using ll=long long;
const int N=1e6+7;
vector<int>G[N];
int L[N],sum[N],a[N],R[N];
int tag[N],tree[N<<2];
int n,q;
int cnt=0;
void dfs(int u,int fa){
	sum[++cnt]=u;
	L[u]=cnt;
	for(int i=0;i<G[u].size();i++){
		dfs(G[u][i],u);
	}
	R[u]=cnt;
}
void push_up(int p){
	tree[p]=tree[lc(p)]+tree[rc(p)];
}
void push_down(int p,int pl,int pr){
	if(tag[p]){
		int mid=(pl+pr)>>1;
		tag[lc(p)]^=1;
		tree[lc(p)]=(pr-pl+1-((pr-pl+1)>>1))-tree[lc(p)];
		tree[rc(p)]=((pr-pl+1)>>1)-tree[rc(p)];
		tag[rc(p)]^=1;
		tag[p]=0;
	}
}
void build(int p,int pl,int pr){
	if(pl==pr){
		tree[p]=a[pl];
		return ;
	}
	int mid=(pl+pr)>>1;
	build(lc(p),pl,mid);
	build(rc(p),mid+1,pr);
	push_up(p); 
}
void update(int L,int R,int p,int pl,int pr){
	if(L<=pl&&pr<=R){
		tree[p]=(pr-pl+1)-tree[p];
		tag[p]^=1;
		return;
	}
	push_down(p,pl,pr);
	int mid=(pl+pr)>>1;
	if(L<=mid) update(L,R,lc(p),pl,mid);
	if(R>mid) update(L,R,rc(p),mid+1,pr);
	push_up(p);
}
int query(int L,int R,int p,int pl,int pr){
	if(L<=pl&&pr<=R){
		return tree[p];
	}
	push_down(p,pl,pr);
	int res=0;
	int mid=(pl+pr)>>1;
	if(L<=mid){
		res+=query(L,R,lc(p),pl,mid);
	}
	if(R>mid){
		res+=query(L,R,rc(p),mid+1,pr);
	}
	return res;
}
signed main(){
	cin>>n;
	for(int i=1;i<n;i++){
		int x;
		cin>>x;
		G[x].push_back(i+1);
	}
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	dfs(1,-1);
	build(1,1,n);
	cin>>q;
	while(q--){
		string s;
		int x;
		cin>>s>>x;
		if(s=="get"){
			cout<<query(L[x],R[x],1,1,n)<<"\n";
		}
		else{
			update(L[x],R[x],1,1,n);
		}
	}
	return 0;
}