hdoj-3371-Connect the Cities【最小生成树】
来源:互联网 发布:sql查询每小时 编辑:程序博客网 时间:2024/06/06 12:33
Connect the Cities
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13299 Accepted Submission(s): 3618
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
Author
dandelion
Source
HDOJ Monthly Contest – 2010.04.04
Recommend
lcy | We have carefully selected several similar problems for you:1301 2544 1598 2066 1874
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;struct graph{int a;int b;int cost;}G[ 25005];int root[505];int n,m;int find(int i){if(root[i]==i) return i;return root[i]=find(root[i]);}void unio(int i,int j){int t=find(i);int k=find(j);if(t<=k) root[k]=t;else root[t]=k;return ;}int cmp(graph u,graph v){return u.cost<v.cost;}int shortest;void kruskal(){sort(G,G+m,cmp); int i,t,k;shortest=0;for(i=0;i<m;++i){t=find(G[i].a); k=find(G[i].b);if(t!=k){unio(t,k);shortest+=G[i].cost;}}return ;}int main(){int T;scanf("%d",&T);while(T--){int k,i,j,p,q,c,t,x,y;scanf("%d%d%d",&n,&m,&k);for(i=1;i<=n;++i) root[i] = i;for(i=0;i<m;++i){scanf("%d%d%d",&p,&q,&c);G[i].a=p,G[i].b=q,G[i].cost=c;}for(i=1;i<=k;++i){scanf("%d",&t);scanf("%d%d",&x,&y);unio(x,y);for(j=3;j<=t;++j){scanf("%d",&y);unio(x,y);}}kruskal();int nu=0;for(i=1;i<=n;++i){if(find(i)==i) nu++;}if(nu>1) printf("-1\n");else printf("%d\n",shortest);}return 0;}
0 0
- HDOJ 题目3371Connect the Cities(最小生成树)
- hdoj-3371-Connect the Cities【最小生成树】
- HDOJ 3371 Connect the Cities(最小生成树--prime 水)
- hdu3371 Connect the Cities (最小生成树)
- HDU_3371 Connect the cities(最小生成树)
- Connect the Cities 【最小生成树】
- hdu 3371 Connect the Cities(最小生成树)
- hdu 3371 Connect the Cities 最小生成树(kruskal算法)
- HDU 3371 Connect the Cities(最小生成树)
- hdu 3371 最小生成树Connect the Cities
- hdu oj 3371 Connect the Cities (最小生成树)
- hdu 3371 Connect the Cities(最小生成树))
- HDU 3371 Connect the Cities 最小生成树
- HDU 3371 Connect the Cities 【最小生成树】
- hdu 3371(Connect the Cities)(最小生成树)
- hdu 3371 Connect the Cities(最小生成树kruskal)
- hdu 3371 Connect the Cities 最小生成树
- hdu 3371 Connect the Cities 最小生成树prim
- Leetcode: Sliding Window Maximum
- Leetcode Q3:Longest Substring Without Repeating Characters
- word左边左对齐,右边右对齐
- mysql mysql SELECT 自增数显示
- windows系统突然死机,windows系统重新启动后,再启动虚拟机,发现ubuntu系统进入进入initramfs,输入exit都无法退出
- hdoj-3371-Connect the Cities【最小生成树】
- Mysql语法及使用命令总结
- Ubuntu14.04 root登录 ssh 连接
- 小白学习freemark的过程(代码全贴+详细介绍)
- 【用户界面:android-Ultra-Pull-To-Refresh】之一:android-Ultra-Pull-To-Refresh开篇
- REHL LINUX 配置本地yum源的方法
- pcl中遇到的问题
- vim 中文乱码解决办法
- 瑞年平年