LGOJ P2341 [HAOI2006]受欢迎的牛 解题报告

题目链接

解题思路

有一个结论：在联通DAG（有向无环图）中，出度为零的点一定是能被其所在的联通子图的所有点到达的点，反之也成立。
所以我们这题先用tarjan找出全部强连通分量，判断每个强连通分量的出度。若图中恰有一个出度为零的强连通分量，则奶牛数量为该强连通分量的大小。否则，奶牛数量为零（若没有出度为零的强连通分量，不言而喻；若有超过一个出度为零的强连通分量，则这些强连通分量之间无法到达）

详细代码

#define rg register
#define inl inline
#define DEBUG printf("[Passing [%s] in line %d.]\n", __func__, __LINE__)
#define putline putchar('\n')
#define putsp putchar(' ')
#define Rep(a, s, t) for(rg int a = s; a <= t; a++)
#define Repdown(a, t, s) for(rg int a = t; a >= s; a--)
typedef long long ll;
#include<cstdio>
#define rs freopen("test.in", "r", stdin), freopen("test.out", "w", stdout)
struct IO
{
	IO(int set = 0) {if(set) rs;} 
	void RS() {rs;} 
	template<typename T> inline IO r(T& x)const
	{
	    x = 0; T f = 1; char ch = getchar();
	    for(; ch < '0' || ch > '9'; ch = getchar()) if(ch == '-') f = -1;
	    for(; ch >= '0' && ch <= '9'; ch = getchar()) x = x * 10 + int(ch - '0');
	    x *= f; return *this;
	}
	template<typename T> inline IO w(T x)const
	{
	    if(x < 0) {putchar('-'); x = -x;}
	    if(x >= 10) w(x / 10);
	    putchar(x % 10 + '0'); return *this;
	}
	template<typename T> inline IO wl(const T& x)const {w(x), putline; return *this;}
	template<typename T> inline IO ws(const T& x)const {w(x), putsp; return *this;}
	inline IO l() {putline; return *this;}
	inline IO s() {putline; return *this;}
}io;
template<typename T> inline T Max(const T& x, const T& y) {return y < x ? x : y;}
template<typename T> inline T Min(const T& x, const T& y) {return y < x ? y : x;}
template<typename T> inline void Swap(T& x, T& y) {T tmp = x; x = y; y = tmp;}

const int MAXN = 10005, MAXM = 50005;
int N, M;
struct Edge
{
	int v, nxt;
}e[MAXM];
int head[MAXN], cnt;
void addedge(int u, int v)
{
	e[++cnt].v = v;
	e[cnt].nxt = head[u];
	head[u] = cnt;
}
int dfn[MAXN], low[MAXN], tim;
bool ins[MAXN];
int stk[MAXN], tops;
int family[MAXN], fcnt;
int count[MAXN];
void Tarjan(int u)
{
	dfn[u] = low[u] = ++tim;
	stk[++tops] = u; ins[u] = 1;
	for(rg int i = head[u]; i; i = e[i].nxt)
	{
		int v = e[i].v;
		if(!dfn[v])
		{
			Tarjan(v);
			low[u] = Min(low[u], low[v]);
		}
		else if(ins[v]) low[u] = Min(low[u], dfn[v]);
	}
	if(dfn[u] == low[u])
	{
		fcnt++;	
		while(1)
		{
			int now = stk[tops--];
			family[now] = fcnt;
			count[fcnt]++;
			ins[now] = 0;
			if(u == now) break;
		}
	}
}
int outd[MAXN];
int main()
{
    //io.RS();
	io.r(N).r(M);
	for(rg int i = 1; i <= M; i++)
	{
		int A, B; io.r(A).r(B);
		addedge(A, B);
	}
	for(rg int i = 1; i <= N; i++)
		if(!dfn[i]) Tarjan(i);
	for(rg int u = 1; u <= N; u++)
		for(rg int i = head[u]; i; i = e[i].nxt)
		{
			int v = e[i].v;
			if(family[u] != family[v]) outd[family[u]]++;
		}
	int ansi = 0;
	for(rg int i = 1; i <= fcnt; i++)
	{
		if(outd[i] == 0)
		{
			if(ansi) {io.wl(0); return 0;}
			ansi = i;
		} 
		
	}
	io.wl(count[ansi]);
    return 0;
}