PAT (Advanced Level) -1146 Topological Order

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

用vector存有向图 入度数组存单一节点的被×次数 边界N 节点数据输入量M

每次用vector复制一个 入度数组 当一个结点出掉 其指向的节点的入度值-1

关于拓扑排序：

https://blog.csdn.net/Turne/article/details/50165713

https://blog.csdn.net/qq_35644234/article/details/60578189

代码：

#include <iostream>
#include <vector>

using namespace std;
vector<int> ef[1002];
int main()
{
	int n, m, k, i, a, b, val, in[1002] = { 0 }, cnt = 0;
	cin >> n >> m;
	for (i = 0; i < m; ++i)
	{
		scanf("%d %d", &a, &b);
		ef[a].push_back(b);
		in[b]++;

	}
	cin >> k;
	
	for(int j=0;j<k;++j)
	{
		int flag = 1;
		vector<int>tin(in, in + n + 1);		
		for (i = 0; i < n; ++i)
		{
			scanf("%d", &val);
			
			if (tin[val] != 0)
			{
				flag = 0;				
			}
			for (auto &x : ef[val])tin[x]--;			
								
		}
		if (!flag)
		{
			if (cnt == 0)
			{
				printf("%d", j);
				cnt++;
			}
			else printf(" %d", j);
		}
	}

}