Codeforces Round #442 (Div. 2)-E-Danil and a Part-time Job（DFS序+线段树区间更新）

E. Danil and a Part-time Job

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Danil decided to earn some money, so he had found a part-time job. The interview have went well, so now he is a light switcher.

Danil works in a rooted tree (undirected connected acyclic graph) with n vertices, vertex 1 is the root of the tree. There is a room in each vertex, light can be switched on or off in each room. Danil's duties include switching light in all rooms of the subtree of the vertex. It means that if light is switched on in some room of the subtree, he should switch it off. Otherwise, he should switch it on.

Unfortunately (or fortunately), Danil is very lazy. He knows that his boss is not going to personally check the work. Instead, he will send Danil tasks using Workforces personal messages.

There are two types of tasks:

1. pow v describes a task to switch lights in the subtree of vertex v.
2. get v describes a task to count the number of rooms in the subtree of v, in which the light is turned on. Danil should send the answer to his boss using Workforces messages.

A subtree of vertex v is a set of vertices for which the shortest path from them to the root passes through v. In particular, the vertex v is in the subtree of v.

Danil is not going to perform his duties. He asks you to write a program, which answers the boss instead of him.

Input

The first line contains a single integer n (1 ≤ n ≤ 200 000) — the number of vertices in the tree.

The second line contains n - 1 space-separated integers p2, p3, ..., pn (1 ≤ pi < i), where pi is the ancestor of vertex i.

The third line contains n space-separated integers t1, t2, ..., tn (0 ≤ ti ≤ 1), where ti is 1, if the light is turned on in vertex i and 0otherwise.

The fourth line contains a single integer q (1 ≤ q ≤ 200 000) — the number of tasks.

The next q lines are get v or pow v (1 ≤ v ≤ n) — the tasks described above.

Output

For each task get v print the number of rooms in the subtree of v, in which the light is turned on.

Example

input

4
1 1 1
1 0 0 1
9
get 1
get 2
get 3
get 4
pow 1
get 1
get 2
get 3
get 4

output

2
0
0
1
2
1
1
0

Note

题意：给你一棵树，每个节点表示灯的开关状态，两种操作

pow x 表示将以x为根的子树上的所有灯的状态翻转

get  x 表示查询以x为根的子树上所有开着的灯的个数

题解：这道题和我之前学习dfs序的一道题很像，但是这道题每次更新的是整个子树

因此我们需要先求出dfs序，然后加入线段树中，用线段树区间更新完成操作（算是复习了一发）

#include<vector>
#include<stdio.h>
#include<algorithm>
using namespace std;       
#define maxn 201005     
vector<int>q[maxn];    
int a[maxn],n,qq,st[maxn],ed[maxn];     
int cnt,sum[maxn*6],lazy[maxn*6],ide[maxn]; 
void dfs(int u)
{
	st[u]=++cnt;ide[cnt]=u;
	for(int i=0;i<q[u].size();i++)
		dfs(q[u][i]);              
	ed[u]=cnt;
}
void pushdown(int id,int l,int r)
{
	if(lazy[id])
	{
		int mid=(l+r)/2;
		sum[id*2]=(mid-l+1)-sum[id*2];
		lazy[id*2]^=1;   
		sum[id*2+1]=(r-mid-1+1)-sum[id*2+1];
		lazy[id*2+1]^=1;
		lazy[id]=0;             
	}   
}   
void build(int id,int l,int r)
{
	if(l==r)           
	{     
		sum[id]=a[ide[l]];
		return;
	}   
	int mid=(l+r)/2;
	build(id*2,l,mid);
	build(id*2+1,mid+1,r);
	sum[id]=sum[id*2]+sum[id*2+1];
}
void update(int id,int l,int r,int L,int R)
{
	if(l>=L && r<=R)
	{
		sum[id]=(r-l+1)-sum[id];  
		lazy[id]^=1;
		return;
	} 
	pushdown(id,l,r);
	int mid=(l+r)/2;
	if(mid>=L)
		update(id*2,l,mid,L,R);
	if(R>mid) 
		update(id*2+1,mid+1,r,L,R);   
	sum[id]=sum[id*2]+sum[id*2+1];    
}
int query(int id,int l,int r,int L,int R)
{    
	if(l>=L && r<=R)        
		return sum[id];
	pushdown(id,l,r);
	int res=0,mid=(l+r)/2;
	if(L<=mid)
		res+=query(id*2,l,mid,L,R);
	if(R>mid)
		res+=query(id*2+1,mid+1,r,L,R);
	sum[id]=sum[id*2]+sum[id*2+1];
	return res;
}
int main(void)
{    
	int i,x; 
	scanf("%d",&n);   
	for(i=2;i<=n;i++)  
		scanf("%d",&x),q[x].push_back(i);
	for(i=1;i<=n;i++)
		scanf("%d",&a[i]);
	dfs(1);build(1,1,n);
	scanf("%d",&qq);
	while(qq--)
	{
		char s[10];
		scanf("%s%d",s,&x);
		if(s[0]=='p')
			update(1,1,n,st[x],ed[x]);
		else
			printf("%d\n",query(1,1,n,st[x],ed[x]));
	}
	return 0;
}
/*
10
1 2 3 4 2 4 1 7 8
1 1 0 1 1 0 0 0 1 1
10
pow 1
get 2
pow 2
pow 8
get 6
pow 6
pow 10
get 6
pow 8
pow 3
*/