POJ 2553 The Bottom of a Graph 强连通分量

某个点如果存在到另一个点而且另一个点也存在到u的路，那么这个点就是符合题意的。样例2即允许无出边。
缩点后无出边的都是符合题意的。

我一脸懵逼、、、、、
快速读入79ms。。scanf 47ms。。
PE了一次233。
题目的这个if真的好魔性。

#include <cstdio>
#include <cstring>
#define min(i,j) ((i)<(j)?(i):(j))
#define ms(a, b) memset(a, b, sizeof(a))
const int N = 5001, M = N * N;
int h[N], p[M], v[M], belong[N], out[N], dfn[N], low[N];
int scc, top, ts, cnt, stack[N], instack[N];
void add(int a, int b) { p[++cnt] = h[a]; v[cnt] = b; h[a] = cnt; }
void tarjan(int u) {
    int i;
    dfn[u] = low[u] = ++ts;
    stack[++top] = u; instack[u] = 1;
    for (i = h[u]; i; i = p[i])
        if (!dfn[v[i]]) {
            tarjan(v[i]);
            low[u] = min(low[u], low[v[i]]);
        } else if (instack[v[i]])
            low[u] = min(low[u], dfn[v[i]]);
    if (dfn[u] == low[u]) {
        ++scc;
        do {
            i = stack[top--];
            instack[i] = 0;
            belong[i] = scc;
        } while (i != u);
    }
}

int main() {
    int i, j, n, m, a, b;
    while (scanf("%d%d", &n, &m) == 2 && n) {
        ms(dfn, 0); ms(out, 0); ms(h, 0);
        ts = cnt = top = scc = 0;
        for (i = 0; i < m; ++i) {
            scanf("%d%d", &a, &b), add(a, b);
        }
        for (i = 1; i <= n; ++i)
            if (!dfn[i]) tarjan(i);
        for (i = 1; i <= n; ++i)
            for (j = h[i]; j; j = p[j])
                if (belong[i] != belong[v[j]])
                    ++out[belong[i]];
        a = 1;
        for (i = 1; i <= n; ++i) 
            if (!out[belong[i]]) {
                if (!a) putchar(' ');
                a = 0; printf("%d", i);
            }
        putchar('\n');
    }

    return 0;
}

The Bottom of a Graph

Time Limit: 3000MS Memory Limit: 65536K
Total Submissions: 9796 Accepted: 4076

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=(e1,…,en) be a sequence of length n of edges ei∈E such that ei=(vi,vi+1) for a sequence of vertices (v1,…,vn+1). Then p is called a path from vertex v1 to vertex vn+1 in G and we say that vn+1 is reachable from v1, writing (v1→vn+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 v1,w1,…,ve,we with the meaning that (vi,wi)∈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