hdu 1102 Constructing Roads
来源:互联网 发布:linux vsftpd rpm下载 编辑:程序博客网 时间:2024/06/07 07:07
Constructing Roads
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9879 Accepted Submission(s): 3675
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最小生成树,用prim算法。注意这题存图应从1开始,还有这题其实是多case输入- -AC代码:#include <iostream>#include <cstring>#include <string>#define N 105#define INF 10000000using namespace std;int map[N][N],lowcost[N],v[N];int n;int prim(){ int sum=0,m,x; for(int i=1;i<=n;i++) lowcost[i]=map[1][i]; memset(v,0,sizeof(v)); v[1]=1; for(int i=2;i<=n;i++) { m=INF; for(int j=1;j<=n;j++) if(!v[j]&&lowcost[j]<m) m=lowcost[x=j]; sum+=m; v[x]=1; for(int j=1;j<=n;j++) if(!v[j]&&map[x][j]<lowcost[j]) lowcost[j]=map[x][j]; } return sum;}int main(){ int m,a,b; while(cin>>n) {for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) map[i][j]=INF; for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) cin>>map[i][j]; cin>>m; while(m--) { cin>>a>>b; map[a][b]=map[b][a]=0; } cout<<prim()<<endl; } return 0;}
- 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
- HDU 1102 Constructing Roads
- HDU 1102 Constructing Roads
- HDU 1102 Constructing Roads
- HDU 1102 Constructing Roads
- 液晶屏测试小程序
- Dijkstra(迪杰斯特拉)算法分析与实现(C/C++)
- (转)101款web应用推荐 从思维导图到Bug跟踪(上)
- jquery 方法扩展
- 判断浏览器版本
- hdu 1102 Constructing Roads
- windows下,string 转 LPCWSTR
- 关于JVM和Java的跨平台性
- glog(Google Logging Library)
- asp删除数据时出现的问题
- 后台升级管理系统之感悟
- Python对Excel的操作 pyExcelerator
- Python模块学习 ---- threading 多线程控制和处理
- Unity3d通过苹果和google两种方法加入广告