#include <cstdio>
#include <algorithm>
#include <iostream>
#include <cstring>
#include <stack>
#include <vector>
using namespace std;
const int Max=12000;
vector<int>haha[Max];
int dfn[Max],low[Max],scc[Max];
stack<int>st;
int index=0;
int sccnum=0;
int cnt[Max];
int outd[Max];
int m,n;
void dfs(int x){
st.push(x);
dfn[x]=low[x]=++index;
for(int i=0;i<haha[x].size();i++){
int s=haha[x][i];
if(!dfn[s]){
dfs(s);
low[x]=min(low[x],low[s]);
}else if(!scc[s]){
low[x]=min(low[x],dfn[s]);
}
}
if(low[x]==dfn[x]){
++sccnum;
while(1){
int tmp=st.top();
st.pop();
scc[tmp]=sccnum;
if(tmp==x){
break;
}
}
}
}
void gui(){
index=sccnum=0;
memset(dfn,0,sizeof(dfn));
memset(scc,0,sizeof(scc));
while(!st.empty()){
st.pop();
}
for(int i=1;i<=n;i++){
if(!dfn[i]){
dfs(i);
}
}
}
int main(){
scanf("%d%d",&n,&m);
int x1,x2;
for(int i=1;i<=n;i++){
haha[i].clear();
}
for(int i=1;i<=m;i++){
scanf("%d%d",&x1,&x2);
haha[x1].push_back(x2);
}
gui();
memset(outd,0,sizeof(outd));
memset(cnt,0,sizeof(cnt));
for(int i=1;i<=n;i++){
++cnt[scc[i]];
for(int j=0;j<haha[i].size();j++){
int s=haha[i][j];
if(scc[s]!=scc[i]){
outd[scc[i]]++;
}
}
}
int ans=0,sna=0;
for(int i=1;i<=sccnum;i++){
if(outd[i]==0){
sna++;
ans+=cnt[i];
}
}
if(sna==1){
printf("%d\n",ans);
}else{
printf("0\n");
}
return 0;
}
模板积累——tarjan(gui)算法
最新推荐文章于 2021-10-30 22:21:35 发布