hdu 1101 Constructing Roads 基础最小生成树★
来源:互联网 发布:java base64库 编辑:程序博客网 时间:2024/06/05 09:34
Constructing Roads
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 24088 Accepted Submission(s): 9249
Problem Description
There are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect to each other. We say two village A and B are connected, if and only if there is a road between A and B, or there exists a village C such that there is a road between A and C, and C and B are connected.
We know that there are already some roads between some villages and your job is the build some roads such that all the villages are connect and the length of all the roads built is minimum.
We know that there are already some roads between some villages and your job is the build some roads such that all the villages are connect and the length of all the roads built is minimum.
Input
The first line is an integer N (3 <= N <= 100), which is the number of villages. Then come N lines, the i-th of which contains N integers, and the j-th of these N integers is the distance (the distance should be an integer within [1, 1000]) between village i and village j.
Then there is an integer Q (0 <= Q <= N * (N + 1) / 2). Then come Q lines, each line contains two integers a and b (1 <= a < b <= N), which means the road between village a and village b has been built.
Then there is an integer Q (0 <= Q <= N * (N + 1) / 2). Then come Q lines, each line contains two integers a and b (1 <= a < b <= N), which means the road between village a and village b has been built.
Output
You should output a line contains an integer, which is the length of all the roads to be built such that all the villages are connected, and this value is minimum.
Sample Input
30 990 692990 0 179692 179 011 2
Sample Output
179
Source
kicc
Recommend
Eddy
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int pre[100003];struct data{ int First,Second,number;}a[1000003];int m[103][103];int cnt=0;void init(){ for(int i=0;i<100000;i++) pre[i]=i;}int Find(int x){ if(x!=pre[x]) return pre[x]=Find(pre[x]); return x;}void Merge(int x,int y){ int X=Find(x); int Y=Find(y); if(X!=Y) { pre[X]=Y; }}int cmp(data a,data b){ return a.number<b.number;}int main(){ int n; while(~scanf("%d",&n)) { cnt=0; init(); for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) scanf("%d",&m[i][j]); int Q; scanf("%d",&Q); while(Q--) { int x,y; scanf("%d%d",&x,&y); m[x][y]=m[y][x]=0; } for(int i=1;i<=n;i++) { for(int j=i+1;j<=n;j++) { a[cnt].Second=i; a[cnt].First=j; a[cnt].number=m[i][j]; cnt++; } } sort(a,a+cnt,cmp); int res=0,tmp_num=0; for(int i=0;i<=cnt;i++) { int X=Find(a[i].First); int Y=Find(a[i].Second); if(X!=Y) { Merge(X,Y); tmp_num++; res+=a[i].number; } if(tmp_num==n-1) { printf("%d\n",res); break; } } }}
Constructing Roads
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 24088 Accepted Submission(s): 9249
Problem Description
There are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect to each other. We say two village A and B are connected, if and only if there is a road between A and B, or there exists a village C such that there is a road between A and C, and C and B are connected.
We know that there are already some roads between some villages and your job is the build some roads such that all the villages are connect and the length of all the roads built is minimum.
We know that there are already some roads between some villages and your job is the build some roads such that all the villages are connect and the length of all the roads built is minimum.
Input
The first line is an integer N (3 <= N <= 100), which is the number of villages. Then come N lines, the i-th of which contains N integers, and the j-th of these N integers is the distance (the distance should be an integer within [1, 1000]) between village i and village j.
Then there is an integer Q (0 <= Q <= N * (N + 1) / 2). Then come Q lines, each line contains two integers a and b (1 <= a < b <= N), which means the road between village a and village b has been built.
Then there is an integer Q (0 <= Q <= N * (N + 1) / 2). Then come Q lines, each line contains two integers a and b (1 <= a < b <= N), which means the road between village a and village b has been built.
Output
You should output a line contains an integer, which is the length of all the roads to be built such that all the villages are connected, and this value is minimum.
Sample Input
30 990 692990 0 179692 179 011 2
Sample Output
179
Source
kicc
Recommend
Eddy
阅读全文
0 0
- hdu 1101 Constructing Roads 基础最小生成树★
- HDU 1102 Constructing Roads 基础最小生成树★
- HDU 1102 Constructing Roads 基础最小生成树★
- hdu 1102 Constructing Roads 最小生成树
- Constructing Roads - HDU 1102 最小生成树
- hdu 1102 Constructing Roads 最小生成树
- Constructing Roads(HDU 1102 最小生成树)
- hdu 1102 Constructing Roads 最小生成树
- HDU 1102 Constructing Roads 最小生成树
- Hdu 1102 Constructing Roads【最小生成树】
- hdu 1102 Constructing Roads(最小生成树)
- hdu 1102 Constructing Roads (最小生成树)
- HDU 1102 Constructing Roads【最小生成树】
- HDU 1102 Constructing Roads 最小生成树
- HDU 1102 Constructing Roads 最小生成树
- HDU-1102 Constructing Roads(最小生成树)
- HDU 1102 Constructing Roads 最小生成树
- HDU 1102 Constructing Roads【最小生成树】
- The tip point of programming
- iOS探索--点语法和对象初始化
- 让机器说话(文字转美女语音,擅长中英文哦),大小600K(免费下载)!
- java怎么调用远程服务器上的shell脚本 二参数调用远程
- java系统高并发解决方案
- hdu 1101 Constructing Roads 基础最小生成树★
- C语言学习三:整型类型
- H
- AFNetworking 3.0 源码解读(四)之 AFURLResponseSerialization
- arcgis 10.3发布要素服务(FeatureService)
- linux下查看mysql有哪些进程访问
- 项目中 List 查询结果缓存说明
- 目前认为最完美的单例
- Android 集成facebook 登录和分享