1122 Hamiltonian Cycle (25分) 图模拟

最新推荐文章于 2022-02-21 11:00:37 发布

haohao0626

最新推荐文章于 2022-02-21 11:00:37 发布

阅读量139

点赞数

分类专栏： PAT 甲级

本文链接：https://blog.csdn.net/haohao0626/article/details/106566366

版权

PAT 甲级专栏收录该内容

132 篇文章 0 订阅

订阅专栏

The "Hamilton cycle problem" is to find a simple cycle that contains every vertex in a graph. Such a cycle is called a "Hamiltonian cycle".

In this problem, you are supposed to tell if a given cycle is a Hamiltonian cycle.

Input Specification:

Each input file contains one test case. For each case, the first line contains 2 positive integers N (2<N≤200), the number of vertices, and M, the number of edges in an undirected graph. Then M lines follow, each describes an edge in the format Vertex1 Vertex2, where the vertices are numbered from 1 to N. The next line gives a positive integer K which is the number of queries, followed by K lines of queries, each in the format:

n V1 V2 ... Vn

where n is the number of vertices in the list, and Vi's are the vertices on a path.

Output Specification:

For each query, print in a line YES if the path does form a Hamiltonian cycle, or NO if not.

Sample Input:

6 10
6 2
3 4
1 5
2 5
3 1
4 1
1 6
6 3
1 2
4 5
6
7 5 1 4 3 6 2 5
6 5 1 4 3 6 2
9 6 2 1 6 3 4 5 2 6
4 1 2 5 1
7 6 1 3 4 5 2 6
7 6 1 2 5 4 3 1

Sample Output:

YES
NO
NO
NO
YES
NO

吾：

#include <iostream>
#include <vector>
#include <set>

using namespace std;
const int maxn = 206;

int e[maxn][maxn];

int n;

void check()
{
	int t, pre, now;
	cin >> t;
	vector<int> v;
	set<int> s;
	
	bool flag = false;

	//bool have[maxn] = { false }; 不能用bool数组，因为开头和结尾是同一个点，这样没法区分是重复值还是闭环了，除非最后一个点单独输入，这样太麻烦了，用set集合吧，stl
	for (int i = 0; i < t; i++)
	{
		if (i == 0)
		{
			cin >> pre;
			v.push_back(pre);
			s.insert(pre);
			continue;
		}
		cin >> now;		
		if (e[pre][now] != 1)
		{		
			flag = true;
		}
		pre = now;
		v.push_back(pre);
		s.insert(pre);
	}
	if (flag|| t != n + 1 || s.size() != n|| v[0] != *(v.rbegin()))
	{//依次为四种情况：1.某点到下个点不通；2.点数量不一致；3.有的点不在环里；4.开头和结尾不一致。
		cout << "NO" << endl;
		return;
	}
	
	cout << "YES" << endl;
	return;
}

int main()
{
	//freopen("in.txt", "r", stdin);
	int m, k;
	cin >> n >> m;
	for (int i = 0; i < m; i++)
	{
		int a, b;
		cin >> a >> b;
		e[a][b] = e[b][a] = 1;
	}
	cin >> k;
	for (int i = 0; i < k; i++)
	{
		check();
	}

	return 0;
}