1122 Hamiltonian Cycle (25 分)

1122 Hamiltonian Cycle (25 分)

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​​ V​2​​ … V​n​​

where n is the number of vertices in the list, and V​i​​ '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

1.序列中点个数为n + 1，2.首尾要相同，3.序列中相邻两点要联通，4.共访问了n个点 。4个条件

#include<bits/stdc++.h>
using namespace std;
int main() {
	int n, m, a, b, k, cnt, e[205][205];
	scanf("%d %d", &n, &m);
	for (int i = 0; i < m; i++) {
		scanf("%d %d", &a, &b);
		e[a][b] = e[b][a] = 1;
	}
	scanf("%d", &k);
	for (int i = 0; i < k; i++) {
		bool flag = true;
		unordered_set<int> s;
		scanf("%d", &cnt);
		vector<int> v(cnt);
		for (int j = 0; j < cnt; j++) {
			scanf("%d", &v[j]);
			s.insert(v[j]);
		}
		for (int j = 1; j < cnt; j++) {
			if (e[v[j]][v[j - 1]] == 0) {
				flag = false;
				break;
			}
		}
		if (s.size() == n && flag && v[0] == v[cnt - 1] && cnt == n + 1) printf("YES\n");
		else printf("NO\n");
	}
}