1122. Hamiltonian Cycle (25) PAT 甲级
来源:互联网 发布:js文件调用java代码 编辑:程序博客网 时间:2024/04/30 21:42
传送门
#include<stdio.h>#include<vector>#define MAX_V 210#define INF 100000000#include<algorithm>using namespace std;int G[MAX_V][MAX_V];int n,m;int k;int len;vector<int> h;bool judge(){ if(h.size()!=n+1) return false; if(h[0]!=h[h.size()-1]) return false; vector<int> temp(h.begin(),h.end()-1); sort(temp.begin(),temp.end()); for(int i=0;i<temp.size();i++){ if(temp[i]!=i+1) return false; } for(int i=0;i<h.size()-1;i++){ int u=h[i],v=h[i+1]; if(G[u][v]==INF) return false; } return true;}int main(){ fill(G[0],G[0]+MAX_V*MAX_V,INF); scanf("%d%d",&n,&m); int V1,V2; int v; for(int i=0;i<m;i++){ scanf("%d%d",&V1,&V2); G[V1][V2]=G[V2][V1]=0; } scanf("%d",&k); for(int i=0;i<k;i++){ int N; scanf("%d",&N); h.clear(); for(int i=0;i<N;i++){ scanf("%d",&v); h.push_back(v); } if(judge()){ printf("YES\n"); } else{ printf("NO\n"); } }}
1 0
- pat甲级 1122. Hamiltonian Cycle (25)
- 1122. Hamiltonian Cycle (25) PAT 甲级
- 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 (25)
- 【PAT】1122. Hamiltonian Cycle
- PAT (Advanced Level) 1122. Hamiltonian Cycle (25)
- 【PAT】【Advanced Level】1122. Hamiltonian Cycle (25)
- PAT A1122 hamiltonian cycle (25)
- PAT A1122. Hamiltonian Cycle (25)
- 1122. Hamiltonian Cycle (25)
- 1122. Hamiltonian Cycle (25)
- 1122. Hamiltonian Cycle (25)
- 1122. Hamiltonian Cycle (25)
- 1122. Hamiltonian Cycle (25)
- Reactor事件驱动的两种设计实现:面向对象 VS 函数式编程
- c++的初始化列表
- HTML中文样式
- tuple(by rust)
- 基础代码
- 1122. Hamiltonian Cycle (25) PAT 甲级
- 运算符重载-赋值运算符的重载
- Intellij idea 和myeclipse的最常用快捷键
- 空包签名
- Tomcat启动过程原理详解
- 【面试题】剑指offer 5
- 百年地震数据告诉你,哪里的房子不能买
- equals 和 == 的区别
- “区块链”究竟是什么,怎么理解?