pat 甲级 图 A1134 Vertex Cover (25分)

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 10​4​​), 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:

N​v​​ v[1] v[2]⋯v[N​v​​]

where N​v​​ 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 11
8 7
6 8
4 5
8 4
8 1
1 2
1 4
9 8
9 1
1 0
2 4
5
4 0 3 8 4
6 6 1 7 5 4 9
3 1 8 4
2 2 8
7 9 8 7 6 5 4 2

Sample Output:

No
Yes
Yes
No
No

 题意：给出n个结点m条边，再给出k个结点的集合。问每个集合所给的结点是否可以包含图的全部边，也就是所有m条边的两个端点是否至少有一个在所给集合中。

#include<iostream>
#include<vector>
using namespace std;
int main(){
	int n,m,k;
	cin>>n>>m;
    int edge[10010][2];
	for(int i=0;i<m;i++)
	scanf("%d %d",&edge[i][0],&edge[i][1]);//输入m条边
	scanf("%d",&k);
	for(int i=0,nv;i<k;i++){//k个查询
		vector<bool> cover(n,false);
		bool flag=true;
		scanf("%d",&nv);
		for(int j=0,v;j<nv;j++){
			scanf("%d",&v);
			cover[v]=true;//标记所给结点
		}
		for(int j=0;j<m;j++){//查询m条的两个结点
			if(cover[edge[j][0]]==false&&cover[edge[j][1]]==false){
				flag=false;
				break;
			}
		}
		printf("%s\n",flag==true?"Yes":"No");
	}
	return 0;
}