1134 Vertex Cover 甲级 xp_xht123

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

解题思路：首先先使用结构体读入整张图，对于每一组询问判断对于每一条边都有一个或两个点存在在集合中，如果两个点组成的边不存在，输出no即可，反之输出yes

#include<iostream>
#include<cstring>
using namespace std;
const int N = 1e4 + 10;

int n , m;
struct edges
{
    int a , b;
}e[N];
bool st[N];

int main()
{
    cin >> n >> m;
    for(int i = 0;i < m;i ++) cin >> e[i].a >> e[i].b;
    int k;
    cin >> k;
    while(k --)
    {
        memset(st , false , sizeof st);
        int x;
        cin >> x;
        for(int i = 0;i < x;i ++) 
        {
            int num;
            cin >> num;
            st[num] = true;
        }
        
        bool flag = true;
        //对于每一条边都有一个或两个点存在在集合中
        for(int i = 0;i < m;i ++)
        {
            if(!st[e[i].a] && !st[e[i].b])
            {
                flag = false;
                puts("No");
                break;
            }
        }
        if(flag) puts("Yes");
    }
}