PAT (Advanced Level)-1122 Hamiltonian Cycle

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 <set>
#include <vector>
using namespace std;
int dis[256][256];
int main() 
{
	int n,m;
	scanf("%d %d",&n,&m);
	for(int i=0;i<m;i++)
	{
		int x,y;
		scanf("%d %d",&x,&y);
		dis[x][y]=1;
		dis[y][x]=1;
	}
	int k;
	cin>>k;
	while(k--)
	{
		int N,flag=1;
		set<int>se;
		cin>>N;
		vector<int>v(N);
		for(int i=0;i<N;i++)
		{
			scanf("%d",&v[i]);
			se.insert(v[i]);
		}
		for(int i=0;i<N-1;i++)
		{
			if(dis[v[i]][v[i+1]]==0)
			{
				flag=0;
				break;
			}
		}
		if(flag&&se.size()==n&&N==n+1&&v[0]==v[N-1])cout<<"YES"<<endl;
		else cout<<"NO"<<endl;
	}
	
}