杭电1102 Constructing Roads
来源:互联网 发布:手机如何联系淘宝小二 编辑:程序博客网 时间:2024/04/30 20:52
Constructing Roads
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13518 Accepted Submission(s): 5128
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.
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.
30 990 692990 0 179692 179 011 2
179
这道题也是用的最小生成树做的
代码:
#include<stdio.h>
#include<string.h>
#define INF 1 << 30
int map[101][101] ;
int dis[101] ;
int used[101] ;
void prim( int N )
{
for(int k = 1 ; k <= N ; k++)
{
dis[k] = map[1][k] ;
used[k] = 0 ;
}
int sum = 0 ;
for(int i = 1 ; i <= N ; i++ )
{
int min = INF ;
int c = 0 ;
for(int j = 1 ; j <= N ; j++ )
{
if(!used[j] && dis[j] < min )
{
min = dis[j] ;
c = j ;
}
}
used[c] = 1 ;
for(j = 1 ; j <= N ; j++)
{
if(!used[j] && dis[j] > map[c][j])
dis[j] = map[c][j] ;
}
}
for(i = 1 ; i <= N ; i++)
sum += dis[i] ;
printf("%d\n", sum);
}
int main()
{
int N = 0 ;
while(~scanf("%d" , &N))
{
memset(map , 0 , sizeof(map) ) ;
for(int i = 1 ; i <= N ; i++)
{
for(int j = 1 ; j <= N ; j++)
{
scanf("%d" , &map[i][j]) ;
}
}
int Q = 0 ;
scanf("%d" , &Q) ;
int x = 0 , y = 0 ;
for( int m = 1 ; m <= Q ; m++ )
{
scanf("%d%d" , &x , &y ) ;
map[x][y] = map[y][x] = 0 ;//已经建好的树不用再建了
}
prim( N ) ;
}
return 0 ;
}
- 杭电1102 Constructing Roads
- 杭电1102Constructing Roads
- 【杭电】[1102]Constructing Roads
- 杭电Hdu 1102 Constructing Roads
- 行电1102 Constructing Roads
- 【最小生成树+Prim】杭电 hdu 1102 Constructing Roads
- 杭电--1102--Constructing Roads--并查集
- 杭电1102 Constructing Roads(最小生成树)
- 杭电 hdu 1102 Constructing Roads (最小生成树)
- Constructing Roads HDU杭电1102【Kruscal || Prim】
- 杭电 1102 Constructing Roads 【最小生成树&&Kruskal】
- 杭电OJ 1102(Constructing Roads)解题报告
- 杭电-1102Constructing Roads(最小生成树)
- 杭电1102Constructing Roads(kruskal算法)
- 航电1102-Constructing Roads (prim)
- 杭电ACM1102——Constructing Roads
- 杭电1102Constructing Roads(kruskal)(最小生成树)
- 【杭电oj】1102 - Constructing Roads(畅通工程,最小生成树)
- 认识WebGL
- codeforces #257 C题Jzzhu and Chocolate
- 34 韩信点兵
- JSP邮编区号管理系统
- 【LeetCode】【Python题解】Reverse Integer
- 杭电1102 Constructing Roads
- [C/C++标准库]_[初级]_[使用std::sort排序各种类型数据]
- 36 最长公共子序列
- Cocos2d-x中的文件读取操作
- Android中ListView的各种显示效果
- hdu 1032--3n+1
- 制作不暴露源码的Android Library Project
- 37 回文字符串
- 从 "specified with /SECTION option does not exist" 说开