1146. Topological Order (25)

1146. Topological Order (25)

时间限制

200 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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

初看标题以为是要来在考纲内但是没考过的拓扑排序，其实还是邻接问题

#include<stdio.h>
#include<vector>
using namespace std;
int indegree[1010];
int store[1010];
vector<int>ans;
vector<int>adj[1010];
int main(){
	int n,m,k,i,j,c1,c2,flag,tmp;
	scanf("%d %d",&n,&m);
	for(i=0;i<m;i++){
		scanf("%d %d",&c1,&c2);
		indegree[c2]++;
		adj[c1].push_back(c2);//有向图 
	}
	for(i=1;i<=n;i++){
		store[i]=indegree[i];//保存入度 
	}
	scanf("%d",&k);
	int cou=0;
	while(k--){
		flag=1;
		for(i=1;i<=n;i++){
			indegree[i]=store[i];//初始化入度，因为后面入度会被改变 
		}
		for(i=0;i<n;i++){
			scanf("%d",&tmp);
			if(flag==0){//flag==0,标记不是拓扑排序，跳过判断 
				continue;
			}
			else{
				if(indegree[tmp]){//当前节点还有前驱节点，不是拓扑排序 
					flag=0;
				}
				else{
					for(j=0;j<adj[tmp].size();j++){
						int next=adj[tmp][j];
						indegree[next]--;//节点的后继节点度减一 
					}
				}
			}
		}
		if(flag==0){//不是拓扑排序
			ans.push_back(cou);
		}
		cou++;
	}
	for(i=0;i<ans.size();i++){
		printf("%d",ans[i]);
		if(i!=ans.size()-1){
			printf(" ");
		}
	}
}