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

C++：

/*
 @Date    : 2018-03-06 19:49:46
 @Author  : 酸饺子 (changzheng300@foxmail.com)
 @Link    : https://github.com/SourDumplings
 @Version : $Id$
*/

/*
https://www.patest.cn/contests/pat-a-practise/1134
 */

#include <iostream>
#include <cstdio>
#include <vector>
#include <map>
#include <set>

using namespace std;

static int N, M;

int main(int argc, char const *argv[])
{
    scanf("%d %d", &N, &M);
    vector<pair<int, int>> edgeData(M);
    for (int i = 0; i != M; ++i)
    {
        int v, w;
        scanf("%d %d", &v, &w);
        auto p = make_pair(v, w);
        edgeData[i] = p;
    }
    int K;
    scanf("%d", &K);
    for (int i = 0; i != K; ++i)
    {
        int Nv, v;
        scanf("%d", &Nv);
        set<int> s;
        for (int i = 0; i != Nv; ++i)
        {
            scanf("%d", &v);
            s.insert(v);
        }
        bool ok = true;
        for (auto eachEdge : edgeData)
        {
            if (s.find(eachEdge.first) == s.end() && s.find(eachEdge.second) == s.end())
            {
                ok = false;
                break;
            }
        }
        if (ok) printf("Yes\n");
        else printf("No\n");
    }
    return 0;
}