题目大意:给出一棵家谱树,定义向上走k步到达的节点为该点的k-ancestor.每次询问与v同P-ancestor的节点有多少个。
题解:dsu on the tree
将问题转换成p-ancestor的子树有多少个深度为deep[v]的节点。
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#define N 200003
using namespace std;
int tot,point[N],v[N],nxt[N],next[N],head[N],c[N],u[N],mark[N];
int deep[N],size[N],son[N],fa[N][20],mi[20],ans[N],num[N],n,m;
void add(int x,int y)
{
tot++; nxt[tot]=point[x]; point[x]=tot; v[tot]=y;
tot++; nxt[tot]=point[y]; point[y]=tot; v[tot]=x;
}
void build(int x,int y,int i)
{
tot++; next[tot]=head[x]; head[x]=tot; u[tot]=y; c[tot]=i;
}
void solve(int x,int f)
{
deep[x]=deep[f]+1; size[x]=1;
for (int i=1;i<=17;i++) {
if (deep[i]-mi[i]<0) continue;
fa[x][i]=fa[fa[x][i-1]][i-1];
}
for (int i=point[x];i;i=nxt[i]){
if(v[i]==f) continue;
fa[v[i]][0]=x;
solve(v[i],x);
size[x]+=size[v[i]];
if (size[son[x]]<size[v[i]]) son[x]=v[i];
}
}
int get(int x,int k)
{
for (int i=0;i<=17;i++)
if ((k>>i)&1) x=fa[x][i];
return x;
}
void change(int x,int f,int val)
{
num[deep[x]]+=val;
for (int i=point[x];i;i=nxt[i])
if (v[i]!=f&&!mark[v[i]]) change(v[i],x,val);
}
void dfs(int x,int f,bool k)
{
for (int i=point[x];i;i=nxt[i])
if (v[i]!=f&&v[i]!=son[x]) dfs(v[i],x,0);
if (son[x]) dfs(son[x],x,1),mark[son[x]]=1;
change(x,f,1);
for (int i=head[x];i;i=next[i])
ans[c[i]]=num[u[i]];
if (son[x]) mark[son[x]]=0;
if (!k) change(x,f,-1);
}
int main()
{
freopen("a.in","r",stdin);
scanf("%d",&n);
for (int i=1;i<=n;i++) {
int x; scanf("%d",&x);
add(x,i);
}
solve(0,0);
scanf("%d",&m); tot=0;
for (int i=1;i<=m;i++) {
int x,p; scanf("%d%d",&x,&p);
if (deep[x]-2<p) {
ans[i]=1;
continue;
}
int f=get(x,p);
build(f,deep[x],i);
}
dfs(0,0,0);
for (int i=1;i<=m;i++) printf("%d ",ans[i]-1);
printf("\n");
}