analysis
手推一下数据可以得到:如果对于依赖关系(a,b),我们将b连向a(将边反向),这样的话,安装软件包就意味着查询从这个点到根节点这条路径上已安装的软件包的个数然后将其全部赋值1,卸载软件包就意味着查询以这个点为根节点的子树内已安装的个数然后将其清零
树链剖分是没错了,但同时要对线段树的操作进行改进,即将区间全部赋值1和全部赋值0而不是累加
注意不要把线段树打残了,否则调试半天
code
#include<bits/stdc++.h>
using namespace std;
#define loop(i,start,end) for(register int i=start;i<=end;++i)
#define anti_loop(i,start,end) for(register int i=start;i>=end;--i)
#define clean(arry,num) memset(arry,num,sizeof(arry))
#define max(a,b) ((a>b)?a:b)
#define min(a,b) ((a<b)?a:b)
#define ll long long
int n,cnt=0;
const int maxn=100000+10;
struct node{
int e;int nxt;
}edge[maxn<<1];
int head[maxn];
int dep[maxn],son[maxn],fa[maxn],siz[maxn];
int rev[maxn],seg[maxn],top[maxn];
ll sum[maxn<<2],lazy[maxn<<2];
template<typename T>void read(T &x){
x=0;char r=getchar();T neg=1;
while(r>'9'||r<'0'){if(r=='-')neg=-1;r=getchar();}
while(r>='0'&&r<='9'){x=(x<<1)+(x<<3)+r-'0';r=getchar();}
x*=neg;
}
void dfs1(int u,int f){
dep[u]=dep[f]+1;siz[u]=1;
fa[u]=f;
for(int i=head[u];i!=-1;i=edge[i].nxt){
int v=edge[i].e;
if(v==f)continue;
dfs1(v,u);
siz[u]+=siz[v];
son[u]=((siz[son[u]]>siz[v])?son[u]:v);
}
}
void dfs2(int u,int f){
if(son[u]){
seg[son[u]]=++seg[0];
rev[seg[0]]=son[u];
top[son[u]]=top[u];
dfs2(son[u],u);
}
for(int i=head[u];i!=-1;i=edge[i].nxt){
int v=edge[i].e;
if(!top[v]){
seg[v]=++seg[0];
rev[seg[0]]=v;
top[v]=v;
dfs2(v,u);
}
}
}
inline void addl(int u,int v){
edge[cnt].e=v;
edge[cnt].nxt=head[u];
head[u]=cnt++;
}
inline void pushdown(int rt,int l,int r){
if(lazy[rt]==0)return;
lazy[rt<<1]=lazy[rt<<1|1]=lazy[rt];
sum[rt<<1]=((lazy[rt]==1)?(((l+r)>>1)-l+1):0);//(r-(((l+r)>>1)+1)+1));
sum[rt<<1|1]=((lazy[rt]==1)?(r-(((l+r)>>1)+1)+1):0);
lazy[rt]=0;
}
inline void pushup(int rt){
sum[rt]=sum[rt<<1]+sum[rt<<1|1];
}
inline void buildtree(){
clean(sum,0);clean(lazy,0);
}
ll query(int l,int r,int nl,int nr,int rt){
if(l<=nl&&nr<=r)return sum[rt];
pushdown(rt,nl,nr);
int mid=(nl+((nr-nl)>>1));
ll _sum=0;
if(mid>=l)_sum+=query(l,r,nl,mid,rt<<1);
if(mid<r)_sum+=query(l,r,mid+1,nr,rt<<1|1);
return _sum;
}
void update(int l,int r,int nl,int nr,int rt,bool w){
if(l<=nl&&nr<=r){
sum[rt]=((w)?(nr-nl+1):(0));
lazy[rt]=((w)?1:-1);
return;
}
pushdown(rt,nl,nr);
int mid=(nl+((nr-nl)>>1));
if(mid>=l)update(l,r,nl,mid,rt<<1,w);
if(mid<r)update(l,r,mid+1,nr,rt<<1|1,w);
pushup(rt);
}
inline void debug(char *r,int x){
printf(">>>>>>>>>>>>>>>>>>>>>%s %d\n",r,x);
loop(i,1,n){
printf("sumOne[%d]:%lld\n",i,query(seg[i],seg[i]+siz[i]-1,1,seg[0],1));
}
printf(">>>>>>>>>>>>>>>>>>>>>>>>>>>>\n");
}
inline void reply(){
buildtree();
int q;read(q);
loop(i,1,q){
register char op[100];register int x;
scanf("%s",op);read(x);++x;
if(op[0]=='i'){
int fx=top[x];
ll _num=0;int _n=0;
while(fx!=1){
_num+=query(seg[fx],seg[x],1,seg[0],1);
update(seg[fx],seg[x],1,seg[0],1,1);
_n+=seg[x]-seg[fx]+1;
x=fa[fx],fx=top[x];
}
_num+=query(seg[1],seg[x],1,seg[0],1);
update(seg[1],seg[x],1,seg[0],1,1);
_n+=seg[x]-seg[1]+1;
//_num+=query(seg[1],seg[x],1,seg[0],1);
printf("%lld\n",_n-_num);
}
else if(op[0]=='u'){
printf("%lld\n",query(seg[x],seg[x]+siz[x]-1,1,seg[0],1));
update(seg[x],seg[x]+siz[x]-1,1,seg[0],1,0);
}
//debug(op,x);
}
}
int main(){
#ifndef ONLINE_JUDGE
freopen("datain.txt","r",stdin);
#endif
clean(head,-1);read(n);clean(dep,0);clean(son,0);clean(fa,0);clean(siz,0);
loop(i,1,n-1){
int xi;read(xi);
addl(xi+1,i+1);//0基准?no!
}
dfs1(1,0);
seg[0]=1;seg[1]=1;rev[1]=1;top[1]=1;
dfs2(1,0);
//loop(i,1,n)printf("point:%d dep:%d son:%d fa:%d siz:%d rev:%d seg:%d top:%d\n",i,dep[i],son[i],fa[i],siz[i],rev[i],seg[i],top[i]);
//loop(i,1,n)printf("%d ",rev[i]);printf("\n");
reply();
return 0;
}