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

题目大意：给一个无向图，然后给你一组路径序列，让你判断输出非拓扑排序的路径序列号。

分析：输入路径的时候顺便统计下入度，然后根据拓扑排序规则进行判断即可。

AC代码：
 

#include<bits/stdc++.h>
using namespace std;
struct node{
	int d1;
	int d2;
}node[1010];
int main(){
	int m,n,a,b;
	vector<int>v[1001];
	scanf("%d %d",&m,&n);
	for(int i=0;i<n;i++){
		scanf("%d %d",&a,&b);
		v[a].push_back(b);
		node[b].d1++; 
	}
	int k;
	scanf("%d",&k);
	int cnt=0;
	for(int x=0;x<k;x++){
		bool tag=false;
		for(int j=0;j<m+1;j++){ 
			node[j].d2 =node[j].d1 ;
		}
		for(int k=0;k<m;k++){
			scanf("%d",&a);
			if(node[a].d2 !=0) tag=true; 
			for(int i=0;i<v[a].size();i++){
				node[v[a][i]].d2 --;
			}
		}
		if(tag){
			cnt++;
            printf("%s%d",cnt==1?"":" ",x);
		} 
	}
	return 0;
}

End!