mirror of
https://github.com/xlucn/PAT.git
synced 2026-10-31 06:37:38 +08:00
37 lines
1.5 KiB
HTML
37 lines
1.5 KiB
HTML
<!DOCTYPE html>
|
|
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8" />
|
|
<h1>1146. Topological Order (25)</h1>
|
|
<div id="problemContent">
|
|
<p>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.
|
|
</p>
|
|
<center><img src="http://nos.patest.cn/qp_p5m3xdiy3a6.jpg"/></center>
|
|
<p><b>
|
|
Input Specification:
|
|
</b></p>
|
|
<p>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.
|
|
</p>
|
|
<p><b>
|
|
Output Specification:
|
|
</b></p>
|
|
<p>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.</p>
|
|
<b>Sample Input:</b><pre>
|
|
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
|
|
</pre>
|
|
<b>Sample Output:</b><pre>
|
|
3 4
|
|
</pre>
|
|
</div> |