【hdu】 Constructing Roads (prim)
来源:互联网 发布:自动开关机的软件 编辑:程序博客网 时间:2024/05/20 17:40
Constructing Roads
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 14 Accepted Submission(s) : 10
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
// 1122.cpp : 定义控制台应用程序的入口点。//#include "stdafx.h"#include<cstdio>#include<cstring>#define INF 0xffffffint map[105][105];int visit[105],dis[105],sum,N;void prim(){memset(visit,false,sizeof(visit));int i,j;for(i=2;i<=N;i++)dis[i]=map[1][i];dis[1]=0;visit[1]=true;for(i=1;i<=N;i++){int k,tmp=INF;for(j=1;j<=N;j++)if(!visit[j]&&dis[j]<tmp)tmp=dis[k=j];if(tmp==INF) break;visit[k]=true;sum+=dis[k]; //此处多一个记录总权值for(j=1;j<=N;j++){if(!visit[j]&&dis[j]>map[k][j]) // 此处不同于dijkstradis[j]=map[k][j];}}}int main(){int M,i,j;while(scanf("%d",&N)!=EOF){for(i=1;i<=N;i++) for(j=1;j<=N;j++) scanf("%d",&map[i][j]);scanf("%d",&M); int a,b;for(i=0;i<M;i++){scanf("%d%d",&a,&b);map[a][b]=map[b][a]=0;}sum=0;prim();printf("%d\n",sum);}return 0;}
- 【hdu】 Constructing Roads (prim)
- HDU-#1102 Constructing Roads(Prim & Kruskal)
- hdu 1102 Constructing Roads(prim)
- hdu 1102 Constructing Roads(Prim)
- HDU 1102 Constructing Roads(Prim算法)
- HDU-1102 Constructing Roads(prim)
- HDU 1102 Constructing Roads(prim)
- hdu1102 Constructing Roads(prim)
- HDU 1102 && POJ 2421 Constructing Roads (经典MST~Prim)
- HDU - 1102 - Constructing Roads (最小生成树--prim算法!!)
- HDU 1102 Constructing Roads(Prim求最小生成树)
- HDU-1102 Constructing Roads(最小生成树[Prim])
- HDU 1102 Constructing Roads(最小生成树-Prim)
- hdu 1102 Constructing Roads(最小生成树,prim)
- HDU 1102 Constructing Roads(prim求最小生成树)
- HDU 1102 Constructing Roads (最小生成树 Prim算法)
- Prim 算法, hdu 1102 Constructing Roads
- hdu 1102 Constructing Roads (prim 、kruskal)
- 人件--读书笔记4
- HDU 1006
- 分布式系统的理解
- Oralce SQL语言常用函数(三)日期函数
- s3c2440的lcd原理及编程是实现
- 【hdu】 Constructing Roads (prim)
- 英文单词个数统计(从多到少排序)
- 学习 数据库索引index
- WebKit在gcc编译器下出现的乱序优化bug
- 浅谈VB程序设计中的数据库应用
- 字符串常量放在静态存储区
- pku 2528
- UVALive 4302 Toll Road
- Activity. Intent. Service. Broadcast的使用