强连通，缩点，然后统计出入度

http://acm.upc.edu.cn/problem.php?id=2218

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<stack>
#include<vector>
using namespace std;
const int maxn=2010;
int n,m;
vector<int> grid[maxn];
int lowlink[maxn],pre[maxn],sccno[maxn],dfs_clock,scc_cnt;
stack<int> s;
void dfs(int u)
{
    pre[u]=lowlink[u]=++dfs_clock;
    s.push(u);
    for(int i=0;i<grid[u].size();i++)
    {
        int v=grid[u][i];
        if(!pre[v])
        {
            dfs(v);
            lowlink[u]=min(lowlink[u],lowlink[v]);
        }
        else if(!sccno[v])
        {
            lowlink[u]=min(lowlink[u],pre[v]);
        }
    }
    if(lowlink[u]==pre[u])
    {
        scc_cnt++;
        while(true)
        {
            int x=s.top();s.pop();
            sccno[x]=scc_cnt;
            if(x==u)break;
        }
    }
}
bool find_scc()
{
    dfs_clock=scc_cnt=0;
    memset(sccno,0,sizeof(sccno));
    memset(pre,0,sizeof(pre));
    while(!s.empty())s.pop();
    dfs(1);
    for(int i=1;i<=n;i++)
        if(!pre[i])dfs(i);
    if(scc_cnt>1)return false;
    return true;
}
int in[maxn],out[maxn];
int main()
{
    freopen("in.txt","r",stdin);
    int t,x,y;
    scanf("%d",&t);
    for(int cas=1;cas<=t;cas++)
    {
        scanf("%d%d",&n,&m);
        for(int i=0;i<=maxn;i++)grid[i].clear();
        while(m--)
        {
            scanf("%d%d",&x,&y);
            grid[x].push_back(y);
            //grid[y].push_back(x);
        }
        find_scc();
        fill(in,in+n+1,0);
        fill(out,out+n+1,0);
        for(int i=1;i<=n;i++)
            for(int j=0;j<grid[i].size();j++)
            if(sccno[i]!=sccno[grid[i][j]])in[sccno[grid[i][j]]]+=1,out[sccno[i]]+=1;
        int a=0,b=0;
        for(int i=1;i<=scc_cnt;i++)
        {
            if(!in[i])a++;
            if(!out[i])b++;
        }
        if(a>1||b>1)printf("Case %d: The Burning Shadow consume us all\n",cas);
        else printf("Case %d: Kalimdor is just ahead\n",cas);
    }
    return 0;
}