hdu4694

就是求有向图的支配树啦。。。题面就不简述了传送门

上面是非常详细的论文。。。补点笔记吧

定义一个点的半支配点，是一个点的dfs祖先中，能通过四种dfs树边连到该点，且dfn最小的点

而一个点的支配点，一定在该点到其半支配点路径上的点的支配点或是半支配点

用带权并查集，按dfn逆序处理就是了= =

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<stack>
#include<bitset>
#include<ext/pb_ds/priority_queue.hpp>
using namespace std;

const int maxn = 5E4 + 50;
typedef long long LL;

int n,m,dfs_clock,dfn[maxn],best[maxn],semi[maxn],idom[maxn],id[maxn],fa[maxn];
LL Ans[maxn];

vector <int> v[maxn],G[maxn],h[maxn],pre[maxn],son[maxn];

int Min(int x,int y) {return dfn[semi[x]] < dfn[semi[y]]?x:y;}

int Getfa(int k)
{
	if (k == fa[k]) return k;
	int ret = Getfa(fa[k]);
	best[k] = Min(best[fa[k]],best[k]);
	return fa[k] = ret;
}

void Dfs(int x)
{
	dfn[x] = ++dfs_clock; id[dfs_clock] = x;
	for (int i = 0; i < v[x].size(); i++)
	{
		int to = v[x][i];
		if (dfn[to]) continue;
		Dfs(to); son[x].push_back(to);
	}
}

void tarjan()
{
	for (int i = dfs_clock; i; i--)
	{
		int k = id[i];
		for (int j = 0; j < pre[k].size(); j++)
		{
			int pr = pre[k][j]; if (!dfn[pr]) continue;
			if (dfn[pr] < dfn[k])
			{
				if (dfn[pr] < dfn[semi[k]]) semi[k] = pr;
			}
			else
			{
				Getfa(pr); semi[k] = semi[Min(best[pr],k)];
			}
		}
		if (k != semi[k]) G[semi[k]].push_back(k);
		for (int j = 0; j < G[k].size(); j++)
		{
			int to = G[k][j]; Getfa(to);
			if (semi[best[to]] == k) idom[to] = k;
			else idom[to] = best[to];
		}
		for (int j = 0; j < son[k].size(); j++) fa[son[k][j]] = k;
	}
	for (int i = 2; i <= dfs_clock; i++)
	{
		int k = id[i];
		if (idom[k] != semi[k]) idom[k] = idom[idom[k]];
		if (k != idom[k]) h[idom[k]].push_back(k);
	}
}

void Dfs2(int x)
{
	Ans[x] += 1LL*x;
	for (int i = 0; i < h[x].size(); i++)
	{
		int to = h[x][i];
		Ans[to] += Ans[x]; Dfs2(to);
	}
}

char s[20];
void Print(LL x)
{
	if (!x) {putchar('0'); return;}
	int len = 0;
	for (; x; x /= 10LL) s[++len] = x % 10LL;
	while (len) putchar(s[len--] + '0');
}

int getint()
{
	char ch = getchar(); int ret = 0;
	while (ch < '0' || '9' < ch) 
	{
		if (ch == EOF) return -1;
		ch = getchar();
	}
	while ('0' <= ch && ch <= '9')
		ret = ret*10 + ch - '0',ch = getchar();
	return ret;
}

void Clear()
{
	for (int i = 0; i <= n; i++)
	{
		v[i].clear(); G[i].clear();
		h[i].clear(); son[i].clear();
		dfs_clock = dfn[i] = Ans[i] = 0; pre[i].clear();
		idom[i] = semi[i] = best[i] = fa[i] = i;
	}
}

int main()
{
	#ifdef DMC
		freopen("DMC.txt","r",stdin);
	#endif
	
	for (;;)
	{
		n = getint(); if (n == -1) break; 
		m = getint(); Clear();
		while (m--)
		{
			int x = getint(),y = getint();
			v[x].push_back(y);
			pre[y].push_back(x);
		}
		Dfs(n); tarjan(); Dfs2(n);
		for (int i = 1; i < n; i++) Print(Ans[i]),putchar(' ');
		Print(Ans[n]); puts("");
	}
	return 0;
}