POJ2032 Building a Space Station(Kruskal)(并查集)
Time Limit: 1000MS | Memory Limit: 30000K | |
Total Submissions: 7469 | Accepted: 3620 |
Description
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
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
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)(并查集)的更多相关文章
- 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 ...
- POJ 2031 Building a Space Station【经典最小生成树】
链接: http://poj.org/problem?id=2031 http://acm.hust.edu.cn/vjudge/contest/view.action?cid=22013#probl ...
- POJ 2031 Building a Space Station (最小生成树)
Building a Space Station Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 5173 Accepte ...
- POJ 2031 Building a Space Station (最小生成树)
Building a Space Station 题目链接: http://acm.hust.edu.cn/vjudge/contest/124434#problem/C Description Yo ...
- 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 ...
- POJ 2031 Building a Space Station
3维空间中的最小生成树....好久没碰关于图的东西了..... Building a Space Station Time Limit: 1000MS Memory Li ...
- poj 2031 Building a Space Station【最小生成树prime】【模板题】
Building a Space Station Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 5699 Accepte ...
- Building a Space Station POJ - 2031
Building a Space Station POJ - 2031 You are a member of the space station engineering team, and are ...
- poj 2931 Building a Space Station <克鲁斯卡尔>
Building a Space Station Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 5869 Accepted: 2 ...
随机推荐
- vector创建2维数组
以前我要建立一个二维数组,总是使用 int N=5, M=6; vector<vector<int> > Matrix(N); for(int i =0; i< Matr ...
- 从零开始学习MXnet(三)之Model和Module
在我们在MXnet中定义好symbol.写好dataiter并且准备好data之后,就可以开开心的去训练了.一般训练一个网络有两种常用的策略,基于model的和基于module的.今天,我想谈一谈他们 ...
- POJ1308:Is It A Tree?(并查集)
Is It A Tree? 题目链接:http://poj.org/problem?id=1308 Description: A tree is a well-known data structure ...
- namesilo注册域名用来做域名邮箱
重要的话说三遍: (一定不要再国内注册域名,不要买国内的空间) (一定不要再国内注册域名,不要买国内的空间) (一定不要再国内注册域名,不要买国内的空间) 使用的是腾讯企业邮箱,有一个缺点:不支持自定 ...
- 通过设置nginx的client_max_body_size解决nginx+php上传大文件的问题
通过设置nginx的client_max_body_size解决nginx+php上传大文件的问题:用nginx来做webserver的时,上传大文件时需要特别注意client_max_body_si ...
- 学习正则表达式及c#应用
1.0正则表达式语法 正则表达式是一种文本模式,包括普通字符(例如,a 到 z 之间的字母)和特殊字符(称为“元字符”).模式描述在搜索文本时要匹配的一个或多个字符串. 正则表达式示例 表达式 ...
- 【BZOJ1996】【HNOI2010】合唱队 [区间DP]
合唱队 Time Limit: 4 Sec Memory Limit: 64 MB[Submit][Status][Discuss] Description Input Output Sample ...
- kdtree学习记录
[转载请注明来自 Galaxies的博客:http://cnblogs.com/galaxies] 这篇文章当做一个记录啦qwq 参考:<K-D Tree在信息学竞赛中的应用>(n+e, ...
- codevs 3305 水果姐逛水果街Ⅱ&&codevs3006
题目描述 Description 水果姐第二天心情也很不错,又来逛水果街. 突然,cgh又出现了.cgh施展了魔法,水果街变成了树结构(店与店之间只有一条唯一的路径). 同样还是n家水果店,编号为1~ ...
- 【BZOJ】1604: [Usaco2008 Open]Cow Neighborhoods 奶牛的邻居
[算法]并查集+平衡树+数学+扫描线 [题解] 经典曼哈顿距离转切比雪夫距离. 曼哈顿距离:S=|x1-x2|+|y1-y2|<=c 即:max(x1-x2+y1-y2,x1-x2-y1+y2, ...