安装了为1,未安装为0;
Install操作:从该点到根,查询0的个数,并全部附为1;
Uninstall操作:已该点为根的子树,查询1的个数,并全部附为0;
(这么sb的题,做了我一个小时。犯了什么错误简直不想再说了。。)
【代码】
#include <iostream>
#include <cstdio>
#include <algorithm>
#define N 100005
#define M 8000005
#define mod 1000000
#define INF 0x7fffffff
using namespace std;
int read()
{
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-') f=-1;ch=getchar();}
while(isdigit(ch)){x=(x<<1)+(x<<3)+ch-'0';ch=getchar();}
return x*f;
}
int n,m,cnt,ind,ans;
int b[N],p[N],nextedge[N],w[N];
int fa[N],sz[N],son[N],top[N],ftree[N],deep[N],pos[N];
class Seg_Tree{
public:
int l,r,sum,tag;
}e[N<<2];
void Add(int x,int y)
{
cnt++;
b[cnt]=y;
nextedge[cnt]=p[x];
p[x]=cnt;
}
void Dfs(int x)
{
sz[x]=1;
for(int i=p[x];i;i=nextedge[i])
{
int v=b[i];
deep[v]=deep[x]+1;
Dfs(v);
sz[x]+=sz[v];
son[x]=sz[son[x]]>sz[v]?son[x]:v;
}
}
void dfs(int x,int root)
{
top[x]=root;pos[x]=++ind;ftree[pos[x]]=x;
if(!son[x]) return;
dfs(son[x],root);
for(int i=p[x];i;i=nextedge[i])
{
int v=b[i];
if(v==son[x]) continue;
dfs(v,v);
}
}
void pushup(int p){
e[p].sum=e[p<<1].sum+e[p<<1|1].sum;
}
void pushdown(int p){
if(e[p].tag!=-1)
{
e[p<<1].tag=e[p<<1|1].tag=e[p].tag;
e[p<<1].sum=(e[p<<1].r-e[p<<1].l+1)*e[p].tag;
e[p<<1|1].sum=(e[p<<1|1].r-e[p<<1|1].l+1)*e[p].tag;
e[p].tag=-1;
}
}
void Build(int p,int l,int r)
{
e[p].l=l,e[p].r=r;e[p].tag=-1;
if(l==r) return;
int mid=l+r>>1;
Build(p<<1,l,mid);Build(p<<1|1,mid+1,r);
}
void Query(int p,int x,int y,int Flag)
{
int l=e[p].l,r=e[p].r,mid=l+r>>1;
if(l==x&&y==r)
{
ans+=(Flag)?e[p].sum:r-l+1-e[p].sum;
return;
}
pushdown(p);
if(y<=mid) Query(p<<1,x,y,Flag);
else if(x>mid) Query(p<<1|1,x,y,Flag);
else Query(p<<1,x,mid,Flag),Query(p<<1|1,mid+1,y,Flag);
}
void Update(int p,int x,int y,int z)
{
int l=e[p].l,r=e[p].r,mid=l+r>>1;
if(l==x&&y==r)
{
e[p].tag=z;e[p].sum=(r-l+1)*z;
return;
}
pushdown(p);
if(y<=mid) Update(p<<1,x,y,z);
else if(x>mid) Update(p<<1|1,x,y,z);
else Update(p<<1,x,mid,z),Update(p<<1|1,mid+1,y,z);
pushup(p);
}
void Solve_Install(int x)
{
int fx=top[x];
while(fx!=1)
{
Query(1,pos[fx],pos[x],0);
Update(1,pos[fx],pos[x],1);
x=fa[fx],fx=top[x];
}
Query(1,1,pos[x],0),Update(1,1,pos[x],1);
}
void Solve_Uninstall(int x)
{
Query(1,pos[x],pos[x]+sz[x]-1,1);
Update(1,pos[x],pos[x]+sz[x]-1,0);
}
void Solve()
{
m=read();
while(m--)
{
char ch[10];static int x;
scanf("%s",ch);x=read()+1;ans=0;
if(ch[0]=='i') Solve_Install(x);
else Solve_Uninstall(x);
printf("%d\n",ans);
}
}
int main()
{
n=read();
for(int i=2;i<=n;i++) fa[i]=read()+1,Add(fa[i],i);
Dfs(1);dfs(1,1);Build(1,1,n);
Solve();
return 0;
}