HDU1102Constructing Roads(MST)
来源:互联网 发布:手机上的数据处理软件 编辑:程序博客网 时间:2024/05/01 01:14
Constructing Roads
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10568 Accepted Submission(s): 3932
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
用Kruscal和prim都能过。。水题吧~~
#include <iostream>#include <cstdlib>#include <cstdio>#include <algorithm>#include <cstring>using namespace std; #define N 110int p[N];int c[N][N]; struct edge{ int a; int b; int weight; bool operator<(const edge &A) const { return weight<A.weight; }}E[5005]; int Find_set(int x){ return p[x]==x?x:p[x]=Find_set(p[x]);} void Union(int a,int b){ int x=Find_set(a); int y=Find_set(b); if(x!=y) { p[x]=y; }} int main(){ int n,m,i,j,k,a,b,ans; while(~scanf("%d",&n)) { k=1; for(i=1;i<=n;i++) { for(j=1;j<=n;j++) { scanf("%d",&c[i][j]); if(j>i) { E[k].a=i; E[k].b=j; E[k].weight=c[i][j]; k++; } } } sort(E+1,E+k+1); for(i=1;i<=n;i++) p[i]=i; scanf("%d",&m); for(i=1;i<=m;i++) { scanf("%d%d",&a,&b); Union(a,b); } ans=0; for(i=1;i<=k;i++) { if(Find_set(E[i].a)!=Find_set(E[i].b)) { Union(E[i].a,E[i].b); ans+=E[i].weight; } } printf("%d\n",ans); } return 0;}
- HDU1102Constructing Roads(MST)
- hdu1102Constructing Roads
- hdu1102Constructing Roads(prim)
- hdu1102Constructing Roads(Prime 算法求最小生成树)
- Dark roads(MST模板)
- poj 1251 Jungle Roads MST
- poj 2421 Constructing Roads MST
- POJ 3625 Building Roads【MST】
- zoj 1406 Jungle Roads(简单-MST)
- POJ 1251 Jungle Roads (zoj 1406) MST
- POJ 1251 Jungle Roads(超裸MST)
- [MST]POJ 2421&HDU 1102 Constructing Roads
- poj -- 1251 Jungle Roads(mst)
- POJ 1251 Jungle Roads (MST)
- POJ 2421 Constructing Roads (MST)
- poj 2421 Constructing Roads mst(…
- HDU 1102/POJ 2421 Constructing Roads(MST&Prim优化)
- HDU 1102 && POJ 2421 Constructing Roads (经典MST~Prim)
- Fragment详解(二)--->生命周期详解
- 在线智能培养基测试资料收集
- 也说_T、_TEXT、TEXT、L
- C#互操作的内存溢出问题
- hdu 3646 Fate Stay Night
- HDU1102Constructing Roads(MST)
- shell script: pattern match (模式识别)
- HDU1078(深搜+DP)
- 互联网的三大巨头 百度 阿里巴巴 腾讯(BAT)
- TabHost简单使用
- 通过eclipse查看Android源代码(Java)
- 生成20个1-100不重复的随机数
- sysu宿舍网络路由器分享——IPv6篇
- 链表翻转、左旋转字符串