1122 Hamiltonian Cycle（25 分）（C++）

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 V​1​​ 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

图论问题：判断给出的路径能否一次性遍历完，每条边只遍历一次

#include <iostream>
using namespace std;
const int inf = 0x7fffffff;
int n, m, k, cnt, temp;
bool visit[205], e[205][205];
int main(){
	scanf("%d %d", &n, &m);
	for(int i = 0; i < m; ++ i){
		int a, b;
		scanf("%d %d", &a, &b);
		e[a][b] = e[b][a] = true;
	}
	scanf("%d", &k);
	for(int i = 0; i < k; ++ i){
		scanf("%d", &cnt);
		fill(visit, visit + n + 1, true);
		int last = -1, num = 0;
		bool flag = true;
		for(int j = 0; j < cnt; ++ j){
			scanf("%d", &temp);
			if(last != -1){
				flag &= (visit[temp] & e[last][temp]) ;
				num ++ ;
				visit[temp] = false;
			}
			last = temp;
		}
		printf("%s\n", (num == n && flag) ? "YES" : "NO");
	}
}