bzoj1051(缩点)

tarjan缩点后,若有出度为0的,输出其强联通块的大小,否则无解

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fod(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
const int N=1e5+10;
int len=0,tot=0,top=0,scc=0,cnt=0,last[N],head[N],ans=0,
ins[N],s[N],bl[N],dfn[N],low[N],v[N];
int n,m;
struct Edge{int to,next;Edge(int to=0,int next=0):to(to),next(next){}}e[N<<1],ed[N<<1];
void add_edge(int u,int v){e[++len]=Edge(v,last[u]);last[u]=len;}
void tarjan(int x)
{
    int now=0;
    dfn[x]=low[x]=++cnt;
    s[++top]=x;ins[x]=1;
    for(int i=last[x];i;i=e[i].next) {
        int id=e[i].to;
        if(!dfn[id]) {
            tarjan(id);
            low[x]=min(low[x],low[id]);
        }else if(ins[id]) low[x]=min(low[x],dfn[id]);
    }
    if(dfn[x]==low[x]) {
        scc++;
        while(now!=x){
            now=s[top--];ins[now]=0;
            bl[now]=scc;
            v[scc]++;
        }
    }
}
void rebuild()
{
    tot=0;
    for(int i=1;i<=n;i++) 
        for(int j=last[i];j;j=e[j].next) 
            if(bl[i]!=bl[e[j].to])
                {ed[++tot]=Edge(e[j].to,head[bl[i]]);head[bl[i]]=tot;}          
}
void solve()
{
    for(int i=1;i<=scc;i++) {
        if(!head[i]) {
            if(ans){ans=0;return ;}
            else ans=v[i];
        }
    }
}
int main()
{
    scanf("%d%d",&n,&m);
    for(int u,v,i=1;i<=m;i++) {
        scanf("%d%d",&u,&v);
        add_edge(u,v);
    }
    fo(i,1,n) if(!dfn[i]) tarjan(i);
    rebuild();
    solve();
    printf("%d\n",ans);
    return 0;
}