poj2553The Bottom of a Graph

The Bottom of a Graph

Time Limit: 3000MS		Memory Limit: 65536K
Total Submissions: 11590		Accepted: 4764

Description

We will use the following (standard) definitions from graph theory. Let  V be a nonempty and finite set, its elements being called vertices (or nodes). Let  E be a subset of the Cartesian product  V×V, its elements being called edges. Then  G=(V,E) is called a directed graph. 
Let  n be a positive integer, and let  p=(e₁,...,e_n) be a sequence of length  n of edges  e_i∈E such that  e_i=(v_i,v_i+1) for a sequence of vertices  (v₁,...,v_n+1). Then  p is called a path from vertex  v₁ to vertex  v_n+1 in  G and we say that  v_n+1 is reachable from  v₁, writing  (v₁→v_n+1). 
Here are some new definitions. A node  v in a graph  G=(V,E) is called a sink, if for every node  w in  G that is reachable from  v,  v is also reachable from  w. The bottom of a graph is the subset of all nodes that are sinks, i.e.,  bottom(G)={v∈V|∀w∈V:(v→w)⇒(w→v)}. You have to calculate the bottom of certain graphs.

Input

The input contains several test cases, each of which corresponds to a directed graph  G. Each test case starts with an integer number  v, denoting the number of vertices of  G=(V,E), where the vertices will be identified by the integer numbers in the set  V={1,...,v}. You may assume that  1<=v<=5000. That is followed by a non-negative integer  e and, thereafter,  e pairs of vertex identifiers  v₁,w₁,...,v_e,w_e with the meaning that  (v_i,w_i)∈E. There are no edges other than specified by these pairs. The last test case is followed by a zero.

Output

For each test case output the bottom of the specified graph on a single line. To this end, print the numbers of all nodes that are sinks in sorted order separated by a single space character. If the bottom is empty, print an empty line.

Sample Input

3 3
1 3 2 3 3 1
2 1
1 2
0

Sample Output

1 3
2

题意：在n个点m条边的有向图里面，问有多少个点是汇点。

思路：在一个连通分量中，若这个连通分量的出度为0，这里的所有点都是汇点。先tarjan进行缩点，然后找出出度为0的

连通分量，里面的节点按升序排列。

代码：

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
using namespace std;
const int N=55555;
int dfn[N],low[N],belong[N];
bool instack[N];
int flag[N];
int used[N];
int in[N],out[N];
int cnt,index;
int m,n;
vector<int>g[N];
stack<int>s;
void init()
{
    memset(dfn,0,sizeof(dfn));
    memset(low,0,sizeof(low));
    memset(instack,false,sizeof(instack));
    memset(in,0,sizeof(in));
    memset(out,0,sizeof(out));
    index=cnt=0;
    for(int i=0;i<=n;i++)
    {
        g[i].clear();
    }
    while(!s.empty())
    {
        s.pop();
    }
}
void tarjan(int u)
{
    dfn[u]=low[u]=++index;
    s.push(u);
    instack[u]=true;
    int v;
    for(int i=0;i<g[u].size();i++)
    {
        v=g[u][i];
        if(!dfn[v])
        {
            tarjan(v);
            low[u]=min(low[u],low[v]);
        }
        else if(instack[v])
        {
            low[u]=min(dfn[v],low[u]);
        }
    }
    if(dfn[u]==low[u])
    {
        cnt++;
        do{
            v=s.top();
            s.pop();
            belong[v]=cnt;
            instack[v]=false;
        }while(u!=v);
    }
}
int main()
{
    while(~scanf("%d",&n)&&n)
    {
        scanf("%d",&m);
        init();
        int i,j;
        int a,b;
        for(i=0;i<m;i++)
        {
            scanf("%d%d",&a,&b);
            g[a].push_back(b);
        }
        for(i=1;i<=n;i++)
        {
            if(!dfn[i])
                tarjan(i);
        }
        for(i=1;i<=n;i++)
        {
            for(j=0;j<g[i].size();j++)
            {
                int v=g[i][j];
                if(belong[v]!=belong[i])
                {
                    out[belong[i]]++;
                    in[belong[v]]++;
                }
            }
        }
        int z[N];
        int k=0;
        for(i=1;i<=cnt;i++)
        {
            if(out[i]==0)
            {
                for(j=1;j<=n;j++)
                {
                    if(belong[j]==i)
                    {
                        z[k++]=j;
                    }
                }
            }
        }
        sort(z,z+k);
        for(i=0;i<k;i++)
        {
            if(i==k-1)
            {
                printf("%d\n",z[i]);
            }
            else printf("%d ",z[i]);
        }
    }
    return 0;

}