【笨方法学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

二、题目大意

拓扑排序，后面的点不能指向前面的点。

三、考点

逻辑

四、注意

1、懂得题目的意思就好了。

五、代码

#include<iostream>
#include<vector>
#define N 1001
using namespace std;
int v[N][N] = {0};
int main() {
	//read
	int n, m;
	cin >> n >> m;
	while (m--) {
		int a,b;
		cin >> a >> b;
		v[a][b] = 1;
	}

	//find
	int k;
	cin >> k;
	vector<int> vec_not;
	for(int i=0;i<k;++i) {
		//read
		vector<int> vec(n);
		for (int j = 0; j < n; ++j) {
			cin >> vec[j];
		}

		//judge
		bool flag = true;
		for (int j = 0; j < n; ++j) {
			for (int l = j + 1; l < n; ++l) {
				if (v[vec[l]][vec[j]] == 1) {
					flag = false;
					break;
				}
			}
		}

		//push
		if (flag == false) {
			vec_not.push_back(i);
		}
	}

	//output
	for (int i = 0; i < vec_not.size(); ++i) {
		if (i != 0)
			cout << " ";
		cout << vec_not[i];
	}

	system("pause");
	return 0;
}