P2597 [ZJOI2012]灾难

题目

题目

思路

支配树板子，注意需要一个超级根，支配树部分见here
code:

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<cmath>
using namespace std;
//When I wrote this code,God and I unterstood what was I doing 
inline int read()
{
    int ret,c,f=1;
    while (((c=getchar())> '9'||c< '0')&&c!='-');
    if (c=='-') f=-1,ret=0;
    else ret=c-'0';
    while ((c=getchar())>='0'&&c<='9') ret=ret*10+c-'0';
    return ret*f;
}
struct fP{
	int to[600010],nxt[600010];
	int head[300005],tot;
	void reset()
	{
		memset(head,0,sizeof(head));
		tot=0;
		return;
	}
	void add(int x,int y)
	{
		to[++tot]=y;
		nxt[tot]=head[x];
		head[x]=tot;
		return;
	}
} wj,jw,kyx;
int n,m,id[300005],dfn[300005],dep[300005],fa[300005],f[300005],semi[300005],idom[300005],st[20][300005],lyw[300005],bq[300005],ans[300005],x,y,tot;
void Tarjan(int x)
{
	dfn[x]=++tot;
	lyw[tot]=x;
	for (int i=wj.head[x];i;i=wj.nxt[i])
	{
		if (!dfn[wj.to[i]])
		{
			fa[wj.to[i]]=x;
			Tarjan(wj.to[i]);
		}
	}
	return;
}
int find(int x)
{
	if (x==f[x]) return x;
	int y=find(f[x]);
	if (dfn[semi[bq[f[x]]]]<dfn[semi[bq[x]]]) bq[x]=bq[f[x]];
	return f[x]=y;
}
void dfs(int x,int fat)
{
	ans[x]=1;
	for (int i=kyx.head[x];i;i=kyx.nxt[i])
	{
		if (ans[kyx.to[i]]) continue;
		dfs(kyx.to[i],x);
		ans[x]+=ans[kyx.to[i]];
	}
	return;
}
int rd[300005];
int main()
{
	n=read();
	n++;
	for (int i=2;i<=n;i++)
	{
		y=read();
		while (y!=0)
		{
			y++;
			jw.add(i,y),wj.add(y,i);
			rd[i]++;
			y=read();
		}
		if (rd[i]==0) wj.add(1,i),jw.add(i,1);
	}
	Tarjan(1);
	for (int i=1;i<=n;i++) bq[i]=f[i]=semi[i]=i;
	for (int i=tot;i>=2;i--)
	{
		for (int j=jw.head[lyw[i]];j;j=jw.nxt[j])
		{
			if (dfn[jw.to[j]]==0) continue;
			find(jw.to[j]);
			if (dfn[semi[bq[jw.to[j]]]]<dfn[semi[lyw[i]]]) semi[lyw[i]]=semi[bq[jw.to[j]]];
		}
		f[lyw[i]]=fa[lyw[i]];
		kyx.add(semi[lyw[i]],lyw[i]);
		for (int j=kyx.head[fa[lyw[i]]];j;j=kyx.nxt[j])
		{
			find(kyx.to[j]);
			if (semi[bq[kyx.to[j]]]==fa[lyw[i]]) idom[kyx.to[j]]=fa[lyw[i]];
			else idom[kyx.to[j]]=bq[kyx.to[j]];
		}
		kyx.head[fa[lyw[i]]]=0;
	}
	for (int i=2;i<=tot;i++)
	{
		if (idom[lyw[i]]!=semi[lyw[i]]) idom[lyw[i]]=idom[idom[lyw[i]]];
	}
	kyx.reset();
	for (int i=2;i<=tot;i++)
	{
		kyx.add(idom[i],i);
	}
	for (int i=tot;i>=2;i--)
	{
		ans[lyw[i]]++;
		ans[idom[lyw[i]]]+=ans[lyw[i]];
	}
	for (int i=2;i<=tot;i++)
	{
		cout<<ans[i]-1<<endl;
	}
	return 0;
}
//Now,only God know