poj2253 The Bottom of a Graph

poj2253
题意：求所有的节点v，满足节点v所有能到达的点，都能反过来到达v。（多组测试数据）

tarjan缩点…然后求入度为0的强连通块块的所有点
注意：这种题..大多最后要特判一下强连通块数等于0的情况

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define N 5010
struct node{
    int x,y,next;
}edge[N*N];
int n,m,tot,num,scc,top,low[N],dfn[N],stack[N],vis[N],h[N],belong[N],flag[N],h1[N];
void tarjan(int x){
    dfn[x]=++tot;low[x]=tot;vis[x]=1;stack[++top]=x;
    for(int i=h[x];i;i=edge[i].next){
        int y=edge[i].y;
        if(!dfn[y]){
            tarjan(y);
            low[x]=min(low[x],low[y]);
        }else if(vis[y]) low[x]=min(low[x],dfn[y]);
    }if(low[x]==dfn[x]){
        belong[x]=++scc;vis[x]=0;
        while(stack[top]!=x){
            belong[stack[top]]=scc;
            vis[stack[top--]]=0;
        }top--;
    }
}
int main(){
    while(scanf("%d",&n)>0 && n!=0){
        scanf("%d",&m);top=num=scc=tot=0;
        memset(h,0,sizeof(h));
        memset(dfn,0,sizeof(dfn));
        memset(low,0,sizeof(low));
        memset(vis,0,sizeof(vis));
        memset(flag,0,sizeof(flag));
        memset(h1,0,sizeof(h1));
        for(int i=1;i<=m;i++){
            int x,y;scanf("%d%d",&x,&y);
            edge[++num].x=x;edge[num].y=y;edge[num].next=h[x];h[x]=num;
        }
        for(int i=1;i<=n;i++) if(!dfn[i]) tarjan(i);
        if(scc!=1){
            for(int i=1;i<=m;i++) if(belong[edge[i].x]!=belong[edge[i].y]) h1[belong[edge[i].x]]++;
            for(int i=1;i<=scc;i++) if(!h1[i]) flag[i]=1;
            for(int i=1;i<=n;i++) if(flag[belong[i]]) printf("%d ",i);
        }else for(int i=1;i<=n;i++) printf("%d ",i);
        printf("\n");
    }
    return 0;
}