CodeForces 246E Blood Cousins Return （树上启发式合并）

#include<bits/stdc++.h>
using namespace std;
#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long
#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define root l,r,rt
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define fi first                                  
#define se second
#define mk(x,y) make_pair(x,y)
const int mod=1e9+7;
const int maxn=1e5+100;
const int ub=1e6;
const ll INF=1e18;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){
    if(y==0) return x;
    return gcd(y,x%y);
}

int n,m,tot=0,ret[maxn];
vector<int> g[maxn];
vector<pii> q[maxn];///存储询问
string col[maxn];
set<string> st[maxn<<1];
int son[maxn],sz[maxn],dep[maxn],flag=0;
void dfs(int u,int f){
    sz[u]=1,dep[u]=dep[f]+1;
    for(auto v:g[u]) if(v!=f){
        dfs(v,u);
        sz[u]+=sz[v];
        if(sz[v]>sz[son[u]]) son[u]=v;
    }
}
void count(int u,int f,int keep){
    if(keep==1) st[dep[u]].insert(col[u]);
    else st[dep[u]].clear();
    for(auto v:g[u]) if(v!=f&&v!=flag)
        count(v,u,keep);
}
void dfs(int u,int f,int keep){
    for(auto v:g[u]) if(v!=f&&v!=son[u])
        dfs(v,u,0);
    if(son[u]){
        dfs(son[u],u,1);
        flag=son[u];
    }
    count(u,f,1);
    rep(i,0,q[u].size())
        ret[q[u][i].se]=st[dep[u]+q[u][i].fi].size();
    if(!keep){
        flag=0;
        count(u,f,-1);
    }
}
int main(){
    ios::sync_with_stdio(false);/*
    freopen("d://in.txt","r",stdin);
    freopen("d://out.txt","w",stdout);*/
    cin>>n;
    rep(i,1,n+1){
        int y;
        cin>>col[i]>>y;
        g[i].push_back(y);
        g[y].push_back(i);
    }
    cin>>m;
    rep(i,0,m){
        int x,y;
        cin>>x>>y;
        q[x].push_back(mk(y,i));
    }
    dfs(0,0),dfs(0,0,0);
    rep(i,0,m) cout<<ret[i]<<"\n";
    return 0;
}