UVa 10397 - Connect the Campus
2015-08-24 16:47
483 查看
Many new buildings are under construction on the campus of the University of Waterloo. The university has hired bricklayers, electricians, plumbers, and a computer programmer. A computer programmer? Yes, you have been hired to ensure that each building is connected to every other building (directly or indirectly) through the campus network of communication cables.
We will treat each building as a point specified by an x-coordinate and a y-coordinate. Each communication cable connects exactly two buildings, following a straight line between the buildings. Information travels along a cable in both directions. Cables can freely cross each other, but they are only connected together at their endpoints (at buildings).
You have been given a campus map which shows the locations of all buildings and existing communication cables. You must not alter the existing cables. Determine where to install new communication cables so that all buildings are connected. Of course, the university wants you to minimize the amount of new cable that you use.
Fig: University of Waterloo Campus
The first line of each test case contains the number of buildings N (1<=N<=750). The buildings are labeled from 1 to N. The next N lines give the x and y coordinates of the buildings. These coordinates are integers with absolute values at most 10000. No two buildings occupy the same point. After that there is a line containing the number of existing cables M (0 <= M <= 1000) followed by M lines describing the existing cables. Each cable is represented by two integers: the building numbers which are directly connected by the cable. There is at most one cable directly connecting each pair of buildings.
103 104
104 100
104 103
100 100
1
4 2
4
103 104
104 100
104 103
100 100
1
4 2
4.41
最小生成树问题+并查集
kruskai算法
已经连通的点就把他们合并起来
有一点需要注意,楼的编号从1开始
We will treat each building as a point specified by an x-coordinate and a y-coordinate. Each communication cable connects exactly two buildings, following a straight line between the buildings. Information travels along a cable in both directions. Cables can freely cross each other, but they are only connected together at their endpoints (at buildings).
You have been given a campus map which shows the locations of all buildings and existing communication cables. You must not alter the existing cables. Determine where to install new communication cables so that all buildings are connected. Of course, the university wants you to minimize the amount of new cable that you use.
Fig: University of Waterloo Campus
Input
The input file describes several test case. The description of each test case is given below:The first line of each test case contains the number of buildings N (1<=N<=750). The buildings are labeled from 1 to N. The next N lines give the x and y coordinates of the buildings. These coordinates are integers with absolute values at most 10000. No two buildings occupy the same point. After that there is a line containing the number of existing cables M (0 <= M <= 1000) followed by M lines describing the existing cables. Each cable is represented by two integers: the building numbers which are directly connected by the cable. There is at most one cable directly connecting each pair of buildings.
Output
For each set of input, output in a single line the total length of the new cables that you plan to use, rounded to two decimal places.Sample Input
4103 104
104 100
104 103
100 100
1
4 2
4
103 104
104 100
104 103
100 100
1
4 2
Sample Output
4.414.41
最小生成树问题+并查集
kruskai算法
已经连通的点就把他们合并起来
有一点需要注意,楼的编号从1开始
[code]#include<cstdio> #include <iostream> #include<algorithm> #include <math.h> #include <string.h> #define N 800 using namespace std; int coor [2], n, m, father ; struct Node { int x, y; double len; friend bool operator < (const Node &a, const Node &b) { return a.len < b.len; } void fun() { int a = coor[x][0] - coor[y][0]; int b = coor[x][1] - coor[y][1]; len = sqrt(a*a + b*b + 0.0); } }node[640000]; int find(int x) { if (x != father[x]) { father[x] = find(father[x]); } return father[x]; } int main() { #ifndef ONLINE_JUDGE freopen("1.txt", "r", stdin); #endif int i, j, k, a, b, t, aa, bb; double ans; while(~scanf("%d", &n)) { for (i = 1; i <= n; i++) { scanf("%d%d", &coor[i][0], &coor[i][1]); father[i] = i; } for (i = 1,k = 0; i <= n; i++) { for (j = 1; j < i; j++) { node[k].x = i; node[k].y = j; node[k].fun(); k++; } } scanf("%d", &m); for (i = 0; i < m; i++) { scanf("%d%d", &a, &b); aa = find(a); bb = find(b); if (aa != bb) { father[aa] = bb; } } sort(node, node + k); ans = 0; for (i = 0; i < k; i++) { a = find(node[i].x); b = find(node[i].y); if (a == b) { continue; } ans += node[i].len; father[a] = b; } printf("%.2lf\n", ans); } return 0; }
相关文章推荐
- WPF中GridSplitter控件的使用
- getRectSubPix函数
- 关于Android最佳性能实践——布局优化技巧学习笔记
- 黑马程序员-------Java笔记--------网络编程(UDP与TCP基本步骤)
- 请求转发和重定向
- 怎么了
- [LeedCode OJ]#136 Single Number
- Android 适配
- WPF中GridSplitter控件的使用
- oracle 对现有的表进行列表分区
- AlarmManager关掉进程后不起作用的问题
- notepad++ 批量替换技巧
- CAP定理小议
- C++中的static关键字的总结
- C++中的模板那点事
- 算法题:最长上升子序列
- 使用Xcode DEBUG模式和RELEASE模式
- MFC_解决按下回车键退出程序的问题
- java中执行删除文件操作,要关闭输入输出流
- 玩转Bootstrap(基础) -- (6.导航条基础)