poj 2186 Popular Cows

#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<cmath>
#include<cassert>
#include<cstring>
#include<iomanip>
using namespace std;

#ifdef _WIN32
#define i64 __int64
#define out64 "%I64d\n"
#define in64 "%I64d"
#else
#define i64 long long
#define out64 "%lld\n"
#define in64 "%lld"
#endif

#define FOR(i,a,b)      for( int i = (a) ; i <= (b) ; i ++)
#define FF(i,a)         for( int i = 0 ; i < (a) ; i ++)
#define FFD(i,a)        for( int i = (a)-1 ; i >= 0 ; i --)
#define S64(a)          scanf(in64,&a)
#define SS(a)           scanf("%d",&a)
#define LL(a)           ((a)<<1)
#define RR(a)           (((a)<<1)+1)
#define SZ(a)           ((int)a.size())
#define PP(n,m,a)		puts("---");FF(i,n){FF(j,m)cout << a[i][j] << ' ';puts("");}
#define pb              push_back
#define CL(Q)           while(!Q.empty())Q.pop()
#define MM(name,what)   memset(name,what,sizeof(name))
#define read            freopen("in.txt","r",stdin)
#define write           freopen("out.txt","w",stdout)

const int inf = 0x3f3f3f3f;
const i64 inf64 = 0x3f3f3f3f3f3f3f3fLL;
const double oo = 10e9;
const double eps = 10e-10;
const double pi = acos(-1.0);
const int maxn = 10011;

vector<int>g[maxn];
vector<int>v[maxn];
vector<int>s;
int dfn[maxn];
int low[maxn];
int be[maxn];
bool ins[maxn];
bool hash[maxn];
int df,nb;
int n,m;
int ans,what;

void tarjan(int now)
{
    int to;
    dfn[now] = low[now] = df++;
    s.pb(now);
    ins[now] = true;
    FF(i,g[now].size())
    {
        to = g[now][i];
        if(!dfn[to])
        {
            tarjan(to);
            low[now] = min(low[to],low[now]);
        }
        else if(ins[to])
        {
            low[now] = min(low[to],low[now]);
        }
    }

    if(low[now] == dfn[now])
    {
        while(s.back() != now)
        {
            to = s.back();
            ins[to] = false;
            be[to] = nb;
            s.pop_back();
        }
        to = s.back();
        ins[to] = false;
        s.pop_back();
        be[to] = nb++;
    }
    return ;
}

void start()
{
    MM(dfn,0);
    MM(low,0);
    MM(ins,false);
    MM(hash,false);
    MM(be,0);
    df = nb = 1;
    s.clear();
    for(int i=1;i<=n;i++)
    {
        if(!dfn[i])
        {
            tarjan(i);
        }
    }
    nb--;
    int from,to;
    for(int i=1;i<=n;i++)
    {
        from = be[i];
        FF(j,g[i].size())
        {
            to = be[g[i][j]];
            if(from != to)
            {
                v[from].push_back(to);
            }
        }
    }
    ans = 0;
    for(int i=1;i<=nb;i++)
    {
        if(v[i].empty())
        {
            ans++;
            what = i;
        }
    }
    if(ans >= 2)
    {
        cout<<"0"<<endl;
    }
    else if(ans==1)
    {
        int temp = 0;
        for(int i=1;i<=n;i++)
        {
            if(be[i] == what)
            {
                temp ++;
            }
        }
        cout<<temp<<endl;
    }
    else if(ans==0)
    {
        cout<<n<<endl;
    }
    else
    {
        assert(false);
    }
    return ;
}

int main()
{
    while(cin>>n>>m)
    {
        for(int i=1;i<=n;i++)
        {
            g[i].clear();
            v[i].clear();
        }
        int now,to;
        for(int i=1;i<=m;i++)
        {
            cin>>now>>to;
            g[now].pb(to);
        }
        start();
    }
    return 0;
}