【HDU】-1102-Constructing Roads(最小生成树)
来源:互联网 发布:java后端需要学什么 编辑:程序博客网 时间:2024/04/28 21:58
Constructing Roads
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 20691 Accepted Submission(s): 7903
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
题意:给了一个矩阵,可以看成 x,y 轴。如题目(1,1),(2,2),(3,3)就是自己本身,长度为0;以此类推......
#include<cstdio>#include<cstring>#include<queue>#include<stack>#include<cmath>#include<vector>#include<algorithm>using namespace std;#define CLR(a,b) memset(a,b,sizeof(a))struct node{int from,to,va;}a[5010];bool cmp(node x,node y){return x.va<y.va;}int f[110];int find(int x){if(x!=f[x])f[x]=find(f[x]);return f[x];}bool join(int x,int y){int fx=find(x);int fy=find(y);if(fx!=fy){f[fx]=fy;return true;} return false;}int main(){int n;while(~scanf("%d",&n)){for(int i=1;i<=n;i++)f[i]=i;int t,num=1;for(int i=1;i<=n;i++){for(int j=1;j<=n;j++){if(j>i)//只看一半,减少时间 {scanf("%d",&t);a[num].from=i;a[num].to=j;a[num].va=t;num++;}elsescanf("%d",&t);}}sort(a+1,a+num,cmp);int m;scanf("%d",&m);for(int i=1;i<=m;i++){int a,b;scanf("%d %d",&a,&b);//a,b 已经修建,直接连接 join(a,b); } int ant=0;num=0;for(int i=1;i<=n*(n-1)/2;i++){if(join(a[i].from,a[i].to)){ant+=a[i].va;num++;}if(num==n-1)break;}printf("%d\n",ant);}return 0;}
0 0
- 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【最小生成树】
- hdu 1102 Constructing Roads(最小生成树)
- hdu 1102 -Constructing Roads(最小生成树)
- HDU 1102 Constructing Roads(最小生成树入门)
- android studio 不识别genymotion设备
- JavaEE程序猿之hello的真相 ⑧
- TortoiseSVN Clearup failed to process the following paths * is already locked.解决方法
- 字体设计
- 查看电脑连接过的所有wifi密码
- 【HDU】-1102-Constructing Roads(最小生成树)
- Mybatis Cache 源码
- SVN中与资源库同步时报告了错误。1 中的 0 个资源已经同步
- Dynamic项目常用的分层结构和框架规范
- Android Fragment异常记录
- java native关键字
- android如何更改状态栏颜色
- tomcat 中文乱码
- [Leetcode,python] Reverse String 反转字符串