PAT 1146. Topological Order (25) - 甲级

柳婼

已于 2023-11-09 17:58:40 修改

阅读量2.4k

点赞数 10

文章标签：算法

于 2018-04-03 16:27:25 首次发布

本文链接：https://blog.csdn.net/liuchuo/article/details/79805295

版权

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 Specifica