Codeforces Round #442 (Div. 2)E. Danil and a Part-time Job(线段树+dfs序)

题意：给你树上两个操作，1.统计子树内所有开着的灯的个数 2.将子树上所有灯状态改变。
dfs序将子树的操作映射到线性数组上进行操作。
代码如下：

#include<bits/stdc++.h>
#define lowbit(x) ((x)&(-(x)))
#define ll long long
#define INF 2147483647
#define CLR(a) memset(a, 0, sizeof(a))
using namespace std;
#define ls (rt<<1)
#define rs (rt<<1|1)
#define MID(a,b) (a+((b-a)>>1))
const int maxn=2e5+10;
int tim;
int in[maxn],out[maxn],dfn[maxn];//dfn为线性dfs序 
int t[maxn];
vector<int> G[maxn]; 
void dfs(int u,int fa){
	in[u]=++tim;
	dfn[tim]=u;
	for(int i=0;i<G[u].size();i++){
		int v=G[u][i];
		if(v==fa) continue;
		dfs(v,u);
	}
	out[u]=tim;
}

struct node{
	int l,r,sum;
	int lazy;
	int mid(){return MID(l,r);}
	int len(){return r-l+1;}
};

struct Segtree{
	node tree[maxn<<2];
	void push_up(int rt){
		tree[rt].sum=tree[ls].sum+tree[rs].sum;
	}
	void push_down(int rt){
		if(tree[rt].lazy){
			tree[ls].lazy^=1;
			tree[rs].lazy^=1;
			tree[ls].sum=tree[ls].len()-tree[ls].sum;
			tree[rs].sum=tree[rs].len()-tree[rs].sum;
			tree[rt].lazy=0;
		}
	}
	void build(int rt,int l,int r){
		tree[rt].l=l;tree[rt].r=r;tree[rt].lazy=0;
		if(l==r) tree[rt].sum=t[dfn[l]];
		else{
			int mid=tree[rt].mid();
			build(ls,l,mid);
			build(rs,mid+1,r);
			push_up(rt);
		}
	}
	void update(int rt,int st,int ed){
		int l=tree[rt].l,r=tree[rt].r;
		if(st<=l&&r<=ed){
			tree[rt].lazy^=1;
			tree[rt].sum=tree[rt].len()-tree[rt].sum;
		} 
		else{
			push_down(rt);
			int mid=tree[rt].mid();
			if(st<=mid) update(ls,st,ed);
			if(ed>mid) update(rs,st,ed);
			push_up(rt);
		}
	}
	int query(int rt,int st,int ed){
		int l=tree[rt].l,r=tree[rt].r;
		if(st<=l&&r<=ed) return tree[rt].sum;
		else{
			push_down(rt);
			int mid=tree[rt].mid();
			int ans=0;
			if(st<=mid) ans+=query(ls,st,ed);
			if(ed>mid) ans+=query(rs,st,ed);
			//-push_up(rt);
			return ans;
		} 
	}
}seg;

int main() {
	
	int n,x;cin>>n;
	for(int i=2;i<=n;i++){
		cin>>x;
		G[x].push_back(i);
		G[i].push_back(x);
	}
	for(int i=1;i<=n;i++) cin>>t[i];
	dfs(1,0);
	seg.build(1,1,n);
	int q;cin>>q;
	while(q--){
		char op[5];
		int v;
		scanf("%s%d",op,&v);
		if(op[0]=='p') seg.update(1,in[v],out[v]);
		else printf("%d\n",seg.query(1,in[v],out[v]));
	}
	return 0;
}