1146 Topological Order （PAT甲级）

#include <cstdio>
#include <vector>

int N, M, K, u, v, pivot;
std::vector<std::vector<int>> adj;
std::vector<int> in, curr, perm, notTO;
bool flag;

int main(){
    scanf("%d %d", &N, &M);
    adj.resize(N + 1);
    in.resize(N + 1, 0);
    perm.resize(N);
    for(int i = 0; i < M; ++i){
        scanf("%d %d", &u, &v);
        adj[u].push_back(v);
        ++in[v];
    }
    scanf("%d", &K);
    for(int i = 0; i < K; ++i){
        for(int j = 0; j < N; ++j){
            scanf("%d", &perm[j]);
        }
        curr = in;
        flag = true;
        for(int j = 0; j < N; ++j){
            pivot = perm[j];
            if(curr[pivot] != 0){
                flag = false;
                break;
            }
            for(int k = 0; k < adj[pivot].size(); ++k){
                --curr[adj[pivot][k]];
            }
        }
        if(!flag){
            notTO.push_back(i);
        }
    }
    for(int i = 0; i < notTO.size(); ++i){
        printf("%d", notTO[i]);
        if(i != notTO.size() - 1){
            printf(" ");
        }
    }
    return 0;
}

题目如下：

This is a problem given in the Graduate Entrance Exam in 2018: Which of the following is NOT a topological order obtained from the given directed graph? Now you are supposed to write a program to test each of the options.

Input Specification:

Each input file contains one test case. For each case, the first line gives two positive integers N (≤1,000), the number of vertices in the graph, and M (≤ 10,000), the number of directed edges. Then M lines follow, each gives the start and the end vertices of an edge. The vertices are numbered from 1 to N. After the graph, there is another positive integer K (≤ 100). Then K lines of query follow, each gives a permutation of all the vertices. All the numbers in a line are separated by a space.

Output Specification:

Print in a line all the indices of queries which correspond to "NOT a topological order". The indices start from zero. All the numbers are separated by a space, and there must no extra space at the beginning or the end of the line. It is graranteed that there is at least one answer.