HDU 1102 Constructing Roads (最小生成树 Prim算法)
来源:互联网 发布:adobe flash cs6 mac 编辑:程序博客网 时间:2024/05/17 02:34
Constructing Roads
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 24869 Accepted Submission(s): 9583
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
思路:将已经修好了的路的权值设置为0.
AC代码:
#include<cstdio>#include<algorithm>#include<cstring>using namespace std;const int INF = 1e7;const int maxn = 100 + 10;int w[maxn][maxn];int d[maxn];int vist[maxn];int N;void Prim(){ memset(vist,0,sizeof(vist)); for(int i = 2; i <= N; i++) d[i] = w[1][i]; vist[1] = 1; int sum = 0; for(int i = 2; i <= N; i++){ int Min = INF , tmp; for(int j = 1; j <= N; j++){ if(!vist[j] && Min > d[j]){ Min = d[j]; tmp = j;} } vist[tmp] = 1; sum += Min; for(int i = 1; i <= N; i++){ if(tmp != i && d[i] > w[tmp][i]) d[i] = w[tmp][i]; } } printf("%d\n",sum);}int main(){while(scanf("%d",&N) == 1){for(int i = 1; i <= N; i++){for(int j = 1; j <= N; j++){scanf("%d",&w[i][j]);}} int Q; scanf("%d",&Q); for(int i = 1; i <= Q; i++){ int a,b; scanf("%d%d",&a,&b); w[a][b] = 0; w[b][a] = 0;}Prim();}return 0;}
阅读全文
0 0
- 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求最小生成树)
- hdu 1102 Constructing Roads(Prim最小生成树)
- 【最小生成树+Prim】杭电 hdu 1102 Constructing Roads
- hdu-1102 Constructing Roads(prim最小生成树)
- hdu 1102 Constructing Roads(最小生成树 Prim)
- hdu 1102 Constructing Roads(最小生成树prim)
- hdu 1102 Constructing Roads 最小生成树prim模板题
- HDU 1102 Constructing Roads(最小生成树 Kruskal算法)
- hdu 1102 Constructing Roads 最小生成树Prim算法AC 水~~~
- HDOJ题目1102Constructing Roads(最小生成树,prim)
- HDU 1102 Constructing Roads(Prim算法)
- hdu1102 Constructing Roads (最小生成树 prim 算法)
- velocity制作pdf
- 添加网站(虚拟主机)
- git .gitignore规则及取消追踪已追踪文件
- Storm架构基础之ApacheStorm计算模型详解与实战
- ImportError: No module named matplotlib.pyplot
- HDU 1102 Constructing Roads (最小生成树 Prim算法)
- 27.开源项目--git恢复已删除分支的提交
- HDOJ2111 Saving HDU(背包问题)
- iOS开发之UI篇(4)—— 触摸事件
- Jzoj4743 积木
- 搜索算法
- JDBC简单工作原理
- 51单片机实验 2017年11月22日
- HDU 1671 Phone List(字典树)