POJ 2186 Popular Cows（强连通分量）

题目链接：http://poj.org/problem?id=2186
题目大意：有n只牛，牛A认为牛B很牛，牛B认为牛C很牛。给你M个关系（谁认为谁牛），求大家都认为它很牛的牛有几只。PS:如果牛A认为牛B很牛，牛B认为牛C很牛。那么我们就认为牛A认为牛C很牛。

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<stack>
#include<algorithm>
using namespace std;
const int N = 10010;
struct Edge{
    int v, nxt;
}edge[N*10];
int head[N], idx;
int n, m;
int dfn[N], low[N], dep;
int id[N], conn, num[N];
bool vis[N], instack[N];
int D[N];
stack<int> st;
void AddEdge(int u,int v)
{
    edge[idx].v = v; edge[idx].nxt = head[u];
    head[u] = idx++;
}
void input()
{
    memset(head,-1,sizeof(head));
    idx = 0;
    for(int i = 0; i < m; i++)
    {
        int u, v;
        scanf("%d%d", &u,&v);
        AddEdge(u,v);
    }
}
void tarjan(int u,int pre){
    st.push(u); instack[u] = true;
    vis[u] = true;
    dfn[u] = low[u] = ++dep;
    for(int i = head[u]; ~i; i = edge[i].nxt )
    {
        int v = edge[i].v;

        if( !vis[v] ){
            tarjan(v,u);
            low[u] = min( low[u], low[v] );
        }
        else if( instack[v] )
            low[u] = min( low[u], dfn[v] );
    }
    if( dfn[u] == low[u] )
    {
        int t;
        do{
            id[ t=st.top() ] = conn; st.pop();
            instack[t] = false;
            num[ conn ]++;   // 该连通分量节点数量
        }while( t != u );
        conn++;
    }
}
int GetConnect(){
    conn = 0; dep = 0;
    memset(vis,0,sizeof(vis));
    memset(instack,0,sizeof(instack));
    for(int i = 1; i <= n; i++)
        if( !vis[i] ) tarjan(i,0);
    return conn;
}
void solve()
{
    GetConnect();
    for(int u = 1; u <= n; u++)
    {
        for(int i = head[u]; ~i; i = edge[i].nxt )
        {
            int v = edge[i].v;
            if( id[u] != id[v] ) D[ id[u] ]++;
        }
    }
    int ts = 0, rs = 0;
    for(int i = 0; i < conn; i++)
    {
        if( D[i] == 0 ) ts++, rs = i;
    }
    if( ts == 1 ) printf("%d\n", num[rs] );
    else puts("0");

}
int main()
{
     while( scanf("%d%d", &n,&m) != EOF )
    {
        input();
        solve();
    }
    return 0;
}