1146 Topological Order-PAT甲级（图的拓扑排序）

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

考察图的拓扑排序，若按照给出的结点的顺序，可以满足拓扑排序的性质，排列时的入度为0，则依次向下遍历，都满足的情况下是拓扑排序序列，否则不是

满分代码如下：

#include<bits/stdc++.h>
using namespace std;
const int N=1005;
vector<int>g[N];//备份 
int in[N],intt[N];//记录每个顶点的入度情况 
int n,m,k,path[N];
set<int>st;
int main(){
	memset(in,0,sizeof(in));
	scanf("%d%d",&n,&m);
	int u,v;
	for(int i=1;i<=m;i++){
		scanf("%d%d",&u,&v);
		g[u].push_back(v);
		g[v].push_back(u);
		in[v]++;
	}
	scanf("%d",&k);
	for(int i=0;i<k;i++){
		for(int j=1;j<=n;j++){
			intt[j]=in[j];
		}
		for(int j=1;j<=n;j++){
			scanf("%d",&path[j]);
		}
		int kk=1;
		while(kk<=n){
			if(intt[path[kk]]==0){
				for(int j=0;j<g[path[kk]].size();j++){
					int v=g[path[kk]][j];
					intt[v]--;
				}
				kk++;
			}else{
				break;
			}
		}
		if(kk<=n){
			st.insert(i);	
		}	
	}
	int flag=0;
	for(auto i:st){
		if(flag) printf(" ");
		printf("%d",i);
		flag=1;
	}
	return 0;	
}