PAT(Advanced Level)1122. Hamiltonian Cycle
来源:互联网 发布:星空直播网络电视apk 编辑:程序博客网 时间:2024/04/29 05:02
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 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 1Sample Output:
YESNONONOYESNO
#include <iostream>#include <cstdio>#include <cstring>#include <map>#include <set>using namespace std;int n,m,k,q;int a[205][205],b[205];int main(){ cin>>n>>m; int u,v; for(int i = 0;i < m;i++){ cin>>u>>v; a[u][v] = 1; a[v][u] = 1; } cin>>q; while(q--){ cin>>k; set<int>s; for(int i = 0;i < k;i++){ cin>>b[i]; s.insert(b[i]); } if(k!=(n+1)||b[0]!=b[k-1]||s.size()!=n){ printf("NO\n"); continue; } int f = 0; for(int i = 1;i < k;i++){ if(!a[b[i-1]][b[i]]){ f = 1; printf("NO\n"); break; } } if(!f)printf("YES\n"); } return 0;}
- PAT (Advanced Level) 1122. Hamiltonian Cycle (25)
- PAT(Advanced Level)1122. Hamiltonian Cycle
- 【PAT】【Advanced Level】1122. Hamiltonian Cycle (25)
- PAT (Advanced Level) Practise 1122. Hamiltonian Cycle (25)
- PAT (Advanced Level) Practise 1122 Hamiltonian Cycle (25)
- PAT (Advanced Level) Practise 1122 Hamiltonian Cycle (25)(哈密顿圈)
- 【PAT】1122. Hamiltonian Cycle
- PAT--1122. Hamiltonian Cycle (25)
- pat 1122. Hamiltonian Cycle (25)
- PAT-1122. Hamiltonian Cycle (25)
- pat甲级 1122. Hamiltonian Cycle (25)
- 1122. Hamiltonian Cycle (25) PAT 甲级
- PAT甲级 1122. Hamiltonian Cycle (25)
- PAT 甲级 1122. Hamiltonian Cycle (25)
- PAT 1122 Hamiltonian Cycle
- PAT A1122 hamiltonian cycle (25)
- PAT A1122. Hamiltonian Cycle (25)
- 1122. Hamiltonian Cycle (25)-PAT甲级真题
- mybatis-spring无法自动装配mapper的问题
- 设计模式之开篇
- web安全与防御---1.安装攻击环境DVWA
- 算法 迷宫问题
- ELF section修复的一些思考
- PAT(Advanced Level)1122. Hamiltonian Cycle
- Mybatis的简单运行流程
- 将博客搬至CSDN
- 线程池相关基础知识
- java虚拟机内部原理分析
- JavaScript之Prototype学习(一)
- CSS3 遇到的问题
- Android入门之搭建开发环境
- JAVA垃圾回收机制分析