PAT甲级——A1134 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 1), 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​​ [ [

where N​v​​ is the number of vertices in the set, and ['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

mmp,看了半天都没有看懂题，英语弱到爆
百度后才知道，每条边至少有一个顶点存在set总，则该set是vertex cover

#include <iostream>
#include <vector>
using namespace std;
int a, b, n, m, k,nv;
int main()
{
    cin >> n >> m;
    vector<pair<int, int>>graph(m);
    for (int i = 0; i < m; ++i)
        cin >> graph[i].first >> graph[i].second;
    cin >> k;
    while (k--)
    {
        cin >> nv;
        vector<bool>map(n, false);
        while (nv--)
        {
            cin >> a;
            map[a] = true;
        }
        bool flag = true;
        for (int i = 0; flag&&i < m; ++i)
            if (map[graph[i].first] == false && map[graph[i].second] == false)//没有一个顶点存在map中
                flag = false;
        cout << (flag ? "Yes" : "No") << endl;
    }
    return 0;
}