1122. Hamiltonian Cycle (25)-PAT甲级真题

题意

给一个图，含有n个结点m条边，给q个环，问是否是哈密顿环。
哈密顿环：该简单路径起终点相同rec.front() == rec.back()，包含所有结点rec.size() == n + 1

题解

#include<bits/stdc++.h>
using namespace std;
int n, m, q, k, a, b; //least 3 node 
bool gra[201][201], st[201];
deque<int> rec;
int main(){
	cin>>n>>m;
	while(m--){
		scanf("%d %d", &a, &b);
		gra[a][b] = gra[b][a] = true;
	}
	cin>>q;
	while(q--){
		cin>>k;
		rec.resize(k);
		for(int i = 0; i < k; i ++) scanf("%d", &rec[i]);
		if(k != n + 1 || rec.front() != rec.back()) puts("NO");
		else{
			bool f = true;
			memset(st, false, sizeof st);
			for(int i = 0; i < k - 1; i ++){
				if(gra[rec[i]][rec[i + 1]] == 0 || st[rec[i]]) f = false;
				st[rec[i]] = true;
			}
			puts(f ? "YES" : "NO");
		}
	}
	return 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