POJ 1236 Tarjan 缩点 统计出入度为0的强联通块

#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
const int maxv=20010;
const int maxe=50010;
int Index,top,scc,cnt;
bool Instack[maxv];
int head[maxv],Low[maxv],DFN[maxv],Belong[maxv],Stack[maxv],num[maxv],out[maxv],in[maxv],mmap[maxv][maxv];
struct Edge {
    int to,next;
} edge[maxe];
void addedge(int from,int to) {
    edge[cnt].to=to;
    edge[cnt].next=head[from];
    head[from]=cnt++;
}
void Tarjan(int u) {
    int v;
    Low[u] = DFN[u] = ++Index;  //刚搜到一个节点时Low = DFN;
    Stack[top++] = u;  //将该节点入栈
    Instack[u] = 1;  //将入栈标记设置为1
    for (int i = head[u]; i != -1; i = edge[i].next) {
        v = edge[i].to;
        if(!DFN[v]) {
            Tarjan( v);
            if( Low[u] > Low[v] )
                Low[u] = Low[v];
        } else if(Instack[v] && Low[u] > DFN[v])
            Low[u] = DFN[v];
    }
    if(Low[u] == DFN[u]) {
        scc++;
        do {
            v = Stack[--top];
            Instack[v] = false;
            Belong[v] = scc;
            num[scc ]++;
        } while( v != u);
    }
}
void solve(int n) {
    for(int i=1; i<=n; i++)
        if(!DFN[i])
            Tarjan(i);
}
void init() {
    memset(head,-1,sizeof head);
}
int main(void) {
#ifndef ONLINE_JUDGE
    freopen("E:\\input.txt","r",stdin);
#endif // ONLINE_JUDGE
    int n,num;
    cin>>n;
    init();
    for(int i=1; i<=n; i++)
        while(cin>>num&&num)
            mmap[i][num]=1,addedge(i,num);
    solve(n);
    if(scc==1) {
        cout<<1<<endl<<0<<endl;
        return 0;
    }
    for(int i=1; i<=n; i++)
        for(int j=1; j<=n; j++)
            if(mmap[i][j]==1&&Belong[i]!=Belong[j])//把联通块缩为点
                out[Belong[i]]++,in[Belong[j]]++;
    int cnt_in=0,cnt_out=0;
    for(int i=1; i<=scc; i++) {
        if(in[i]==0)
            cnt_in++;//统计入度为0的联通块
        if(out[i]==0)
            cnt_out++;//统计出度为0的联通快
    }
    cout<<cnt_in<<endl<<max(cnt_in,cnt_out)<<endl;
    return 0;
}