HDU 2767 强连通之缩点

#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std;
int instack[20008],low[20008],dfn[20008];
bool stack[20008],DFN[20008];
int n,m,top,indx,bet,num[20008],into[20008],outo[20008];
vector <int> vc[20008];
vector <int> V[20008];
void Init()
{

      bet = top = indx = 0;
      memset(into,0,sizeof(into));
      memset(outo,0,sizeof(outo));
      memset(stack,false,sizeof(stack));
      memset(low,0,sizeof(low));
      memset(DFN,false ,sizeof(DFN));
      memset(dfn,0,sizeof(dfn));
      memset(vc,0,sizeof(vc));
      memset(V,0,sizeof(V));
}
void tarjan(int x)
{
    int y;
    low[x] =  dfn[x] = ++indx;
    instack[++top] = x;
    DFN[x] = stack[x] = true;
    for(int i=0;i<vc[x].size();i++)
    {

        y = vc[x][i];
        if(!DFN[y])
        {
            tarjan(y);
            low[x] = min(low[x],low[y]);
        }
        else
        if(stack[y])
        {
            low[x] = min(low[x],dfn[y]);
        }
    }
    if(dfn[x]==low[x])
    {
        ++bet;
        do
        {
            y = instack[top--];
            num[y] = bet;      //缩点
            stack[y] = false;
        } while(x!=y);
    }
}
int main()
{
  // freopen("Input.txt","r",stdin);
    int N;
    scanf("%d",&N);

   while(N--)
   {
     scanf("%d%d",&n,&m);
      int a,b,MAX=0,Max=0;
      Init();
      for(int i=0;i<m;i++)
      {
          scanf("%d%d",&a,&b);
          vc[a].push_back(b);
      }
     for(int i=1;i<=n;i++)
     if(!DFN[i]) tarjan(i);
     for(int i=1;i<=n;i++)
     {
         for(int j=0;j<vc[i].size();j++)
         {
             if(num[i]!=num[vc[i][j]])
             {
                 V[num[i]].push_back(num[vc[i][j]]);   //重新建图
             }
         }
     }
     for(int i=1;i<=bet;i++)
     {
        for(int j=0;j<V[i].size();j++)
        {
            outo[i]++;
            into[V[i][j]]++;
        }
     }
     for(int i=1;i<=bet;i++)
     {
         if(into[i]==0)MAX++;
         if(outo[i]==0)Max++;
     }
    int MAx = max(MAX,Max);
   if(MAx==1)
   printf("0\n");      //  此处注意，小心
   else
   printf("%d\n",MAx);
   }

}