ZOJ1203S wordfish
来源:互联网 发布:linux make 编辑:程序博客网 时间:2024/06/16 23:15
A world beneath what we call cyberspace.
A world protected by firewalls,
passwords and the most advanced
security systems.
In this world we hide
our deepest secrets,
our most incriminating information,
and of course, a shole lot of money.
This is the world of Swordfish.
You who has watched the movie know that Gabriel at last got the money by threatening to hang Ginger to death. Why not Gabriel go get the money himself? Because these money keep jumping, and these accounts are scattered in different cities. In order to gather up these money Gabriel would need to build money transfering tunnels to connect all these cities. Surely it will be really expensive to construct such a transfering tunnel, so Gabriel wants to find out the minimal total length of the tunnel required to connect all these cites. Now he asks you to write a computer program to find out the minimal length. Since Gabriel will get caught at the end of it anyway, so you can go ahead and write the program without feeling guilty about helping a criminal.
Input:
The input contains several test cases. Each test case begins with a line contains only one integer N (0 <= N <=100), which indicates the number of cities you have to connect. The next N lines each contains two real numbers X and Y(-10000 <= X,Y <= 10000), which are the citie's Cartesian coordinates (to make the problem simple, we can assume that we live in a flat world). The input is terminated by a case with N=0 and you must not print any output for this case.
Output:
You need to help Gabriel calculate the minimal length of tunnel needed to connect all these cites. You can saftly assume that such a tunnel can be built directly from one city to another. For each of the input cases, the output shall consist of two lines: the first line contains "Case #n:", where n is the case number (starting from 1); and the next line contains "The minimal distance is: d", where d is the minimal distance, rounded to 2 decimal places. Output a blank line between two test cases.
Sample Input:
50 00 11 11 00.5 0.50
Sample Output:
Case #1:The minimal distance is: 2.83
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#include <vector>#include <cmath>using namespace std;void kruscal(int edgeSize);const int maxn = 110;const int maxm = 51000;int gn;int Case = 0;struct point { double dx; double dy;}p[maxn];struct edge { int x, y; double w;}e[maxm];int f[maxn];double dist(double x, double y) { return sqrt(x*x + y*y);}bool cmp(const edge& a, const edge& b) { return a.w < b.w;}void build() {//建图. int i, j; int index = 0; for(i = 1; i <= gn; i++) { for(j = 1; j <= gn; j++) { if(i == j) continue; else { e[index].x = i; e[index].y = j; e[index].w = dist(p[i].dx-p[j].dx, p[i].dy-p[j].dy); index++; } } } kruscal(index);}int getfather(int x) { if(x == f[x]) return x; else return f[x] = getfather(f[x]);}void kruscal(int edgeSize) { int i; sort(e, e+edgeSize, cmp); int cnt = gn; double ans = 0.0; for(i = 1; i <= gn; i++) f[i] = i; for(i = 0; i < edgeSize; i++) { int t1 = getfather(e[i].x); int t2 = getfather(e[i].y); if(t1 != t2) { f[t1] = t2; cnt--; ans += e[i].w; } if(cnt == 1) break; } if(Case != 0) cout << endl;//注意出入输出格式. printf("Case #%d:\n", ++Case); printf("The minimal distance is: %.2lf\n", ans);}int main(){ int i; while(scanf("%d", &gn) != EOF && gn) { for(i = 1; i <= gn; i++) { scanf("%lf%lf", &p[i].dx, &p[i].dy); } build(); } return 0;}
- ZOJ1203S wordfish
- POJ 3359 Wordfish 英文少
- iOS开发之UITextField用法
- ios AutoLayout
- 摘录字dede的字符编码集转换---很好很强大
- LeetCode - Generate Parentheses
- 针对java.net包的编程题
- ZOJ1203S wordfish
- JSTL基本用法。
- js -- 动画
- C++ List的用法(整理)
- 使用 Tkprof 分析 ORACLE 跟踪文件
- UVA 473 Raucous Rockers
- android 程序错误处理全局处理
- CodeForce 339:A+B+C
- [每日一题] OCP1z0-047 :2013-08-27 WITH子句.........................................................121