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条边的图，分别给出m条边的两端顶点，然后对其进行k次查询，每次查询输入一个顶点集合，要求判断这个顶点集合是否能完成顶点覆盖，即图中的每一条边都至少有一个顶点在这个集合中。

C++：

#include "iostream"
#include "vector"
#include "cstdio"

using namespace std;

int n,m;
int main(){
	scanf("%d %d",&n,&m);
	vector<vector<int> > v(n);
	for (int i=0;i<m;i++)
	{
		int a,b;
		scanf("%d %d",&a,&b);
		v[a].push_back(i);
		v[b].push_back(i);
	}
	int k;
	scanf("%d",&k);
	for(int i=0;i<k;i++){
		vector<int> hashtable(m,0);
		int num,flag=1;
		scanf("%d",&num);
		for (int j=0;j<num;j++)
		{
			int temp;
			scanf("%d",&temp);
			for (int u=0;u<v[temp].size();u++)
				hashtable[v[temp][u]]=1;
		}
		for (int j=0;j<m;j++)
			if (hashtable[j]==0&&flag==1){
				printf("No\n");
				flag=0;
			}
		if (flag==1)printf("Yes\n");
	}
	return 0;
}