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

思路

给一个点集，能够满足图中的每一条边都至少有一个端点在该集合内。遍历每个点，把从这个点出去的所有边存在set里，因为存的是双向边，set可以去重，如果set的大小不等于2m说明No

cpp代码

#include<iostream>
#include<unordered_map>
#include<cstring>
#include<set>
using namespace std;
const int N=4e4+10;
int e[2*N],ne[2*N],h[N],idx;

void add(int a,int b){
    e[idx]=b,ne[idx]=h[a],h[a]=idx++;
}
int main(){
    int n,m;
    cin>>n>>m;
    memset(h,-1,sizeof h);
    for(int i=0;i<m;i++){
        int a,b;
        cin>>a>>b;
        add(a,b);
        add(b,a);
    }
    int q;
    cin>>q;
    while(q--){
        int k;
        cin>>k;
        set<pair<int,int>> s;
        for(int i=0;i<k;i++){
            int x;
            cin>>x;
            for(int j=h[x];~j;j=ne[j]){
                int w=e[j];
                s.insert({x,w});
                s.insert({w,x});
            }
        }
       
        if(s.size()==2*m)puts("Yes");
        else puts("No");
    }
    return 0;
}