Building a Space Station
Time Limit: 1000MS   Memory Limit: 30000K
Total Submissions: 7469   Accepted: 3620

Description

You are a member of the space station engineering team, and are assigned a task in the construction process of the station. You are expected to write a computer program to complete the task.
The space station is made up with a number of units, called cells.
All cells are sphere-shaped, but their sizes are not necessarily
uniform. Each cell is fixed at its predetermined position shortly after
the station is successfully put into its orbit. It is quite strange that
two cells may be touching each other, or even may be overlapping. In an
extreme case, a cell may be totally enclosing another one. I do not
know how such arrangements are possible.

All the cells must be connected, since crew members should be able
to walk from any cell to any other cell. They can walk from a cell A to
another cell B, if, (1) A and B are touching each other or overlapping,
(2) A and B are connected by a `corridor', or (3) there is a cell C such
that walking from A to C, and also from B to C are both possible. Note
that the condition (3) should be interpreted transitively.

You are expected to design a configuration, namely, which pairs of
cells are to be connected with corridors. There is some freedom in the
corridor configuration. For example, if there are three cells A, B and
C, not touching nor overlapping each other, at least three plans are
possible in order to connect all three cells. The first is to build
corridors A-B and A-C, the second B-C and B-A, the third C-A and C-B.
The cost of building a corridor is proportional to its length.
Therefore, you should choose a plan with the shortest total length of
the corridors.

You can ignore the width of a corridor. A corridor is built between
points on two cells' surfaces. It can be made arbitrarily long, but of
course the shortest one is chosen. Even if two corridors A-B and C-D
intersect in space, they are not considered to form a connection path
between (for example) A and C. In other words, you may consider that two
corridors never intersect.

Input

The input consists of multiple data sets. Each data set is given in the following format.

n

x1 y1 z1 r1

x2 y2 z2 r2

...

xn yn zn rn

The first line of a data set contains an integer n, which is the number of cells. n is positive, and does not exceed 100.

The following n lines are descriptions of cells. Four values in a
line are x-, y- and z-coordinates of the center, and radius (called r in
the rest of the problem) of the sphere, in this order. Each value is
given by a decimal fraction, with 3 digits after the decimal point.
Values are separated by a space character.

Each of x, y, z and r is positive and is less than 100.0.

The end of the input is indicated by a line containing a zero.

Output

For
each data set, the shortest total length of the corridors should be
printed, each in a separate line. The printed values should have 3
digits after the decimal point. They may not have an error greater than
0.001.

Note that if no corridors are necessary, that is, if all the cells
are connected without corridors, the shortest total length of the
corridors is 0.000.

Sample Input

3
10.000 10.000 50.000 10.000
40.000 10.000 50.000 10.000
40.000 40.000 50.000 10.000
2
30.000 30.000 30.000 20.000
40.000 40.000 40.000 20.000
5
5.729 15.143 3.996 25.837
6.013 14.372 4.818 10.671
80.115 63.292 84.477 15.120
64.095 80.924 70.029 14.881
39.472 85.116 71.369 5.553
0

Sample Output

20.000
0.000
73.834
【分析】一开始Kruskal()里面是这么写的,一直WA;
void Kruskal() {
double sum=;
int num=;
int u,v;
for(int i=; i<=cnt; i++) {
u=edg[i].u;
v=edg[i].v;
if(Find(u)!=Find(v)) {
sum+=edg[i].w;
num++;
Union(u,v);
}
//printf("!!!%d %d\n",num,sum);
if(num>=n-) {
printf("%.3lf\n",sum); break;
}
}
}
后来把那个num判断去了就A了,有人知道为什么吗?
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <climits>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <vector>
#include <list>
#include<functional>
#define mod 1000000007
#define inf 0x3f3f3f3f
#define pi acos(-1.0)
using namespace std;
typedef long long ll;
const int N=;
const int M=;
struct man
{
double x,y,z,r;int num;
}a[N];
struct Edg {
int v,u;
double w;
} edg[M];
bool cmp(Edg g,Edg h) {
return g.w<h.w;
}
int n,m,maxn,cnt;
int parent[N]; void init() {
for(int i=; i<n; i++)parent[i]=i;
} void Build() {
double w;
int u,v;
for(int i=; i<n; i++) {
scanf("%lf%lf%lf%lf",&a[i].x,&a[i].y,&a[i].z,&a[i].r);
a[i].num=i;
}
for(int i=;i<n;i++)
{
for(int j=i+;j<n;j++)
{
u=a[i].num;v=a[j].num;
double ss=sqrt((a[i].x-a[j].x)*(a[i].x-a[j].x)+(a[i].y-a[j].y)*(a[i].y-a[j].y)+(a[i].z-a[j].z)*(a[i].z-a[j].z))-a[i].r-a[j].r;
edg[++cnt].u=u;edg[cnt].v=v;
if(ss>)edg[cnt].w=ss;
else edg[cnt].w=;
}
}
sort(edg,edg+cnt+,cmp);
} int Find(int x) {
if(parent[x] != x) parent[x] = Find(parent[x]);
return parent[x];
}//查找并返回节点x所属集合的根节点 void Union(int x,int y) {
x = Find(x);
y = Find(y);
if(x == y) return;
parent[y] = x;
}//将两个不同集合的元素进行合并 void Kruskal() {
double sum=;
int num=;
int u,v;
printf("!!!%d\n",cnt);
for(int i=; i<=cnt; i++) {
u=edg[i].u;
v=edg[i].v;
if(Find(u)!=Find(v)) {
sum+=edg[i].w;
num++;
Union(u,v);
}
//printf("!!!%d %d\n",num,sum);
} printf("%.3lf\n",sum);
}
int main() {
while(~scanf("%d",&n)&&n) {
cnt=-;
init();
Build();
Kruskal();
}
return ;
}

POJ2032 Building a Space Station(Kruskal)(并查集)的更多相关文章

  1. POJ - 2031 Building a Space Station 三维球点生成树Kruskal

    Building a Space Station You are a member of the space station engineering team, and are assigned a ...

  2. POJ 2031 Building a Space Station【经典最小生成树】

    链接: http://poj.org/problem?id=2031 http://acm.hust.edu.cn/vjudge/contest/view.action?cid=22013#probl ...

  3. POJ 2031 Building a Space Station (最小生成树)

    Building a Space Station Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 5173   Accepte ...

  4. POJ 2031 Building a Space Station (最小生成树)

    Building a Space Station 题目链接: http://acm.hust.edu.cn/vjudge/contest/124434#problem/C Description Yo ...

  5. POJ2031 Building a Space Station 2017-04-13 11:38 48人阅读 评论(0) 收藏

    Building a Space Station Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 8572   Accepte ...

  6. POJ 2031 Building a Space Station

    3维空间中的最小生成树....好久没碰关于图的东西了.....              Building a Space Station Time Limit: 1000MS   Memory Li ...

  7. poj 2031 Building a Space Station【最小生成树prime】【模板题】

    Building a Space Station Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 5699   Accepte ...

  8. Building a Space Station POJ - 2031

    Building a Space Station POJ - 2031 You are a member of the space station engineering team, and are ...

  9. poj 2931 Building a Space Station &lt;克鲁斯卡尔&gt;

    Building a Space Station Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 5869 Accepted: 2 ...

随机推荐

  1. 【BZOJ 4605】崂山白花蛇草水 替罪羊树套线段树

    外层是借鉴了kd-tree的替罪羊里层是线段树,插入就是正常插入+拍扁重建,查询的时候,我们就像树状数组套线段树一样操作在替罪羊中找到的线段树根节点,但是对于在kd-tree查找过程中遇到的单点,我们 ...

  2. 类名.class 类名.this 详解

    我们知道在java中,一个类在被加载的时候虚拟机就会自动的生成一个这个类的一个Class类型的“类对象”,每个类都对应着一个这样的类对象,通过这个Class类型的类对象,我们就能够使用“内省与反射”机 ...

  3. ntpq –p命令

    ntpq用来监视ntpd操作,ntpq -p查询网络中的NTP服务器,同时显示客户端和每个服务器的关系 [root@ ~]# ntpq -p remote refid st t when poll r ...

  4. 关于JAVA正则匹配空白字符的问题(全角空格与半角空格)

    今天遇到一个字符串,怎么匹配空格都不成功!!! 我把空格复制到test.properties文件 显示“\u3000” ,这是什么? 这是全角空格!!! 查了一下    \s    不支持全角 1.& ...

  5. centos配置数据源和java环境配置

    ---恢复内容开始--- 一:前言 今天送走了一位同事,看着别人走勾起了我蠢蠢欲动的心啊,但是我知道,我不能那么的任性,我是men,这几天难得的清闲,所以我就弄一弄linux,昨天把网给配通了,今天配 ...

  6. codeforces739C - Skills &&金中市队儿童节常数赛

    http://codeforces.com/problemset/problem/739/C 先上链接 这道题 对于蒟蒻的我来说还是很有难度的 调了很久 对于我的代码 mx2是答案 mx1代表单调 m ...

  7. USACO_1.1_Your_Ride_Is_Here_(字符串+水题)

    描述 http://train.usaco.org/usacoprob2?a=y0SKxY0Kc2q&S=ride 给出两个由大写字母组成,长度不大于$6$的字符串. 将字符串中的各字母的字典 ...

  8. linux下命令源码

    一般来说,不同的命令可能隶属于不同的软件包,这样就没有一个地方会有所有命令的源代码.(命令的个数也会与你所安装的软件包有关)但是,一些常用的命令,例如basename cat chgrp chmod ...

  9. WPF第三方控件盘点

    WPF统一的编程模型.语言和框架,实现了界面设计人员和开发人员工作可以分离的境界,鉴于WPF强大的优势,且一直是开发者关注的地方,下面和大家分享基于WPF项目开发需要用到的第三方控件,包括业界最受好评 ...

  10. pandas求五日线并画图

    import pandas as pd import numpy as np import matplotlib.pyplot as plt stock_data = pd.read_csv('000 ...