天梯赛赛前训练---pat甲级1146Topological Order

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.

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

#include<bits/stdc++.h>
using namespace std;
const int N=1010;
int n,m;
int res[N];
bool st[N][N];
int k;
int a[N];
vector<int>v;
int cnt[N];

bool check(){
    for(int i=1;i<=n;i++){
        if(cnt[a[i]]) return false;
        for(int j=1;j<=n;j++){
            if(st[a[i]][j]) cnt[j]--;
        }
    }
    return true;
}
int main(){
    cin>>n>>m;
    while(m--){
        int a,b;
        cin>>a>>b;
        st[a][b]=true;
        res[b]++;
    }
    cin>>k;
    for(int i=0;i<k;i++){
        for(int j=1;j<=n;j++){
            cnt[j]=res[j];
        }
        for(int j=1;j<=n;j++) cin>>a[j];
        if(!check()) v.push_back(i);
    }
    for(int i=0;i<v.size();i++) cout<<v[i]<<" \n"[i==v.size()-1];
    return 0;
}