D - Constructing Roads POJ - 2421
2017-08-05 19:55
344 查看
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
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
#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> using namespace std; #define ll long long int #define INF 0x3f3f3f3f const int N = 110; struct Edge { int u, v; int cap; }edge[15000]; int n, cnt, ans; int father , rk ; void addedge(int cu, int cv, int cw) { edge[cnt].u = cu; edge[cnt].v = cv; edge[cnt].cap = cw; cnt++; } void makeSet() { for (int i = 1; i <= n; i++) { father[i] = i; rk[i] = 1; } } int findSet(int x) { if (x != father[x]) { father[x] = findSet(father[x]); } return father[x]; } int cmp(Edge a, Edge b) { return a.cap<b.cap; } void Kruskal() { sort(edge, edge + cnt, cmp); for (int i = 0; i<cnt; i++) { int fx = findSet(edge[i].u); int fy = findSet(edge[i].v); if (fx == fy) continue; ans += edge[i].cap; if (rk[fx] >= rk[fy]) { father[fy] = fx; rk[fx] += rk[fy]; } else { father[fx] = fy; rk[fy] += rk[fx]; } } } int main() { while (~scanf("%d", &n)) { makeSet(); cnt = 0; int w; for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) { scanf("%d", &w); addedge(i, j, w); } int q, u, v; scanf("%d", &q); while (q--) { scanf("%d%d", &u, &v); int fx = findSet(u); int fy = findSet(v); if (rk[fx] >= rk[fy]) { father[fy] = fx; rk[fx] += rk[fy]; } else { father[fx] = fy; rk[fy] += rk[fx]; } } ans = 0; Kruskal(); printf("%d\n", ans); } return 0; }
相关文章推荐
- poj 2421 Constructing Roads MST
- poj-2421 Constructing Roads *
- poj 2421 Constructing Roads kruskal克鲁斯卡尔最小生成树
- Constructing Roads POJ - 2421 prim
- Constructing Roads POJ - 2421 prim算法
- POJ 2421 Constructing Roads Kruskal求解
- Constructing Roads poj
- poj&nbsp;2421&nbsp;Constructing&nbsp;Roads&nbsp;mst(…
- hdu1025 Constructing Roads In JGShining's Kingdom
- poj 2421-Constructing Roads(经典Prime算法)
- hdu 1025 Constructing Roads In JGShining's Kingdom(最长上升子序列nlogn算法)
- POJ 1724 ROADS
- HDU - 1025(LIS-O(nlogn)) - Constructing Roads In JGShining's Kingdom
- poj 1251 Roads
- poj--2631--Roads in the North(树的直径 裸模板)
- [ACM] hdu 1025 Constructing Roads In JGShining's Kingdom (最长递增子序列,lower_bound使用)
- POJ 1724 ROADS
- POJ2631——Roads in the North
- hdu 1025 Constructing Roads In JGShining's Kingdom (最长上升子序列)
- POJ 2421 Constructing Roads