(树链剖分)软件包管理器

https://www.lydsy.com/JudgeOnline/problem.php?id=4196

 

#include<cstdio>
#include<iostream>
using namespace std;
const int Maxn=200005;
int fa[Maxn],top[Maxn],sz[Maxn],son[Maxn],deep[Maxn],idx[Maxn],h[Maxn],cnt,tcnt;
struct node{
	int v,w,next;
}e[Maxn*2];
struct tree{
	int x,c,l,r;
}t[Maxn*4];
int n,m,root,mod;
int dfs1(int u){
	sz[u]=1;
	int heavy=0,maxn=0;
	for(int i=h[u];i;i=e[i].next){
		int v=e[i].v;
		if(deep[v])continue;
		deep[v]=deep[u]+1;
		fa[v]=u;
		int tmp=dfs1(v);
		if(tmp>maxn){
			maxn=tmp;
			heavy=v;
		}
		sz[u]+=tmp;
	}
	son[u]=heavy;
	return sz[u];
}
void dfs2(int u){
	idx[u]=++tcnt;
	if(!son[u])return;
	top[son[u]]=top[u];
	dfs2(son[u]);
	for(int i=h[u];i;i=e[i].next){
		int v=e[i].v;
		if(idx[v])continue;
		top[v]=v;
		dfs2(v);
	}
}
void build(int l,int r,int rt){
	t[rt].l=l;t[rt].r=r;t[rt].c=-1;
	if(l==r)return;
	int mid=l+r>>1;
	build(l,mid,rt<<1);
	build(mid+1,r,rt<<1|1);
	t[rt].x=t[rt<<1].x+t[rt<<1|1].x;
}
inline void pushdown(int rt){
	if(t[rt].l==t[rt].r)return;
	if(t[rt].c==-1)return;
	t[rt<<1].c=t[rt].c;
	t[rt<<1|1].c=t[rt].c;
	t[rt<<1].x=t[rt].c*(t[rt<<1].r-t[rt<<1].l+1);
	t[rt<<1|1].x=t[rt].c*(t[rt<<1|1].r-t[rt<<1|1].l+1);
	t[rt].c=-1;
}
void update(int l,int r,int rt){
	if(t[rt].l>=l&&t[rt].r<=r){
		t[rt].x=t[rt].r-t[rt].l+1;
		t[rt].c=1;
		return;
	}
	pushdown(rt);
	int mid=t[rt].l+t[rt].r>>1;
	if(l<=mid){
		update(l,r,rt<<1);
	}
	if(r>mid){
		update(l,r,rt<<1|1);
	}
	t[rt].x=t[rt<<1].x+t[rt<<1|1].x;
}
void clear(int l,int r,int rt){
	if(t[rt].l>=l&&t[rt].r<=r){
		t[rt].x=0;
		t[rt].c=0;
		return;
	}
	pushdown(rt);
	int mid=t[rt].l+t[rt].r>>1;
	if(l<=mid){
		clear(l,r,rt<<1);
	}
	if(r>mid){
		clear(l,r,rt<<1|1);
	}
	t[rt].x=t[rt<<1].x+t[rt<<1|1].x;
}
int query(int l,int r,int rt){
	if(t[rt].l>=l&&t[rt].r<=r){
		return t[rt].x;
	}
	pushdown(rt);
	int mid=t[rt].l+t[rt].r>>1,ans=0;
	if(l<=mid){
		ans+=query(l,r,rt<<1);
	}
	if(r>mid){
		ans+=query(l,r,rt<<1|1);
	}
	return ans;
}
int install(int x){
	int ans=0,x0;
	while(x!=-1){
		x0=query(idx[top[x]],idx[x],1);
		update(idx[top[x]],idx[x],1);
		ans+=query(idx[top[x]],idx[x],1)-x0;
		x=fa[top[x]];
	}
	return ans;
}
int unstall(int x){
	int ans=query(idx[x],idx[x]+sz[x]-1,1);
	clear(idx[x],idx[x]+sz[x]-1,1);
	return ans;
}
void add(int u,int v){
	cnt++;
	e[cnt].v=v;
	e[cnt].next=h[u];
	h[u]=cnt;
}
int main(){
	int u;char s[25];
	fa[root]=-1;
	scanf("%d",&n); 
	for(int i=1;i<=n-1;i++){
		scanf("%d",&u);
		add(u,i); 
	}
	scanf("%d",&m);
	dfs1(root);dfs2(root);build(1,n+1,1);
	for(int i=1;i<=m;i++){
		scanf("%s",s);
		scanf("%d",&u);
		if(s[0]=='i')printf("%d\n",install(u));
		else printf("%d\n",unstall(u));
	}
}