1146 Topological Order （25 分）--PAT甲级

1146 Topological Order （25 分）

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
5
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:

3 4

题目大意：判断序列是否为拓扑序列。参考算法笔记，每输入一个数，判断入度是否为0，若为0则删去该顶点对应的边，同时将这些边到达的顶点的入度减1，继续判断下一个；若不为0，则不为拓扑序列。

#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<vector>
using namespace std;
const int maxn = 100100;
vector<vector<int> > node;
vector<int> indegree;
int main()
{
    int n,m;
    scanf("%d %d",&n,&m);
    node.resize(n+1);
    indegree.resize(n+1);
    for(int i=0;i<m;i++){
        int a,b;
        scanf("%d %d",&a,&b);
        node[a].push_back(b);
        indegree[b]++;
    }
    int k;
    scanf("%d",&k);
    int cnt=0;
    for(int i=0;i<k;i++){
        bool flag=true;
        vector<int> temp=indegree;
        for(int j=0;j<n;j++){
            int a;
            scanf("%d",&a);
            if(temp[a]==0 && flag){
                for(int l=0;l<node[a].size();l++){
                    temp[node[a][l]]--;
                }
            }
            else flag=false;
        }
        if(!flag) {
            if(cnt==0) printf("%d",i);
            else printf(" %d",i);
            cnt++;
        }
    }
}