rt，没加一60pts，加一就过了。

没有加一的代码（60pts）

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=(1e5)+5;
int n;
vector<int>g[maxn];
int fa[maxn],dep[maxn],siz[maxn],son[maxn];
void dfs1(int u){
	son[u]=-1;
	siz[u]=1;
	for(int i=0;i<g[u].size();i++){
		int v=g[u][i];
		fa[v]=u;
		dep[v]=dep[u]+1;
		dfs1(v);
		siz[u]+=siz[v];
		if(son[u]==-1||siz[son[u]]<siz[v])son[u]=v;
	}
}
int id[maxn],dfn[maxn],top[maxn],cnt=0;
void dfs2(int u,int tp){
	dfn[u]=++cnt;
	id[cnt]=u;
	top[u]=tp;
	if(son[u]==-1)return;
	dfs2(son[u],tp);
	for(int i=0;i<g[u].size();i++){
		int v=g[u][i];
		if(v!=son[u])dfs2(v,v);
	}
}
int a[maxn];
int tree[maxn<<3],lazy[maxn<<3];
void pushdown(int s,int t,int m,int p){
	if(s!=t){
		tree[p<<1]=lazy[p]*(m-s+1);
		tree[p<<1|1]=lazy[p]*(t-m);
		lazy[p<<1]=lazy[p];
		lazy[p<<1|1]=lazy[p];
	}
	lazy[p]=-1;
}
void cover(int l,int r,int s,int t,int p,int x){
	if(l<=s&&r>=t){
		tree[p]=(t-s+1)*x;
		lazy[p]=x;
		return;
	}
	if(l>t||r<s)return;
	int m=(s+t)>>1;
	if(lazy[p]!=-1)pushdown(s,t,m,p);
	if(l<=m)cover(l,r,s,m,p<<1,x);
	if(r>m)cover(l,r,m+1,t,p<<1|1,x);
	tree[p]=tree[p<<1]+tree[p<<1|1];
}
int getsum(int l,int r,int s,int t,int p){
	if(l<=s&&r>=t){
		return tree[p];
	}
	if(l>t||r<s)return 0;
	int m=(s+t)>>1;
	if(lazy[p]!=-1)pushdown(s,t,m,p);
	int ans=0;
	if(l<=m)ans=getsum(l,r,s,m,p<<1);
	if(r>m)ans+=getsum(l,r,m+1,t,p<<1|1);
	return ans;
}
int getans(int x,int y){
	int ans=0;
	while(top[x]!=top[y]){
		if(dep[top[x]]<dep[top[y]])swap(x,y);
		ans+=getsum(dfn[top[x]],dfn[x],0,n-1,1);
		x=fa[top[x]];
	}
	if(dep[x]>dep[y])swap(x,y);
	ans+=getsum(dfn[x],dfn[y],0,n-1,1);
	return ans;
}
void ope(int x,int y,int t){
	while(top[x]!=top[y]){
		if(dep[top[x]]<dep[top[y]])swap(x,y);
		cover(dfn[top[x]],dfn[x],0,n-1,1,t);
		x=fa[top[x]];
	}
	if(dep[x]>dep[y])swap(x,y);
	cover(dfn[x],dfn[y],0,n-1,1,t);
}
int main(){
	scanf("%d",&n);
	for(int i=1;i<n;i++){
		int x;
		scanf("%d",&x);
		g[x].push_back(i);
	}
	dfs1(0);
	dfs2(0,0);
	for(int i=0;i<=n<<2;i++)lazy[i]=-1;
	int q;
	scanf("%d",&q);
	while(q--){
		string s;
		int x;
		cin>>s;
		scanf("%d",&x);
		if(s[0]=='i'){
			int ans1=getans(0,x);
			ope(0,x,1);
			int ans2=dep[x]+1;
			printf("%d\n",ans2-ans1);
		}
		else{
			int ans=getsum(dfn[x],dfn[x]+siz[x]-1,0,n-1,1);
			cover(dfn[x],dfn[x]+siz[x]-1,0,n-1,1,0);
			printf("%d\n",ans);
		}
	}
	return 0;
}

有加一的代码（AC）

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=(1e5)+5;
int n;
vector<int>g[maxn];
int fa[maxn],dep[maxn],siz[maxn],son[maxn];
void dfs1(int u){
	son[u]=-1;
	siz[u]=1;
	for(int i=0;i<g[u].size();i++){
		int v=g[u][i];
		fa[v]=u;
		dep[v]=dep[u]+1;
		dfs1(v);
		siz[u]+=siz[v];
		if(son[u]==-1||siz[son[u]]<siz[v])son[u]=v;
	}
}
int id[maxn],dfn[maxn],top[maxn],cnt=0;
void dfs2(int u,int tp){
	dfn[u]=++cnt;
	id[cnt]=u;
	top[u]=tp;
	if(son[u]==-1)return;
	dfs2(son[u],tp);
	for(int i=0;i<g[u].size();i++){
		int v=g[u][i];
		if(v!=son[u])dfs2(v,v);
	}
}
int a[maxn];
int tree[maxn<<2],lazy[maxn<<2];
void pushdown(int s,int t,int m,int p){
	if(s!=t){
		tree[p<<1]=lazy[p]*(m-s+1);
		tree[p<<1|1]=lazy[p]*(t-m);
		lazy[p<<1]=lazy[p];
		lazy[p<<1|1]=lazy[p];
	}
	lazy[p]=-1;
}
void cover(int l,int r,int s,int t,int p,int x){
	if(l<=s&&r>=t){
		tree[p]=(t-s+1)*x;
		lazy[p]=x;
		return;
	}
	if(l>t||r<s)return;
	int m=(s+t)>>1;
	if(lazy[p]!=-1)pushdown(s,t,m,p);
	if(l<=m)cover(l,r,s,m,p<<1,x);
	if(r>m)cover(l,r,m+1,t,p<<1|1,x);
	tree[p]=tree[p<<1]+tree[p<<1|1];
}
int getsum(int l,int r,int s,int t,int p){
	if(l<=s&&r>=t){
		return tree[p];
	}
	if(l>t||r<s)return 0;
	int m=(s+t)>>1;
	if(lazy[p]!=-1)pushdown(s,t,m,p);
	int ans=0;
	if(l<=m)ans=getsum(l,r,s,m,p<<1);
	if(r>m)ans+=getsum(l,r,m+1,t,p<<1|1);
	return ans;
}
int getans(int x,int y){
	int ans=0;
	while(top[x]!=top[y]){
		if(dep[top[x]]<dep[top[y]])swap(x,y);
		ans+=getsum(dfn[top[x]],dfn[x],1,n,1);
		x=fa[top[x]];
	}
	if(dep[x]>dep[y])swap(x,y);
	ans+=getsum(dfn[x],dfn[y],1,n,1);
	return ans;
}
void ope(int x,int y,int t){
	while(top[x]!=top[y]){
		if(dep[top[x]]<dep[top[y]])swap(x,y);
		cover(dfn[top[x]],dfn[x],1,n,1,t);
		x=fa[top[x]];
	}
	if(dep[x]>dep[y])swap(x,y);
	cover(dfn[x],dfn[y],1,n,1,t);
}
int main(){
	scanf("%d",&n);
	for(int i=1;i<n;i++){
		int x;
		scanf("%d",&x);
		g[x+1].push_back(i+1);
	}
	dfs1(1);
	dfs2(1,1);
	for(int i=1;i<=n<<2;i++)lazy[i]=-1;
	int q;
	scanf("%d",&q);
	while(q--){
		string s;
		int x;
		cin>>s;
		scanf("%d",&x);
		++x;
		if(s[0]=='i'){
			int ans1=getans(1,x);
			ope(1,x,1);
			int ans2=dep[x]+1;
			printf("%d\n",ans2-ans1);
		}
		else{
			int ans=getsum(dfn[x],dfn[x]+siz[x]-1,1,n,1);
			cover(dfn[x],dfn[x]+siz[x]-1,1,n,1,0);
			printf("%d\n",ans);
		}
	}
	return 0;
}

谢谢