1134. Vertex Cover (25)
来源:互联网 发布:美国国籍 知乎 编辑:程序博客网 时间:2024/06/09 20:05
A vertex cover of a graph is a set of vertices such that each edge of the graph is incident to at least one vertex of the set. Now given a graph with several vertex sets, you are supposed to tell if each of them is a vertex cover or not.
Input Specification:
Each input file contains one test case. For each case, the first line gives two positive integers N and M (both no more than 104), being the total numbers of vertices and the edges, respectively. Then M lines follow, each describes an edge by giving the indices (from 0 to N-1) of the two ends of the edge.
After the graph, a positive integer K (<= 100) is given, which is the number of queries. Then K lines of queries follow, each in the format:
Nv v[1] v[2] ... v[Nv]
where Nv is the number of vertices in the set, and v[i]'s are the indices of the vertices.
Output Specification:
For each query, print in a line "Yes" if the set is a vertex cover, or "No" if not.
Sample Input:10 118 76 84 58 48 11 21 49 89 11 02 454 0 3 8 46 6 1 7 5 4 93 1 8 42 2 87 9 8 7 6 5 4 2Sample Output:
NoYesYesNoNo
#include <iostream>#include <vector>#include <set>#include <algorithm>#include <functional>using namespace std;struct edge{int u,w;edge(int x,int y):u(x),w(y){}};vector<edge> v;int main(){int n,m;cin>>n>>m;for(int i=0;i<m;++i){int u,w;cin>>u>>w;v.push_back(edge(u,w));}int k;cin>>k;while(k--){int num,visit[10000]={0},ret=1,idx;set<int> s;cin>>num;for(int i=0;i<num;++i){cin>>idx;s.insert(idx);}for(auto x:v){if(visit[x.u]||visit[x.w]) continue;//以及在集合里,直接跳过if(s.find(x.u)!=s.end()) visit[x.u]=1;else if(s.find(x.w)!=s.end()) visit[x.w]=1;else {ret=0;break;}}ret==1?cout<<"Yes\n":cout<<"No\n";}return 0;}
- 1134. Vertex Cover (25)
- 1134. Vertex Cover (25)
- 1134. Vertex Cover (25)
- 1134. Vertex Cover (25)
- 1134. Vertex Cover (25)
- 1134. Vertex Cover (25)
- 1134. Vertex Cover (25)
- 1134. Vertex Cover (25)
- PAT甲级 1134. Vertex Cover (25)
- PAT甲级1134. Vertex Cover (25) 题解
- 1134. Vertex Cover (25)[图的遍历]
- PAT 甲级 1134. Vertex Cover (25)
- pat 1134. Vertex Cover (25) 思维
- 1134. Vertex Cover (25)-PAT甲级真题
- 1134. Vertex Cover (25)(最小点集覆盖)
- Vertex Cover
- Vertex Cover
- Vertex Cover
- webpack的使用
- 管理用户和组账户,passwd字段意义
- QGC地图中2点连线
- JS——面向对象实例
- 马跳日
- 1134. Vertex Cover (25)
- "页面跳转"实例详解"SpringMVC注解"的作用与用法
- iOS 处理二叉树数据 实现多级表格
- Mybatis
- 动态规划——最优二叉查找树
- MYSQL(五)
- shell脚本中 数组的基本用法
- 面向对象-1
- Leetcode题解-5. Longest Palindromic Substring