HDOJ 题目1102Constructing Roads(简单最小生成树,kruskal)
来源:互联网 发布:程序员客栈 专职 编辑:程序博客网 时间:2024/05/22 17:00
Constructing Roads
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 14020 Accepted Submission(s): 5335
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
ac代码
#include<stdio.h>#include<string.h>#include<stdlib.h>int n,p,pre[100000];struct s{int x,y,w;}b[100010];int cmp(const void *a,const void *b){return (*(struct s *)a).w-(*(struct s *)b).w;}int find(int x){int r=x;while(r!=pre[r])r=pre[r];return r;}int ks(){int sum=0,i;for(i=0;i<p;i++){int x=b[i].x,y=b[i].y,w=b[i].w;int fa=find(x),fb=find(y);if(fa!=fb){pre[fa]=fb;sum+=w;}}return sum;}int main(){int n,m;while(scanf("%d",&n)!=EOF){int i,j,sum;p=0;for(i=1;i<=n;i++)pre[i]=i;for(i=1;i<=n;i++)for(j=1;j<=n;j++){b[p].x=i;b[p].y=j;scanf("%d",&b[p].w);p++;}scanf("%d",&m);while(m--){int a,b,fa,fb;scanf("%d%d",&a,&b);fa=find(a);fb=find(b);if(fa!=fb)pre[fa]=fb;}qsort(b,p,sizeof(b[0]),cmp);sum=ks();printf("%d\n",sum);}}
0 0
- HDOJ 题目1102Constructing Roads(简单最小生成树,kruskal)
- HDOJ题目1102Constructing Roads(最小生成树,prim)
- HDOJ 1102 Constructing Roads 最小生成树 kruskal && Prim
- Constructing Roads (最小生成树 Kruskal)
- HDU 1102 Constructing Roads(最小生成树 Kruskal算法)
- POJ 2421 Constructing Roads(最小生成树简单题目)
- HDOJ 1102 Constructing Roads(最小生成树)
- hdoj 1102 Constructing Roads 【最小生成树】
- hdoj-1102-Constructing Roads【最小生成树】
- hdoj 1102 Constructing Roads 【最小生成树】
- HDOJ 1102 Constructing Roads(最小生成树)
- hdoj Constructing Roads(最小生成树)
- HDOJ 1102 Constructing Roads(最小生成树--prime)
- HDOJ 1102 Constructing Roads (最小生成树)
- HDOJ 1102 Constructing Roads(最小生成树)
- hdu hdu 1102 Constructing Roads(最小生成树Kruskal)
- HDU 1102 Constructing Roads 最小生成树-Kruskal算法
- 【最小生成树 kruskal】 hdu 1102 Constructing Roads
- hdu 4941 Magical Forest(hash映射)
- 71道经典Android面试题和答案--重要知识点都涉及到了
- OpenCV2.4版本的camshiftdemo.cpp的详细注释
- dlmalloc 简析
- poj2777 线段树+位运算
- HDOJ 题目1102Constructing Roads(简单最小生成树,kruskal)
- 最好的微信公众平台接口
- js将js数组或者对象转换成json字符串
- 数据挖掘十大经典算法
- ajax的send方法
- java模式之装饰模式的学习
- 数据挖掘十大经典算法(1) C4.5
- 用windows Powershell 创建新文件夹 或 文件
- REACTIVECOCOA - IOS开发的新框架