一道模板题
代码
#include<bits/stdc++.h>
using namespace std;
const int maxn=1e4+5;
const int maxm=5e4+5;
int n,m,cnt,dfn[maxn],top,size[maxn],col_num,s[maxn],low[maxn],times,head[maxn],instack[maxn];
struct edge
{
int to,nxt;
}e[maxm];
void add(int x,int y)
{
e[++cnt].to=y;
e[cnt].nxt=head[x];
head[x]=cnt;
}
void tarjan(int x)
{
low[x]=dfn[x]=++times;
instack[x]=1;
s[++top]=x;
for(int i=head[x];i;i=e[i].nxt)
{
int to=e[i].to;
if(!dfn[to])
{
tarjan(to);
low[x]=min(low[to],low[x]);
}
else if(instack[to]) low[x]=min(dfn[to],low[x]);
}
int v;
if(dfn[x]==low[x])
{
col_num++;
do
{
size[col_num]++;
v=s[top--];
instack[v]=0;
}while(x!=v);
}
}
int main()
{
freopen("a.in","r",stdin);
freopen("a.out","w",stdout);
scanf("%d%d",&n,&m);
int a,b;
for(int i=1;i<=m;i++)
{
scanf("%d%d",&a,&b);
add(a,b);
}
for(int i=1;i<=n;i++)
if(!dfn[i])
tarjan(i);
int ans=0;
for(int i=1;i<=col_num;i++)
if(size[i]>1) ans++;
printf("%d",ans);
return 0;
}