本文共 1645 字，大约阅读时间需要 5 分钟。

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 81 21 35 25 42 32 63 46 451 5 2 3 6 45 1 2 6 3 45 1 2 3 6 45 2 1 6 3 41 2 3 4 5 6

Sample Output:

3 4

代码如下：

#include 
   
    #include 
    
     #include 
     
      #include 
      
       #include 
       
        using namespace std;const int maxn=1005;int n,m,q;int in[maxn],out[maxn];int tin[maxn],re[maxn];vector
        
          ve[maxn],no;void init(){ memset (in,0,sizeof(in));}void tinit(){ for (int i=1;i<=n;i++) { tin[i]=in[i]; }}int main(){ init(); scanf("%d%d",&n,&m); while (m--) { int x,y; scanf("%d%d",&x,&y); ve[x].push_back(y); in[y]++; } scanf("%d",&q); for (int k=0;k
        
       
      
     
    
   

转载地址：http://wxaen.baihongyu.com/