PAT甲级 1122 哈密顿图

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 V1​ V2​ ... Vn​

where n is the number of vertices in the list, and Vi​'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

代码长度限制

16 KB

时间限制

300 ms

内存限制

64 MB

#include<bits/stdc++.h>
using namespace std;
int n,m;
bool graph[201][201] = {false};
int main(){
    cin>>n>>m;
    int v1,v2;
    for(int i=0;i<m;i++){
        cin>>v1>>v2;
        graph[v1][v2] = graph[v2][v1] = true;
    }
    int x,y;
    cin>>x;
    for(int i=0;i<x;i++){
        cin>>y;
        bool t = true;
        set<int> se;
        int ml[1000000];
        for(int j=0;j<y;j++){
            cin>>ml[j];
            se.insert(ml[j]);
            if(j){
                if(!graph[ml[j]][ml[j-1]]){
                    t = false;
                }
            }
        }
        if(ml[y-1]!=ml[0]||se.size()!=n||y!=n+1) t=false;
        if(t) cout<<"YES"<<endl;
        else cout<<"NO"<<endl;
    }
}