hdu1102:Constructing Roads(prime)
来源:互联网 发布:以房养老骗局 知乎 编辑:程序博客网 时间:2024/05/22 00:25
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最小生成树简单题,由于题目输入数据给的是邻接矩阵,所以prime算法模板走起#include<stdio.h>#include<string>#define inf 9999999int map[105][105];int vis[105],di[105];int n;int pri(){int i,j,min,pos,ans=0;memset(vis,0,sizeof(vis));for(i=1;i<=n;i++)di[i]=map[1][i];vis[1]=1;//di[1]=inf;for(i=1;i<n;i++){min=inf;for(j=1;j<=n;j++)if(!vis[j]&&di[j]<min){min=di[j];pos=j;}vis[pos]=1;ans+=min;for(j=1;j<=n;j++)if(!vis[j]&&map[pos][j]<di[j])di[j]=map[pos][j];}return ans;}int main(){int m;while(~scanf("%d",&n)){int i,j;for(i=1;i<=n;i++)for(j=1;j<=n;j++)scanf("%d",&map[i][j]);scanf("%d",&m);int a,b;while(m--){scanf("%d%d",&a,&b);map[a][b]=map[b][a]=0;}printf("%d\n",pri());}return 0;}
0 0
- hdu1102:Constructing Roads(prime)
- Constructing Roads hdu1102
- Constructing roads(HDU1102)
- hdu1102 Constructing Roads
- HDU1102 Constructing Roads
- Constructing Roads hdu1102 kruskal
- HDU1102--Constructing Roads
- hdu1102 Constructing Roads
- HDU1102 Constructing Roads【Prim】
- HDU1102---Constructing Roads
- HDU1102 Constructing Roads
- HDU1102 Constructing Roads
- HDU1102-Constructing Roads
- HDU1102&&POJ2421 Constructing Roads
- HDU1102 Constructing Roads (Kruskal)
- hdu1102 Constructing Roads
- hdu1102 Constructing Roads(prim)
- 7.22 T hdu1102 Constructing Roads
- 百度地图URI API,调用位置、导航模块,移动端
- android--友盟自动更新配置说明
- 构建模式
- 接口初步理解
- 史上最全的iOS面试题及答案
- hdu1102:Constructing Roads(prime)
- 博客园精华集
- android之【代码实现ImageView图片切换】
- 项目所用技术回顾之excel导入(基于poi)
- sql 中 case when 超炫语法
- SOA、ESB、WebService解释
- ios--时间格式化--NSDateFormatter
- MySQl安装全解
- Redis 3.0集群搭建/配置/FAQ - RichardParker