PAT_A1122#Hamiltonian Cycle

Source:

PAT A1122 Hamiltonian Cycle (25 分)

Description:

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), the number of vertices, and M, the number of edges in an undirected graph. Then Mlines 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 Klines 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

Keys:

• 图的存储和遍历

Code:

/*
Data: 2019-06-20 16:30:23
Problem: PAT_A1122#Hamiltonian Cycle
AC: 12:29

题目大意：
H圈定义：简单圈且包含全部顶点；
判断所给圈是否为H圈
*/
#include<cstdio>
#include<set>
#include<algorithm>
using namespace std;
const int M=220;
int grap[M][M],path[M];

int main()
{
#ifdef ONLINE_JUDGE
#else
    freopen("Test.txt", "r", stdin);
#endif // ONLINE_JUDGE

    fill(grap[0],grap[0]+M*M,0);
    int n,m,k,v1,v2;
    scanf("%d%d", &n,&m);
    for(int i=0; i<m; i++)
    {
        scanf("%d%d", &v1,&v2);
        grap[v1][v2]=1;
        grap[v2][v1]=1;
    }
    scanf("%d", &m);
    while(m--)
    {
        set<int> ver;
        scanf("%d", &k);
        for(int i=0; i<k; i++){
            scanf("%d", &path[i]);
            ver.insert(path[i]);
        }
        int reach=1;
        for(int i=0; i<k-1; i++){
            if(grap[path[i]][path[i+1]]==0){
                reach=0;break;
            }
        }
        if(reach==0 || path[0]!=path[k-1] || ver.size()!=n || k!=n+1)
            printf("NO\n");
        else
            printf("YES\n");
    }

    return 0;
}