hdu 1102
来源:互联网 发布:淘宝买快排被查 编辑:程序博客网 时间:2024/05/02 11:22
链接:http://acm.hdu.edu.cn/showproblem.php?pid=1102
Constructing Roads
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 12221 Accepted Submission(s): 4650
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.
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.
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
3 0 990
692 990 0
179 692 179
0 1 1 2
Sample Output
179
思路:直接用prim算法即可,但建好的路赋map[i][j]=map[j][i]=0表示已连通
代码:
#include<iostream>#include<cstring>#include<cstdio>using namespace std;const int maxn=105;const int inf=1<<20;int n,q;int total;int dis[maxn],map[maxn][maxn];bool used[maxn];void prim(){ used[1]=1; for(int i=2;i<=n;i++ ) dis[i]=map[1][i]; int k,min; for(int i=1;i<n;i++)//n-1次循环,注意!N个城镇,n-1次比较循环 { min=inf; for(int j=1;j<=n;j++) if(!used[j]&&dis[j]<min) { min=dis[j]; k=j; } used[k]=1; total+=min; for(int j=1;j<=n;j++) { if(!used[j]&&map[k][j]<dis[j]) dis[j]=map[k][j]; } }}int main(){ //freopen("in.txt","r",stdin); while(cin>>n) { total=0; memset(used,0,sizeof(used)); for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) cin>>map[i][j]; cin>>q; int x1,x2; for(int i=1;i<=q;i++) { cin>>x1>>x2; map[x1][x2]=map[x2][x1]=0; } prim(); cout<<total<<endl; } return 0;}
- hdu 1102
- HDU 1102
- HDU 1102
- hdu 1102
- hdu 1102
- HDU 1102
- hdu 1102
- hdu 1102
- hdu 1102
- HDU 1102
- HDU 1102
- HDU 1102
- hdu 1102
- hdu 1102
- HDU 1102 Constructing Roads
- HDU 1102 Constructing Roads
- hdu 1102(prime 算法)
- hdu 1102 kruskal
- C联合
- 黑马程序员_总结16-java基础加强3
- Expert SP2010 Practices--第一章节--工作流
- 搭建wamp+eclipse开发环境
- 不知道怎么学习编程
- hdu 1102
- Acceierated C++ 习题解答 第8章
- 写第一篇论文(nash bargain)的坎坷历程
- 小白的mysql入门
- 虔诚的学习者 腾讯技术类校园招聘笔试试题
- 搭建cocos2d-x-andriod开发环境遇到的各种问题
- VB.NET关于接口
- Construct Binary Tree from Preorder and Inorder Traversal
- 虔诚的学习者 腾讯2013年实习生笔试题