HDU 1102 Constructing Roads(Kruskal)
来源:互联网 发布:百分百邮件营销软件 编辑:程序博客网 时间:2024/06/05 19:26
Constructing Roads
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 19432 Accepted Submission(s): 7404
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#include <iostream>#include <string.h>#include <stdlib.h>#include <algorithm>#include <math.h>using namespace std;int n;int a;int q;int b,c;struct Node{ int x; int y; int w;}edge[105*105];int father[105];int cmp(Node a,Node b){ return a.w<b.w;}int find(int x){ if(x!=father[x]) x=find(father[x]); return x;}int main(){ while(scanf("%d",&n)!=EOF) { for(int i=1;i<=n;i++) father[i]=i; int cot=0; for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) { scanf("%d",&a); if(i==j) continue; edge[cot].x=i; edge[cot].y=j; edge[cot++].w=a; } scanf("%d",&q); for(int i=1;i<=q;i++) { scanf("%d%d",&b,&c); b=find(b); c=find(c); father[b]=c; } sort(edge,edge+cot,cmp); int ans=0; for(int i=0;i<cot;i++) { int xx=edge[i].x; int yy=edge[i].y; xx=find(xx); yy=find(yy); if(xx!=yy) { ans+=edge[i].w; father[xx]=yy; } } printf("%d\n",ans); }}
0 0
- hdu 1102 kruskal Constructing Roads
- HDU 1102 Constructing Roads(Kruskal)
- acm hdu 1102 Constructing Roads(kruskal)
- hdu 1102 Constructing Roads (prim 、kruskal)
- HDU-#1102 Constructing Roads(Prim & Kruskal)
- hdu 1102 Constructing Roads(Kruskal算法)
- HDU 1102:Constructing Roads【Kruskal & Prim】
- hdu 1102 Constructing Roads(kruskal || prim)
- HDU:1102 Constructing Roads(kruskal)
- HDU 1102 Constructing Roads (kruskal)
- hdu hdu 1102 Constructing Roads(最小生成树Kruskal)
- HDU 1102 Constructing Roads 最小生成树-Kruskal算法
- 【最小生成树 kruskal】 hdu 1102 Constructing Roads
- hdu 1102 Constructing Roads 最小生成树Kruskal
- hdu-1102-Constructing Roads-最小生成树,Kruskal算法
- HDU 1102 Constructing Roads(最小生成树 Kruskal算法)
- HDU 1102 Constructing Roads (最小生成树,kruskal)
- HDU 1102 Constructing Roads
- 源代码设计、实现、源代码控制
- iOS动画的暂停与恢复
- Problem 1027
- UE4:c++中添加碰撞事件
- CentOS 7安装gVim
- HDU 1102 Constructing Roads(Kruskal)
- HDU4177 Avoiding a disaster
- Select Distinct
- bzoj 3738: [Ontak2013]Kapitał 数论
- linux
- hdu 1269 迷宫城堡 Tarjan算法
- CSS display 属性
- sqlite、mysql和postgresql对比
- linux命令大全