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 104), 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:

Nv v[1] v[2] ... v[Nv]

where Nv 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

 

把查询中输入的所有顶点都存入set中，然后对于每一条边所对应的两个顶点，都在set中查找，若都没有找到，那么就不是顶点覆盖

set是个好东西，自动排序，查询速度快。

 

 

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

int main()
{
    int N, M, K, edges[10002][2];
    cin >> N >> M;
    for (int i = 0; i<M; i++)
    {
        int a, b;
        cin >> a >> b;
        edges[i][0] = a;
        edges[i][1] = b;
    }
    cin >> K;
    for (int i = 0; i<K; i++)
    {
        int n;
        bool flag = true;
        set<int> vset;
        cin >> n;
        for (int j = 0; j<n; j++)
        {
            int input;
            cin >> input;
            vset.insert(input);
        }
        for (int j = 0; j<M; j++)
        {
            if (vset.find(edges[j][0]) == vset.end() && vset.find(edges[j][1]) == vset.end())
            {
                flag = false;
                break;
            }
        }
        if (flag)
            cout << "Yes" << endl;
        else
            cout << "No" << endl;
    }

    return 0;
}