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 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>
#include <cstring>
#include <vector>
#include<climits>
using namespace std;

const int maxn= 200+10;
//const int INF=INT_MAX;

bool g[maxn][maxn],vis[maxn];
int node[maxn*maxn];
int n;
bool check(int m){
	if(node[0]!=node[m-1] ||m!=n+1)  return false;
	memset(vis,0,sizeof vis);
	for(int i=0;i<m-1;i++){
		vis[node[i]]=true;
		if(!g[node[i]][node[i+1]]) return false;
	}
	
	for(int i=1;i<=n;i++){
		if(vis[i]==false) return false;
			
	}

	return true;
}

	
int main(){
 	int k;
 	cin>>n>>k;
 	for(int i=0;i<k;i++){
		 int a,b;
		 cin>>a>>b;
		 g[a][b]=g[b][a]=true;
	}
	int q;
	cin>>q;
	while(q--){
		int m;
		cin>>m;
		for(int i=0;i<m;i++){
			cin>>node[i];	
		}
		if(check(m)) puts("YES");
		else puts("NO");
		
	}
	
	
	
	return 0;
}