HDU1102并查集和最小生成树
来源:互联网 发布:学龄前儿童教育软件 编辑:程序博客网 时间:2024/05/23 19:57
Constructing Roads
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18668 Accepted Submission(s): 7114
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算法中,如果两条路本来就连在一起的,那么used假设还是没有用过,但是cost[i][j]都是0,就好了
给出AC代码:
prim算法
0 0
- HDU1102并查集和最小生成树
- hdu1102最小生成树
- hdu1102 最小生成树
- hdu1102 最小生成树
- hdu1102 最小生成树
- HDU1102 prim 最小生成树
- hdu1102 kruscal最小生成树
- poj1861 最小生成树和并查集的题
- HDU 1233 最小生成树和并查集
- HDU1875 并查集和最小生成树
- HDU1879 并查集和最小生成树
- HDU1301 并查集和最小生成树
- POJ1258 并查集和最小生成树
- 并查集和拓扑排序加最小生成树
- 并查集和最小生成树的总结
- 并查集与最小生成树
- 并查集模版&最小生成树
- 最小生成树kruscal+并查集
- 设置tomcat的默认jdk
- 纪念蒟蒻博客第一天
- uestc 250 windy数 【数位dp】
- 137 php 正则表达式2-反向引用
- POJ 3641 -- 快速幂运算,素数判定
- HDU1102并查集和最小生成树
- 算法训练 旅行家的预算
- 为没有web选项的eclipse添加web and JavaEE插件
- 树
- 算法练习——李白打酒
- JAVAH生成JNI头文件
- 【工作流】——如何创建流程图工作流
- Android基本架构
- cvEqualizeHist() 直方图均衡化(单通道)