PAT 1122 Hamiltonian Cycle

原文链接： http://www.cnblogs.com/A-Little-Nut/p/9506431.html

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 V​1 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

#include //水题
#include
using namespace std;
int main(){
  int vn, en, qn;
  cin>>vn>>en;
  vector> map(vn+1, vector(vn+1, 0));
  vector visited(vn+1, 0);
  for(int i=0; i>v1>>v2;
    map[v1][v2]=map[v2][v1]=1;
  }
  cin>>qn;
  for(int i=0; i>n;
    vector path(n, 0);
    vector> temp=map;
    vector visited(vn+1, 0);
    for(int j=0; j>path[j];
    if(path[0]!=path[n-1]){
      cout<<"NO"<

转载于:https://www.cnblogs.com/A-Little-Nut/p/9506431.html