PTA甲级 1146 Topological Order (C++)

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(\le 1,000)$, the number of vertices in the graph, and $M(\le 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(\le 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.

Sample Input:

6 8
1 2
1 3
5 2
5 4
2 3
2 6
3 4
6 4
6
5 2 3 6 4 1
1 5 2 3 6 4
5 1 2 6 3 4
5 1 2 3 6 4
5 2 1 6 3 4
1 2 3 4 5 6

Sample Output:

0 4 5

Solution:

// Talk is cheap, show me the code
// Created by Misdirection 2021-08-30 12:10:45
// All rights reserved.

#include <iostream>
#include <vector>

using namespace std;

int main(){
    int n, m, k;
    scanf("%d %d", &n, &m);
    vector<vector<int>> net(n + 1);
    vector<int> degree(n + 1, 0);

    for(int i = 0; i < m; ++i){
        int id1, id2;
        scanf("%d %d", &id1, &id2);

        net[id1].push_back(id2);
        degree[id2]++;
    }

    scanf("%d", &k);
    vector<int> path(n), ans;
    for(int i = 0; i < k; ++i){
        for(int j = 0; j < n; ++j) scanf("%d", &path[j]);

        vector<int> tmpDegree = degree;
        
        for(int j = 0; j < n; ++j){
            if(tmpDegree[path[j]] != 0){
                ans.push_back(i);
                break;
            }
            else{
                int thisNode = path[j];
                for(int k = 0; k < net[thisNode].size(); ++k) tmpDegree[net[thisNode][k]]--;
            }
        }
    }

    for(int i = 0; i < ans.size(); ++i){
        if(i == ans.size() - 1) printf("%d\n", ans[i]);
        else printf("%d ", ans[i]);
    }

    return 0;
}