缩点以后,整张图变为DAG(有向无环图),此时运用拓扑排序/求出度入度就可以完成许多事
题目:https://www.luogu.org/problem/P2341
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#define ll long long
using namespace std;
const int Maxn=100100;
struct edge
{
int y,next;
}e[Maxn];
int in[Maxn];
int num[Maxn],sum=0;
vector <int> p[Maxn];
int head[Maxn],len=0;
int dnf[Maxn],low[Maxn],Index,cnt,n,m,tot;
int vis[Maxn],s[Maxn];//栈
void build(int x,int y)
{
e[++len].next=head[x];
e[len].y=y;
head[x]=len;
}
void tarjan(int x)
{
dnf[x]=low[x]=++tot;
s[++Index]=x;
vis[x]=1;
for(int i=head[x];i!=-1;i=e[i].next)
{
if(!dnf[e[i].y])
{
tarjan(e[i].y);
low[x]=min(low[x],low[e[i].y]);
}
else if(vis[e[i].y])
{
low[x]=min(low[x],low[e[i].y]);
}
}
if(low[x]==dnf[x])
{
sum++;
do{
//printf("%d ",s[index]);
p[sum].push_back(s[Index]);//将此强连通分量内所有的点存入p[sum]中
num[s[Index]]=sum;
vis[s[Index]]=0;
Index--;
}while(x!=s[Index+1]);
//printf("\n");
}
}
int main()
{
memset(head,-1,sizeof(head));
scanf("%d%d",&n,&m);
for(int i=1;i<=m;i++)
{
int x,y;
scanf("%d%d",&x,&y);
build(x,y);
}
for(int i=1;i<=n;i++)
if(!dnf[i]) tarjan(i);
for(int i=1;i<=n;i++)
for(int j=head[i];j!=-1;j=e[j].next)//遍历所有的边,求缩点后所有点的出度
//cout<<i<<" "<<num[i]<<" "<<e[j].y<<" "<<num[e[j ].y]<<endl;
if(num[i]!=num[e[j].y]) in[num[i]]++;
/*for(int i=1;i<=sum;i++)//测试用代码
// cout<<in[i]<<endl;
if(!in[i])
for(int j=0;j<p[i].size();j++) cout<<p[i][j]<<" ";*/
int flag=0,id=0;
for(int i=1;i<=sum;i++)
if(in[i]==0) flag++,id=i;
if(flag!=1) {cout<<0<<endl;return 0;}
cout<<p[id].size()<<endl;
}