Hawk-and-Chicken

 http://acm.hdu.edu.cn/showproblem.php?pid=3639

思路：强连通缩点后反向连边，求u开始最多的节点数

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <map>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%lld",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

/*
//---------------------------------------------------------
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
using namespace __gnu_pbds;
*/

//gp_hash_table<string,int>mp2;
//__gnu_pbds::priority_queue<int>q;//因为放置和std重复，故需要带上命名空间
//__gnu_pbds::priority_queue<int,greater<int>,pairing_heap_tag> pq;//最快
//----------------------------------------------------------


/*
//----------------------------------------------------------
const int BufferSize = 1 << 16;
char buffer[BufferSize], *_head, *_tail;
inline char Getchar() {
    if (_head == _tail) {
        int l = fread(buffer, 1, BufferSize, stdin);
        _tail = (_head = buffer) + l;
    }
    return *_head++;
 }
inline int read() {
    int x = 0, f = 1;char c = Getchar();
    for (;!isdigit(c);c = Getchar()) if (c == '-') f = -1;
    for (;isdigit(c);c = Getchar()) x = x * 10 + c - '0';
    return x * f;
 }
//----------------------------------------------------------
*/


const int maxn=1e5+9;
const int maxm=4e5+9;
const int mod=1e9+7;

struct Edge
{
    int to,nex;
}edge[maxn*2],edge2[maxn*2];
int head[maxn];
int tot;
int head2[maxn];
int tot2;
int in[maxn];

int Index,top;
int Low[maxn],DFN[maxn],Stack[maxn],Belong[maxn],num[maxn];
int scc;
bool Instack[maxn];

int n,m;

void addedge(int u,int v)
{
    edge[tot].to=v;
    edge[tot].nex=head[u];
    head[u]=tot++;
}

void addedge2(int u,int v)
{
    edge2[tot2].to=v;
    edge2[tot2].nex=head2[u];
    head2[u]=tot2++;
}

void Tarjan(int u)
{
    int v;
    Low[u]=DFN[u]=++Index;
    Stack[top++]=u;
    Instack[u]=true;
    for(int i=head[u];i!=-1;i=edge[i].nex)
    {
        v=edge[i].to;
        //cout<<u<<" "<<v<<endl;
        if(!DFN[v])
        {
            Tarjan(v);
            if(Low[u]>Low[v]) Low[u]=Low[v];
        }
        else if(Instack[v]&&Low[u]>DFN[v]) Low[u]=Low[v];
    }
    if(Low[u]==DFN[u])
    {
        scc++;
        num[scc]=0;
        do
        {
            v=Stack[--top];
            Instack[v]=false;
            Belong[v]=scc;
            num[scc]++;
        }
        while(v!=u);
    }
}

void init()
{
    tot=0;
    mem(head,-1);
    mem(head2,-1);
    mem(in,0);
    tot2=0;

    mem(num,0);
    mem(DFN,0);
    mem(Low,0);
    mem(Instack,0);
    mem(Belong,0);
    Index=top=scc=0;
}
bool vis[maxn];
int sum[maxn];
int dfs(int u)
{
    vis[u]=1;
    int sum=0;
    for(int i=head2[u];i!=-1;i=edge2[i].nex)
    {
        int v=edge2[i].to;
        if(!vis[v]) sum+=num[v]+dfs(v);
    }
    return sum;
}
vector<int>ans;
int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);

    int t;
    sfi(t);
    int cas=1;
    while(t--)
    {
        init();
        sfi(n);
        sfi(m);
        for(int i=0;i<m;i++)
        {
            int u,v;
            sfi(u);
            sfi(v);
            u++;
            v++;
            addedge(u,v);
        }
        for(int i=1;i<=n;i++)
        {
            if(!DFN[i])
                Tarjan(i);
        }

        for(int i=1;i<=n;i++)
        {
            int u,v;
            for(int j=head[i];j!=-1;j=edge[j].nex)
            {
                u=Belong[i];
                v=Belong[edge[j].to];
                if(u!=v)
                {
                    in[u]++;
                    addedge2(v,u);
                }
            }
        }

        //cout<<scc<<endl;
        mem(sum,0);
        int Max=0;
        for(int i=1;i<=scc;i++)
        {
            if(in[i]==0)
            {
                mem(vis,0);
                sum[i]=num[i]-1+dfs(i);
                Max=max(Max,sum[i]);
            }
        }
        ans.clear();
        for(int i=1;i<=n;i++)
        {
            if(sum[Belong[i]]==Max) ans.pb(i);
        }
        printf("Case %d: %d\n",cas++,Max);
        sort(ans.begin(),ans.end());
        for(int i=0;i<ans.size();i++)
        {
            if(i!=0) printf(" ");
            printf("%d",ans[i]-1);
        }
        puts("");
    }

    return 0;
}