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 Kwhich 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 106 23 41 52 53 14 11 66 31 24 567 5 1 4 3 6 2 56 5 1 4 3 6 29 6 2 1 6 3 4 5 2 64 1 2 5 17 6 1 3 4 5 2 67 6 1 2 5 4 3 1

Sample Output:

YESNONONOYESNO 题意：判断是否为Hamiltonian Cycle：条件是简单回路（除最后一个结点以外只出现一次），并且相邻两点之间连通。

1 /** 2 * Copyright(c) 3 * All rights reserved. 4 * Author : Mered1th 5 * Date : 2019-02-28-00.13.48 6 * Description : A1122 7 */ 8 #include
        
          9 #include
         
          10 #include
          
           11 #include
           
            12 #include
            
             13 #include
             
              14 #include
              
               15 #include
               

temp;40 bool vis[maxn]={ false};41 bool flag=true;42 for(int j=0;j