题意:给一个有向图,求从所有点都能够到达的这样的点的个数
思路:先用tarjan求强连通分量,之后把同一分量的点缩成一个点,求出缩点后的点的出度,若出度为0的点的个数大于1,则由DAG性质得到不存在一个点能够从所有点到达,故只需要求出出度为0的那个抽象点中所包含点的个数即可
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<vector>
#include<queue>
#include<map>
#include<stack>
using namespace std;
typedef long long ll;
const int maxn = 50005;
const int inf = 0x3f3f3f3f;
int dfn[maxn], low[maxn], vis[maxn], cnt, cnt2, n, m, u[maxn], num[maxn], out[maxn];
vector<int> g[maxn];
stack<int> s;
void tarjan(int x)
{
dfn[x] = low[x] = ++cnt;
s.push(x);
vis[x] = 1;
for (int i = 0; i < g[x].size(); i++) {
int v = g[x][i];
if (!dfn[v]) {
tarjan(v);
low[x] = min(low[x], low[v]);
}
else if (vis[v])
low[x] = min(low[x], dfn[v]);
}
if (low[x] == dfn[x]) {
cnt2++;
int k = 0;
while (1) {
k++;
int y = s.top(); s.pop();
vis[y] = 0;
u[y] = cnt2;
if (y == x)
break;
}
num[cnt2] = k;
}
}
int main()
{
while (cin >> n >> m) {
memset(out, 0, sizeof(out));
memset(dfn, 0, sizeof(dfn));
memset(vis, 0, sizeof(vis));
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
g[u].push_back(v);
}
cnt = 0, cnt2 = 0;
for (int i = 1; i <= n; i++)
if (!dfn[i])
tarjan(i);
for (int i = 1; i <= n; i++)
for (int j = 0; j < g[i].size(); j++) {
int v = g[i][j];
if (u[i] != u[v])
out[u[i]]++;
}
int ans = 0;
for (int i = 1; i <= cnt2; i++) {
if (!out[i]) {
if (ans) {
cout << 0 << endl;
return 0;
}
ans = num[i];
}
}
cout << ans << endl;
}
return 0;
}