1146 Topological Order（25 分）（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 (≤ 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

用一个数组记录入度即可

#include <iostream>
#include <vector>
using namespace std;
int main(){
	int n, m, k;
	scanf("%d %d", &n, &m);
	vector<int>degree(n + 1, 0), tempdegree, graph[n + 1];
	for(int i = 0; i < m; ++ i){
		int a, b;
		scanf("%d %d", &a, &b);
		graph[a].push_back(b);
		++ degree[b];
	}
	scanf("%d", &k);
	vector<int>ans;
	for(int i = 0; i < k; ++ i){
		int temp;
		tempdegree = degree;
		bool flag = true;
		for(int j = 0; j < n; ++ j){
			scanf("%d", &temp);
			if(tempdegree[temp] > 0)
				flag = false;
			if(flag == false)
				continue;
			for(int u = 0; u < graph[temp].size(); ++ u)
				-- tempdegree[graph[temp][u]];
		}
		if(flag == false)
			ans.push_back(i);
	}
	for(int i = 0; i < ans.size(); ++ i){
		if(i != 0)
			printf(" ");
		printf("%d", ans[i]);
	}
	printf("\n");
}