poj2031-Building a Space Station(最小生成树,kruskal,prime)

Building a Space Station

Time Limit: 1000MS   Memory Limit: 30000K
Total Submissions: 5874   Accepted: 2914

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

poj2031-Building a Space Station(最小生成树,kruskal,prime)

时间: 2024-10-13 21:17:59

poj2031-Building a Space Station(最小生成树,kruskal,prime)的相关文章

poj2031(Building a Space Station)

题目地址:Building a Space Station 题目大意: 在一个三维的空间里有若干个球体,求从走过所有球花费最少,题目要求两个球体接触就不需要建桥意为花费为0,实力给吃的n行, 其中包括 球的X,Y,Z的坐标,r为球的半径.这里就清晰了,意思就是求无向图最小生成树,val就为两个求圆心的距离减去两个球的半径. 解题思路: 建图,dijstra求最小生成树,记住双向的和eps处理精度. 代码: 1 #include <algorithm> 2 #include <iostre

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

Building a Space Station Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 5173   Accepted: 2614 Description You are a member of the space station engineering team, and are assigned a task in the construction process of the station. You ar

POJ - 2031C - Building a Space Station最小生成树

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

poj2031 Building a Space Station 三维空间的最小生成树

题目链接: 2031 http://write.blog.csdn.net/postedit?ref=toolbar 题意: 在三维空间中有N个球形空间站,给出每个空间站的三维坐标x,y,z 和半径.其中空间站之间可能存在相交,包含,相离等情况.如果非相离则两空间站的距离为0.求连同所有空间站的最小生成树. 题解: 三维构图两空间站的距离等于两圆心距离减去两圆的半径 如果距离小于0,则距离为0 在套kruskal模板即可 代码: #include<iostream> #include<c

Building a Space Station——最小生成树

题目链接 题意: 给出n个球体的球心坐标和半径,可以在两个球体的表面连一条通路,代价为距离. 求使得所有球体联通的最小花费. 题解: 最小生成树裸板子 暴力把每个球体的表面之间的距离求出(即 dis=球心距 - 半径和) 注意 如果 dis<0 则 dis=0 代码: #include<iostream> #include<stdio.h> #include<math.h> #include<algorithm> #include<cstring

ZOJ 1718 POJ 2031 Building a Space Station 修建空间站 最小生成树 Kruskal算法

题目链接:ZOJ 1718 POJ 2031 Building a Space Station 修建空间站 Building a Space Station Time Limit: 2 Seconds      Memory Limit: 65536 KB You are a member of the space station engineering team, and are assigned a task in the construction process of the statio

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

Building a Space Station Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 5699   Accepted: 2855 Description You are a member of the space station engineering team, and are assigned a task in the construction process of the station. You ar

POJ2032 Building a Space Station(Kruskal)(并查集)

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 ar

poj 2031 Building a Space Station 【最小生成树 Prim】

Building a Space Station Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 5778   Accepted: 2874 Description You are a member of the space station engineering team, and are assigned a task in the construction process of the station. You ar

[2016-04-14][POJ][203][Building a Space Station]

时间:2016-04-14 21:43:30 星期四 题目编号:[2016-04-14][POJ][203][Building a Space Station] 题目大意:给定n个球体,每个球体可能重合,可能包含,可能分离,问把每个球体连接起来(重合和包含看做已经连接),至少需要多长的路 分析:最小生成树,边权为 max(0,disij?ri?rj)max(0,disij?ri?rj),即重合和内含,边权为0 #include<cstdio> #include<cstring> #