1134 Vertex Cover (25point(s)) - C语言 PAT 甲级

1134 Vertex Cover (25point(s))

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⁴), 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

题目大意：

输入 N 个节点，M 条边，询问 K 个集合，每个集合有 N_v 个元素

判断 M 条边，每一条边两端的端点是否至少有一个在集合中

设计思路：

• 记录下 M 条边两边的端点号
• 对每个集合的询问，遍历所有边是否满足端点至少有一个在集合中

编译器：C (gcc)

#include <stdio.h>
#include <string.h>

int main(void)
{
        int n, m, k;
        int e[10010][2], ver[10010];
        int i, v, a;

        scanf("%d%d", &n, &m);
        for (i = 0; i < m; i++)
                scanf("%d%d", &e[i][0], &e[i][1]);

        scanf("%d", &k);
        while (k--) {
                scanf("%d", &v);
                memset(ver, 0, sizeof(ver));
                while (v--) {
                        scanf("%d", &a);
                        ver[a] = 1;
                }
                for (i = 0; i < m; i++)
                        if (ver[e[i][0]] == 0 && ver[e[i][1]] == 0)
                                break;
                printf("%s\n", i == m ? "Yes" : "No");
        }
        return 0;
}