HDUOJ---1102Constructing Roads
Constructing Roads
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 12173 Accepted Submission(s): 4627
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
Source
最小生成树....
代码:
1 //最小生成树....
2 //@Gxjun coder
3 #include<stdio.h>
4 #include<string.h>
5 const int inf=0x3f3f3f3f ,v=1001;
6 int vis[v],lowc[v];
7 int sta[v][v];
8 int prim(int cost[][v],int n)
9 {
10 int i,j,p;
11 int minc,res=0;
12 memset(vis , 0 , sizeof(vis));
13 vis[0]=1;
14 for(i=1 ; i<n ;i++)
15 lowc[i]=cost[0][i];
16 for(i=1;i<n;i++)
17 {
18 minc=inf;
19 p=-1;
20 for(j=0 ; j<n ;j++)
21 {
22 if(0==vis[j] && minc>lowc[j])
23 {
24 minc=lowc[j];
25 p=j;
26 }
27 }
28 if(inf==minc) return -1; //原图不连通
29 res+=minc ;
30 vis[p]=1;
31 for(j=0; j<n ;j++)
32 {
33 if(0==vis[j] && lowc[j]>cost[p][j])
34 lowc[j]=cost[p][j];
35 }
36 }
37 return res;
38 }
39
40 int main()
41 {
42 int tol,res,i,j;
43 while(scanf("%d",&tol)!=EOF)
44 {
45 for(i=0;i<tol;i++)
46 {
47 for(j=0; j<tol;j++)
48 {
49 scanf("%d",&sta[i][j]);
50 }
51 }
52 scanf("%d",&res);
53 int num1,num2;
54 for(i=0;i<res;i++)
55 {
56 scanf("%d%d",&num1,&num2);
57 sta[num1-1][num2-1]=sta[num2-1][num1-1]=0;
58 }
59 printf("%dn",prim(sta,tol));
60 }
61 return 0;
62 }
- SMB共享之SCF文件攻击解析
- JavaScript之arguements对象学习
- 让我们一起写出更有效的CSharp代码吧,少年们!
- SQL学习之计算字段的用法与解析
- JavaScript之JS的执行环境和作用域
- GOF设计模式快速学习
- JavaScript之面向对象学习一
- JavaScript之JS实现动画效果
- 深入入门系列--Data Structure--04树
- SQL学习之高级联结(自联结、自然联结、外联接)
- ExtJs学习笔记(21)-使用XTemplate结合WCF显示数据
- JavaScript之面向对象的概念,对象属性和对象属性的特性简介
- 快速入门系列--WebAPI--04在老版本MVC4下的调整
- SQL学习之SELECT子句顺序
- JavaScript 教程
- JavaScript 编辑工具
- JavaScript 与HTML
- JavaScript 与Java
- JavaScript 数据结构
- JavaScript 基本数据类型
- JavaScript 特殊数据类型
- JavaScript 运算符
- JavaScript typeof 运算符
- JavaScript 表达式
- JavaScript 类型转换
- JavaScript 基本语法
- JavaScript 注释
- Javascript 基本处理流程
- Javascript 选择结构
- Javascript if 语句
- Javascript if 语句的嵌套
- Javascript switch 语句
- Javascript 循环结构
- Javascript 循环结构实例
- Javascript 跳转语句
- Javascript 控制语句总结
- Javascript 函数介绍
- Javascript 函数的定义
- Javascript 函数调用
- Javascript 几种特殊的函数
- JavaScript 内置函数简介
- Javascript eval() 函数
- Javascript isFinite() 函数
- Javascript isNaN() 函数
- parseInt() 与 parseFloat()
- escape() 与 unescape()
- Javascript 字符串介绍
- Javascript length属性
- javascript 字符串函数
- Javascript 日期对象简介
- Javascript 日期对象用途
- Date 对象属性和方法
- Javascript 数组是什么
- Javascript 创建数组
- Javascript 数组赋值与取值
- Javascript 数组属性和方法
- 【C语言简单说】六:取模运算符以及变量的扩展
- 【C语言简单说】七:自定义函数(1)
- 【C语言简单说】七:自定义函数(2)
- 【C语言简单说】七:自定义函数(3)
- 【C语言简单说】八:分支结构之if(1)
- 【C语言简单说】八:分支结构之if...else...(2)
- 【C语言简单说】八:分支结构之if...else if()...else...(3)
- 【C语言简单说】九:输入
- 【C语言简单说】十:小结
- 【C语言简单说】十一:switch 补
- 【C语言简单说】十二:逻辑运算符&&
- 【C语言简单说】十三:逻辑运算符||
- 【C语言简单说】十三:变量的生命周期
- 【C语言简单说】十四:for循环
- 【C语言简单说】十五:while循环