1134 Vertex Cover (25 分)（题目大意）

最新推荐文章于 2023-11-24 16:58:17 发布

原创最新推荐文章于 2023-11-24 16:58:17 发布 · 690 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #动态规划 #贪心算法

算法同时被 3 个专栏收录

401 篇文章

订阅专栏

c++代码

360 篇文章

订阅专栏

PTA甲级

91 篇文章

订阅专栏

本文介绍了一种算法，用于确定给定图中一系列点集是否构成(vertex cover)。输入为图的顶点数、边以及查询点集的大小和元素，通过遍历和检查每条边是否至少与一个查询点相连，输出每个点集是否为有效覆盖。理解并应用这个概念对于解决实际图论问题至关重要。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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:

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

结尾无空行

如果你是读不懂题，而不会做这道题，就很尴尬了，因为考试的时候不一定能猜出来此题是什么意思，大致的意思是：

给定一个图，给定指定的点的集合，如果图中所有的路径都经过集合中的点，输出 yes，否则输出 no

我上来就以为是并查集的题目，结果不是，吐了又重新写的代码。

#include<iostream>
#include<bits/stdc++.h>
#include<string>
#include<set>
#include<map>
#include<vector>
#include<queue>
#include<deque>
#include<unordered_set>
#include<unordered_map>
#include<cctype>
#include<algorithm>
#include<stack>
using namespace std;
const int N = 10001;
vector<int> G[N];// 临界表存储图
int n, m;
int main() {
	cin >> n >> m;
	while (m--) {
		int x, y;
		cin >> x >> y;
		G[x].push_back(y);
		G[y].push_back(x);
}
	int k;
	cin >> k;
	while (k--) {
		int nv;
		cin >> nv;
		set<int> st;
		for (int i = 0; i < nv; i++) {
			int x;
			cin >> x;
			st.insert(x);
		}
		bool flag = true;
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < G[i].size(); j++) {
				if (st.find(i) == st.end() && st.find(G[i][j]) == st.end()) {// 两边都找不到
					flag = false;
					break;
				}
			}
			if (!flag) {
				break;
			}
		}
		if (!flag) {
			cout << "No" << endl;
		} else {
			cout << "Yes" << endl;
		}
	}
	return 0;
}