HDU3371 并查集与最小生成树(判断有无生成树)
来源:互联网 发布:淘宝中的延长收货 编辑:程序博客网 时间:2024/05/02 05:58
Connect the Cities
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 15073 Accepted Submission(s): 4037
Problem Description
In 2100, since the sea level rise, most of the cities disappear. Though some survived cities are still connected with others, but most of them become disconnected. The government wants to build some roads to connect all of these cities again, but they don’t want to take too much money.
Input
The first line contains the number of test cases.
Each test case starts with three integers: n, m and k. n (3 <= n <=500) stands for the number of survived cities, m (0 <= m <= 25000) stands for the number of roads you can choose to connect the cities and k (0 <= k <= 100) stands for the number of still connected cities.
To make it easy, the cities are signed from 1 to n.
Then follow m lines, each contains three integers p, q and c (0 <= c <= 1000), means it takes c to connect p and q.
Then follow k lines, each line starts with an integer t (2 <= t <= n) stands for the number of this connected cities. Then t integers follow stands for the id of these cities.
Each test case starts with three integers: n, m and k. n (3 <= n <=500) stands for the number of survived cities, m (0 <= m <= 25000) stands for the number of roads you can choose to connect the cities and k (0 <= k <= 100) stands for the number of still connected cities.
To make it easy, the cities are signed from 1 to n.
Then follow m lines, each contains three integers p, q and c (0 <= c <= 1000), means it takes c to connect p and q.
Then follow k lines, each line starts with an integer t (2 <= t <= n) stands for the number of this connected cities. Then t integers follow stands for the id of these cities.
Output
For each case, output the least money you need to take, if it’s impossible, just output -1.
Sample Input
16 4 31 4 22 6 12 3 53 4 332 1 22 1 33 4 5 6
Sample Output
1
最近真的是被自己蠢哭了。。。输入时候的输入顺序弄错了害我WA了无数次。
判断有没有全部连接在一起。要么就是看看边的个数和顶点个数的是不是满足 边 = 顶点 - 1的公式。或者我个人的想法就是看看第一个顶点(题目意思就是第一个顶点一定存在),和其他顶点有没有连成一片就好了。
给出AC代码(一定要用G++交,C++TLE了)
0 0
- HDU3371 并查集与最小生成树(判断有无生成树)
- Hdu3371【最小生成树】
- hdu3371之最小生成树
- 并查集与最小生成树
- 最小生成树与并查集
- 最小生成树与并查集
- 最小生成树(并查集)
- 最小生成树(并查集)
- 并查集(最小生成树)
- hdu3371 Connect the Cities (最小生成树)
- HDU3371-最小生成树-Kruskal-Prim
- hdu3371 prim算法求最小生成树
- HDU3371(Connect the Cities)最小生成树
- 并查集与kruskal最小生成树
- HDU1863 并查集与最小生成树
- 并查集模版&最小生成树
- 最小生成树kruscal+并查集
- 并查集+最小生成树_HDU_1102
- 张正友标定论文翻译(2)
- 找出升序数组中和为给定值的两个数字
- iPhone屏幕像素 分辨率 xcode中的逻辑宽高的介绍以及strcut与class的区别
- HDU 4560解题报告
- 华为机试题:整数排序
- HDU3371 并查集与最小生成树(判断有无生成树)
- segfault at xxx rip xxx rsp xxx error 4
- WebKit之V8编写简单demon
- C语言 求一个数列的前n项之和,保留两位小数。
- win7下安装/卸载VirtualBox时出错
- MFC下ADO访问ACCESS插入日期
- cocos2d-x核心概念(四)——动作,动画
- mac升级到10.11.3后CocoaPods不可用的解决办法
- Check the existence of public synonyms Remove the public synonyms