POJ2031 Building a Space Station(最小生成樹,prim)
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.
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.
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.
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 題意:球把所有球連起來的最短距離:最短路,每兩個球球心的距離減去的兩個半徑的和為權值,若為負值則權值為0;
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
const double INF = 1000.0;
const double eps = 1e-10;
struct point{
double x,y,z;
double r;
}p[1000];
double w[1000][1000];
double dis(point A,point B){
return sqrt((A.x-B.x)*(A.x-B.x)+(A.y-B.y)*(A.y-B.y)+(A.z-B.z)*(A.z-B.z))-A.r-B.r;
}
int judge(double k)
{
if(fabs(k)<eps)
return 0;
return k>0?1:-1;
}
bool vis[1000];
int main()
{
int n;
while(cin>>n,n){
int i,j;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
w[i][j]=INF;
for(i=1;i<=n;i++)
cin>>p[i].x>>p[i].y>>p[i].z>>p[i].r;
for(i=1;i<=n-1;i++)
for(j=i+1;j<=n;j++)
{
double temp=dis(p[i],p[j]);
if(judge(temp)<=0)
w[i][j]=w[j][i]=0;
else
w[i][j]=w[j][i]=temp;
}
memset(vis,0,sizeof(vis));
int s=1,fi;
vis[s]=1;
double sum=0;
for(int i=1;i<n;i++){
double min=INF;
for(int j=2;j<=n;j++){
if(!vis[j]){
if(min>w[s][j]){
min=w[s][j];
fi=j;
}
}
}
sum+=w[s][fi];
vis[fi]=1;
for(int j=2;j<=n;j++){
if(!vis[j]){
if(w[s][j]>w[fi][j])
w[s][j]=w[fi][j];
}
}
}
printf("%.3lf\n",sum);
}
return 0;
}
相關文章
- POJ 2031-Building a Space Station(最小生成樹-三維座標系)UI
- Prim 最小生成樹 圖解圖解
- 最小生成樹__Prim演算法演算法
- 最小生成樹之 Prim 演算法演算法
- 最小生成樹prim普里姆演算法演算法
- 圖論之帶權圖「最小生成樹之Prim」圖論
- 最小生成樹——Prim演算法和Kruscal演算法演算法
- 最小生成樹:Kruskal演算法和Prim演算法演算法
- 最小生成樹-Prim演算法和Kruskal演算法演算法
- 圖論之帶權圖「最小生成樹prim的優化」圖論優化
- 最小生成樹之Prim演算法和Kruskal演算法演算法
- 圖論之帶權圖「最小生成樹prim的最佳化」圖論
- 資料結構------最短路徑Dijkstra和最小生成樹Prim資料結構
- 最小生成樹的性質與prim演算法(C++實現)演算法C++
- 最小生成樹
- 【JAVA演算法】圖論演算法 --求最小生成樹Prim演算法Java演算法圖論
- 最小度限制生成樹
- 【模板】最小生成樹
- Matlab生成Kruskal最小生成樹Matlab
- 【圖論】最小生成樹圖論
- 圖論 最小生成樹圖論
- 最小生成樹專項
- 最小生成樹,Prim演算法與Kruskal演算法,408方向,思路與實現分析演算法
- Prim演算法(最小生成樹) 我TM只能先做到這兒了 後面繼續補充演算法
- 演算法基礎 第5版 第四章 最小生成樹Prim方法的Ruby實現演算法
- 最小生成樹學習筆記筆記
- 最小生成樹__Kurskal演算法演算法
- 最小生成樹的演算法演算法
- 使用canvas尋路最小生成樹Canvas
- Kruskal 最小生成樹演算法演算法
- BZOJ 1626 [Usaco2007 Dec]Building Roads 修建道路:kruskal(最小生成樹)UI
- 最小樹形圖(有向圖的最小生成樹)朱劉演算法演算法
- 【演算法學習】最小生成樹演算法
- 一些“最小生成樹”板題
- NOIP 複習題之最小生成樹
- 演算法-圖論-最小生成樹演算法圖論
- 最小生成樹---普里姆演算法(Prim演算法)和克魯斯卡爾演算法(Kruskal演算法)演算法
- 淺談三種求最小生成樹的方法