bzoj4196 [Noi2015]软件包管理器（树链剖分）

树链剖分小水题～维护区间白点个数即可。
复杂度$O(nlog^2n)$

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 100010
inline char gc(){
    static char buf[1<<16],*S,*T;
    if(S==T){T=(S=buf)+fread(buf,1,1<<16,stdin);if(T==S) return EOF;}
    return *S++;
}
inline int read(){
    int x=0,f=1;char ch=gc();
    while(ch<'0'||ch>'9'){if(ch=='-') f=-1;ch=gc();}
    while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=gc();
    return x*f;
}
char op[20];
inline void get_S(){
    char ch=gc();int tot=0;
    while(ch<'a'||ch>'z') ch=gc();
    while(ch>='a'&&ch<='z') op[++tot]=ch,ch=gc();
}
int n,fa[N],in[N],out[N],dfn=0,sz[N],son[N],top[N];
vector<int>Son[N];
struct node{
    int x,tag;
}tr[N<<2];
inline void dfs1(int x){
    sz[x]=1;son[x]=0;
    for(int i=0;i<Son[x].size();++i){
        int y=Son[x][i];dfs1(y);sz[x]+=sz[y];
        if(sz[y]>sz[son[x]]) son[x]=y;
    }
}
inline void dfs2(int x,int tp){
    in[x]=++dfn;top[x]=tp;
    if(son[x]) dfs2(son[x],tp);
    for(int i=0;i<Son[x].size();++i){
        int y=Son[x][i];if(y==son[x]) continue;dfs2(y,y);
    }out[x]=dfn;
}
inline void docov(int p,int l,int r,int ty){
    tr[p].tag=ty;tr[p].x=(r-l+1)*ty;
}
inline void pushdown(int p,int l,int r){
    if(tr[p].tag==-1) return;int mid=l+r>>1;
    docov(p<<1,l,mid,tr[p].tag);
    docov(p<<1|1,mid+1,r,tr[p].tag);tr[p].tag=-1;
}
inline void pushup(int p){
    tr[p].x=tr[p<<1].x+tr[p<<1|1].x;
}
inline int ask1(int p,int l,int r,int x,int y){
    if(x<=l&&r<=y){int res=r-l+1-tr[p].x;docov(p,l,r,1);return res;}
    int mid=l+r>>1,res=0;pushdown(p,l,r);
    if(x<=mid) res+=ask1(p<<1,l,mid,x,y);
    if(y>mid) res+=ask1(p<<1|1,mid+1,r,x,y);pushup(p);return res;
}
inline int ask2(int p,int l,int r,int x,int y){
    if(x<=l&&r<=y){int res=tr[p].x;docov(p,l,r,0);return res;}
    int mid=l+r>>1,res=0;pushdown(p,l,r);
    if(x<=mid) res+=ask2(p<<1,l,mid,x,y);
    if(y>mid) res+=ask2(p<<1|1,mid+1,r,x,y);pushup(p);return res;
}
inline int doask1(int x){
    int res=0;
    while(top[x]!=1){
        res+=ask1(1,1,n,in[top[x]],in[x]);x=fa[top[x]];
    }res+=ask1(1,1,n,1,in[x]);return res;
}
inline void build(int p,int l,int r){
    tr[p].tag=-1;if(l==r) return;int mid=l+r>>1;
    build(p<<1,l,mid);build(p<<1|1,mid+1,r);
}
int main(){
//  freopen("a.in","r",stdin);
    n=read();
    for(int i=2;i<=n;++i) fa[i]=read()+1,Son[fa[i]].push_back(i);
    dfs1(1);dfs2(1,1);build(1,1,n);int m=read();
    while(m--){
        get_S();int x=read()+1;
        if(op[1]=='i'){
            printf("%d\n",doask1(x));continue;
        }printf("%d\n",ask2(1,1,n,in[x],out[x]));
    }return 0;
}