PAT (Advanced Level) 1146 Topological Order （25 分）

最新推荐文章于 2021-11-02 21:53:58 发布

isunLt

最新推荐文章于 2021-11-02 21:53:58 发布

阅读量316

点赞数

分类专栏： PAT 文章标签： PAT

本文链接：https://blog.csdn.net/isunlt/article/details/87857861

版权

PAT 专栏收录该内容

92 篇文章 1 订阅

订阅专栏

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

Code:

#include <iostream>
#include <set>
#include <vector>
#include <cstring>
#pragma warning(disable:4996)

using namespace std;

const int maxn = 1005;
vector<int> g[maxn];
int in[maxn] = { 0 };
int n, m;

bool topoSort()
{
	int incopy[maxn];
	memcpy(incopy, in, sizeof(in));
	bool result = true;
	for (int i = 1; i <= n; i++)
	{
		int num; scanf("%d", &num);
		if (!result) continue;
		if (incopy[num] != 0) result = false;
		for (int j = 0; j<g[num].size(); j++)
			incopy[g[num][j]]--;
	}
	return result;
}

int main()
{
	scanf("%d%d", &n, &m);
	for (int i = 0; i<m; i++)
	{
		int v1, v2; scanf("%d%d", &v1, &v2);
		g[v1].push_back(v2);
		in[v2]++;
	}
	int q; scanf("%d", &q);
	vector<int> ans;
	for (int i = 0; i<q; i++)
	{
		bool b = topoSort();
		if (!b) ans.push_back(i);
	}
	for (int i = 0; i < ans.size(); i++) {
		if (i == 0) printf("%d", ans[i]);
		else printf(" %d", ans[i]);
	}
	return 0;
}

思路：

注意不要把上一组数据读到下一组！

bool topoSort()
{
	int incopy[maxn];
	memcpy(incopy, in, sizeof(in));
	for (int i = 1; i <= n; i++)
	{
		int num; scanf("%d", &num);
		if (incopy[num] != 0)
			return false;
		for (int j = 0; j<g[num].size(); j++)
			incopy[g[num][j]]--;
	}
	return true;
}