POJ:2421 Constructing Roads
poj2421题目链接
Time Limit: 2000MS Memory Limit: 65536K
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
思路:
Kruskal算法基础题,应用Kruskal基础算法思想,对于边的顺序可以采用枚举的方法实现。最小生成树中每添加一条边就用并查集思想合并集合,直到所有的顶点都在同一个集合为止。
代码:
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int MAXN = 101;
int fa[MAXN], mp[MAXN][MAXN];
int find(int x) {
if (fa[x] != x)
fa[x] = find(fa[x]);
return fa[x];
}
void unionSet(int u, int v) {
fa[find(u)] = find(v);
}
int