PAT（甲）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

note：给定一边集，然后再给定一顶点集，判断给定边集的任一边的是否至少存在一个顶点 位于该给定顶点集中。

思路：采用hash思想。定义一结构体，存储边的两个顶点。对于输入的每一个test样例，定义bool型的flag数组存储，遍历边集，进行判断 。

#include<iostream>
#include<vector>
using namespace std;

struct node{
	int l, r;	
};
vector<node> data;
int main(){
	freopen("F:\\PAT test\\test.txt","r",stdin);
	int n, m;
	cin >> n >> m;
	int l, r;
	for(int i = 0; i < m; i++){
		cin >> l >> r;
		node tnode = {l, r};
		data.push_back(tnode);
	}
	int k, cnt;
	cin >> k;
	for(int i = 0; i < k; i++){
		cin >> cnt;
		vector<bool> flag(n);
		int temp;
		for(int j = 0; j < cnt; j++){
			cin >> temp;
			flag[temp] = true;
		}
		bool mark = true;
		for(int j = 0; j < data.size(); j++){
			if(flag[data[j].l] == false && flag[data[j].r] == false){
				mark = false;
				break;
			}
		}
		if(mark == true){
			cout << "Yes" << endl;
		}else{
			cout << "No" << endl;
		}
	}
	return 0;
}