1134 Vertex Cover

1134 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. 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
题目大意：
有一个图，给出结点及边的相关信息。先给出几组结点的集合，问该集合的结点是否和图中所有的边相关—换句话说就是只要一条边两端结点中的一个在集合中，那此边就被关联到。
参考代码：

#include<iostream>
#include<set>
#include<vector>
using namespace std;
vector<vector<int>>v;
int main()
{
	freopen("1134.txt", "r", stdin);
	int n, e, a, b, k, nv, index, flag = 1;
	set<int>s;
	scanf_s("%d%d", &n, &e);
	v.resize(n);
	for (int i = 1; i <= e; i++) {
		scanf_s("%d%d", &a, &b);
		v[a].push_back(i);
		v[b].push_back(i);
	}
	scanf_s("%d", &k);
	for (int i = 1; i <= k; i++) {
		scanf_s("%d", &nv);
		flag = 1; s.clear();
		for (int j = 1; j <= nv; j++) {
			scanf_s("%d", &index);
			if (flag) {
				for (int p = 0; p < v[index].size(); p++)
					s.insert(v[index][p]);
				if (s.size() == e)
					flag = 0;
			}
		}
		if (flag == 0)cout << "Yes" << endl;
		else cout << "No" << endl;
	}

	return 0;
}