1134. Vertex Cover (25)
来源:互联网 发布:佳能9100cdn网络驱动 编辑:程序博客网 时间:2024/05/19 22:49
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 118 76 84 58 48 11 21 49 89 11 02 454 0 3 8 46 6 1 7 5 4 93 1 8 42 2 87 9 8 7 6 5 4 2Sample Output:
NoYesYesNoNo
思路:给每条边 编号,用邻接表存储 边的编号,遍历Nv个节点的边,给遇到的边上标记。最后如果有没标记的就是No,反之Yes。
代码:
#include <iostream>#include <algorithm>#include <vector>#include <stdio.h>using namespace std;vector <int> num[100000];int main(){int n, m, k;cin >> n >> m;int a, b;for (int i = 0; i < m; i++){cin >> a >> b;num[a].push_back(i); num[b].push_back(i);}cin >> k;while (k--){int judge = 1;cin >> a;vector <int> edge (m, 0);for (int i = 0; i < a; i++){cin >> b;for (int j = 0; j < num[b].size(); j++) edge[num[b][j]] = 1;}for (int i = 0; i < m; i++)if (!edge[i]) judge = 0;if (judge) cout << "Yes" << endl;else cout << "No" << endl;}}
因为题目是 Vertex Cover ,所以做的时候总是从点出发,然后思绪就很混乱。看了别人的代码以后才发现只要数边就行了 _(:з)∠)_
思路历程:
先想到的是用邻接矩阵存储,遍历Nv个节点所在行的值,把连通的地方(1)改成0,最后遍历全图,如果还存在边(1) 则输出No,反之Yes 。接着发现是10^4,想想铁定超时。
进而改用邻接表存储,遍历Nv个节点的边的同时删除边,最后如果还存在边,则为No,反之Yes。写的时候发现:
1:有k组数据要测试,直接删会影响后面处理
2:删除对应顶点的边时,得要搜索,时间复杂度提高
之后就走了邪路,想着用点亮顶点的方法 结果第一组数据就是顶点全亮但少一条边的情况
看题解才知道点亮边就行了……
PS:搜的时候看到另外一种思路,保存所有边的信息,对于每一条边的两个顶点,在Vn顶点的集合中查找。如果两个顶点都不在集合中,说明这条边没有被覆盖
博客网址: http://blog.csdn.net/akibayashi/article/details/78014749
代码:
#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;elsecout << "No" << endl;}return 0;}
- 1134. Vertex Cover (25)
- 1134. Vertex Cover (25)
- 1134. Vertex Cover (25)
- 1134. Vertex Cover (25)
- 1134. Vertex Cover (25)
- 1134. Vertex Cover (25)
- 1134. Vertex Cover (25)
- 1134. Vertex Cover (25)
- PAT甲级 1134. Vertex Cover (25)
- PAT甲级1134. Vertex Cover (25) 题解
- 1134. Vertex Cover (25)[图的遍历]
- PAT 甲级 1134. Vertex Cover (25)
- pat 1134. Vertex Cover (25) 思维
- 1134. Vertex Cover (25)-PAT甲级真题
- 1134. Vertex Cover (25)(最小点集覆盖)
- Vertex Cover
- Vertex Cover
- Vertex Cover
- Qt 判断网络连接
- 数据分析:Python分析学生数据
- 分享《架构真经:互联网技术架构的设计原则(原书第2版)》序言中的一段话
- Java web-内省(Introspector)
- geode(二)配置
- 1134. Vertex Cover (25)
- 【Ubuntu】安装依赖文件
- SharedPrefence的一个简单工具类
- 文章标题
- Mybatis动态SQL trim
- Eclipse中新建java类自动生成作者和时间设置
- Fraction(辗转相除求最大公约数)(CodeForcesOJ)
- JS中的作用域跟作用域链
- Vim命令详解