ZOJ-1203 Swordfish
来源:互联网 发布:c语言二进制转 bcd码 编辑:程序博客网 时间:2024/05/18 00:47
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
————————————————————集训8.2的分割线————————————————————
思路:最小生成树,Kruskal,并查集。所有点之间都有边。水题不解释。
代码如下:
/*ID: j.sure.1PROG:LANG: C++*//****************************************/#include <cstdio>#include <cstdlib>#include <cstring>#include <algorithm>#include <cmath>#include <stack>#include <queue>#include <vector>#include <map>#include <string>#include <iostream>using namespace std;/****************************************/const int N = 105;int n, fa[N];struct Node{int u, v;double dis;}edge[N*N/2];double x[N], y[N], sum;bool cmp(Node a, Node b){return a.dis < b.dis;}int Find(int x){if(x != fa[x]) fa[x] = Find(fa[x]);return fa[x];}void Union(int x, int y, double d){int fx = Find(x), fy = Find(y);if(fx != fy) {sum += d;fa[fy] = fx;}}int main(){#ifdef J_Sure//freopen(".in", "r", stdin);//freopen(".out", "w", stdout);#endifint cas = 1; bool fir = false;while(scanf("%d", &n)!=EOF&&n) {for(int i = 0; i < n; i++) {scanf("%lf%lf", &x[i], &y[i]);}int cnt = 0;for(int i = 0; i < n; i++) {for(int j = i+1; j < n; j++) {double d = sqrt((x[i]-x[j])*(x[i]-x[j]) + (y[i]-y[j])*(y[i]-y[j]));edge[cnt].u = i; edge[cnt].v = j; edge[cnt++].dis = d;}}sort(edge, edge+cnt, cmp);sum = 0;for(int i = 0; i < n; i++) {fa[i] = i;}for(int i = 0; i < cnt; i++) {Union(edge[i].u, edge[i].v, edge[i].dis);}if(fir) puts("");fir = true;printf("Case #%d:\nThe minimal distance is: %.2f\n", cas++, sum);}return 0;}
0 0
- ZOJ 1203 Swordfish ( prim )
- zoj 1203 Swordfish(Prim!)
- zoj 1203 Swordfish【prim】
- Prim zoj 1203 Swordfish
- zoj - 1203 - Swordfish
- zoj 1203 Swordfish
- zoj 1203 Swordfish MST
- ZOJ 1203 - Swordfish
- ZOJ-1203 Swordfish
- ZOJ-1203-Swordfish
- ZOJ:1203 Swordfish
- zoj 1203 Swordfish
- ZOJ 1203 Swordfish MST
- ZOJ 1203 Swordfish
- zoj 1203 Swordfish
- ZOJ-1203 Swordfish
- zoj 1203 Swordfish
- zoj 1203 Swordfish
- java笔记8-8-1
- cocos2D-x 3.x学习笔记【5】 缓动效果
- Disjoint set(并查集) data structure
- 串口通信编程(2):使用Windows API
- 路由器端口触发与转发---Port Forwarding & Port Triggering
- ZOJ-1203 Swordfish
- LeetCode-Partition List
- 欧几里德算法(Euclidean algorithm)
- jquery操作select(取值,设置选中)
- UVA 657 The die is cast
- VB委托和事件
- 【JAVA】【SQL]留个样例
- Linux rpm 命令参数使用详解[介绍和应用]
- KiB、MiB与KB、MB的区别