【luogu P2002 消息扩散】 题解

题目链接：https://www.luogu.org/problemnew/show/P2002

缩点把原图变为DAG，再在DAG上判断找入度为0的点的个数。

注意一点出度为0的点的个数不等于入度为0的点。

#include <stack>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int maxn = 500000 + 10;
struct edge{
	int next, to, from, len;
}e[maxn<<2];
int head[maxn], cnt;
int n, m, color[maxn], du[maxn], num, tim, ans, tmp;
int dfn[maxn], low[maxn];
bool vis[maxn];
stack<int> s;
void add(int u, int v)
{
	e[++cnt].from = u;
	e[cnt].to = v;
	e[cnt].next = head[u];
	head[u] = cnt;
}
void tarjan(int x)
{
	dfn[x] = low[x] = ++tim;
	s.push(x); vis[x] = 1;
	for(int i = head[x]; i != -1; i = e[i].next)
	{
		int v = e[i].to;
		if(!dfn[v])
		{
			tarjan(v);
			low[x] = min(low[x], low[v]);
		}
		else if(vis[v])
		{
			low[x] = min(low[x], low[v]);
		}
	}
	if(dfn[x] == low[x])
	{
		color[x] = ++num;
		vis[x] = 0;
		while(s.top() != x)
		{
			color[s.top()] = num;
			vis[s.top()] = 0;
			s.pop();
		}
		s.pop();
	}
}
int main()
{
	//freopen("testdata.in","r",stdin);
	//freopen("testdata.out","w",stdout);
	memset(head, -1, sizeof(head));
	scanf("%d%d",&n,&m);
	for(int i = 1; i <= m; i++)
	{
		int u, v;
		scanf("%d%d",&u,&v);
		if(u != v) add(u,v);
	}
	for(int i = 1; i <= n; i++)
		if(!dfn[i]) tarjan(i);
	for(int i = 1; i <= n; i++)
	{
		for(int j = head[i]; j != -1; j = e[j].next)
		{
			int v = e[j].to;
			if(color[v] != color[i])
			{
				du[color[v]]++;
			}
		}
	}
	for(int i = 1; i <= num; i++)
	{
		if(!du[i])
		{
			tmp++;
		}
	}
	printf("%d",tmp);
	return 0;
}