PAT (Advanced Level) Practise1134Vertex Cover (25)
来源:互联网 发布:公文流转软件 编辑:程序博客网 时间:2024/06/03 04:47
1134. Vertex Cover (25)
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<stdio.h>const int N = 1e5 + 10;int n, m, q, x, y;int a[N], b[N], c[N];int main(){ scanf("%d%d",&n,&m); for (int i = 0;i<m;i++) { scanf("%d%d",&a[i],&b[i]); } scanf("%d",&q); while (q--) { scanf("%d",&x); for (int i = 0;i<n;i++) c[i] = 0; while (x--) scanf("%d",&y),c[y] = 1; int flag = 1; for (int i = 0;i<m;i++) { if(c[a[i]]+c[b[i]]) continue; flag = 0; break; } puts(flag?"Yes":"No"); } return 0;}
- PAT (Advanced Level) Practise1134Vertex Cover (25)
- 【PAT Advanced Level】1025. PAT Ranking (25)
- PAT Advanced Level 1075. PAT Judge (25)
- 【PAT】【Advanced Level】1025. PAT Ranking (25)
- 【PAT】【Advanced Level】1075. PAT Judge (25)
- 1029. Median (25) @ PAT (Advanced Level) Practise
- 【PAT Advanced Level】1003. Emergency (25)
- 【PAT Advanced Level】1010. Radix (25)
- 【PAT Advanced Level】1016. Phone Bills (25)
- 【PAT Advanced Level】1020. Tree Traversals (25)
- 【PAT Advanced Level】1021. Deepest Root (25)
- 【PAT Advanced Level】1024. Palindromic Number (25)
- 【PAT Advanced Level】1029. Median (25)
- 【PAT Advanced Level】1032. Sharing (25)
- 【c++】PAT (Advanced Level)1010. Radix (25)
- PAT (Advanced Level) Practise 1032. Sharing (25)
- 【C++】PAT(advanced level)1032. Sharing (25)
- 【C++】PAT(advanced level)1029. Median (25)
- Python + opencv 实现图片马赛克
- log4net 使用笔记(c# .net framework)
- QObject::connect: Cannot queue arguments of type "xxx",(Make sure "xxx" is registed using qRegisterM
- 神奇的Invalid bound statement (not found)错误
- vector map set的使用
- PAT (Advanced Level) Practise1134Vertex Cover (25)
- CentOS中安装setup工具
- leetcode-cli的安装与使用以及未解决的问题
- 数据分析师:大数据建模,你需要了解九大形式
- equals与==
- SQL Server 修改兼容模式
- 自定义迭代器
- JS基础 复习: Javascript的书写位置
- @Transactional事务不起作用的解决