PAT甲级 1134 - Vertex Cover
2018-02-26 08:58
459 查看
主要是考查了英文的能力
a graph 指的是输入的m条边组成的图
a vertex cover 指得是查询时输入的点(判断是否为vertex cover)
所以,当a graph的每一条边,都能在当前输入的一系列点匹配到,即为一个vertex cover。
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.
a graph 指的是输入的m条边组成的图
a vertex cover 指得是查询时输入的点(判断是否为vertex cover)
所以,当a graph的每一条边,都能在当前输入的一系列点匹配到,即为一个vertex cover。
#include<bits/stdc++.h> using namespace std; const int maxn=10000+10; vector<pair<int,int> >vp; bool visited[maxn]; int main(){ int n,m; int u,v; scanf("%d %d",&n,&m); for(int i=0;i<m;++i){ scanf("%d %d",&u,&v); vp.push_back(make_pair(u,v)); } int k; scanf("%d",&k); bool flag; while(k--){ flag=true; fill(visited,visited+maxn,false); scanf("%d",&u); for(int i=0;i<u;++i){ scanf("%d",&v); visited[v]=true; } for(vector<pair<int,int> >::iterator it=vp.begin();it!=vp.end();++it){ if(!visited[it->first] && !visited[it->second]){ flag=false; break; } } if(flag)printf("Yes\n"); else printf("No\n"); } return 0; }
相关文章推荐
- PAT甲级 1134. Vertex Cover (25)
- PAT 甲级 1134. Vertex Cover (25)
- 1134. Vertex Cover (25)-PAT甲级真题
- PAT 甲级 1134 Vertex Cover
- PAT甲级1134. Vertex Cover (25) 题解
- PAT1134:Vertex Cover
- pat 1134. Vertex Cover (25) 思维
- PAT (Advanced Level)1134. Vertex Cover (25) set的find函数
- PAT-1134 Vertex Cover (图的建立 + set容器)
- PAT (Advanced Level) Practise 1134 Vertex Cover (25)
- PAT甲级1001. A+B Format (20)
- PAT 甲级 1007. Maximum Subsequence Sum
- 1106. Lowest Price in Supply Chain (25) PAT甲级
- PAT甲级1111
- PAT甲级1121
- 1095. Cars on Campus (30) PAT 甲级
- PAT甲级1002. A+B for Polynomials (25)
- PAT甲级 1044
- PAT - 甲级 - 1108. Finding Average (20) ( 字符串处理 sscanf )
- PAT甲级1016. Phone Bills (25)