題目：
Building a Space Station
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 310.000 10.000 50.000 10.00040.000 10.000 50.000 10.00040.000 40.000 50.000 10.000230.000 30.000 30.000 20.00040.000 40.000 40.000 20.00055.729 15.143 3.996 25.8376.013 14.372 4.818 10.67180.115 63.292 84.477 15.12064.095 80.924 70.029 14.88139.472 85.116 71.369 5.5530 |
[Submit] [Go Back] [Status] [Discuss]
思路：就是給出三維坐標系上的一些球的球心坐標和其半徑，搭建通路，使得他們能夠相互連通。如果兩個球有重疊的部分則算為已連通，無需再搭橋。求搭建通路的最小費用（費用就是邊權，就是兩個球面之間的距離）,就是當兩個球的距離接觸或者相交時邊權為0，注意這一點，然后要注意因為我的代碼是%lf輸出，所以要用C++交，就是普通的最小生成樹問題
代碼：
#include <cstdio>#include <cstring>#include <cstdlib>#include <cmath>#include <string>#include <iostream>#include <stack>#include <queue>#include <vector>#include <algorithm>#define mem(a,b) memset(a,b,sizeof(a))#define N 100+20#define M 10000+20#define MOD 1000000000+7#define inf 0x3f3f3f3fusing namespace std;int n,m;double map[N][N],dis[N];bool vis[N];struct node{ double x,y,z,r;} G[N];void init(){ for(int i=1; i<=n; i++) for(int j=1; j<=n; j++) i==j?map[i][j]=map[j][i]=0:map[i][j]=map[j][i]=inf;//初始化}void Prim(){ double minn; int k; for(int i=1; i<=n; i++) { dis[i]=map[1][i]; vis[i]=0; } vis[1]=1; double sum=0; for(int i=1; i<=n-1; i++) { minn=inf; for(int j=1; j<=n; j++) { if(!vis[j]&&dis[j]<minn) { minn=dis[j]; k=j; } } vis[k]=1; sum+=dis[k]; for(int j=1; j<=n; j++) if(!vis[j]&&map[k][j]<dis[j]) dis[j]=map[k][j]; } printf("%.3lf/n",sum);}double dist(node a,node 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));}int main(){ while(~scanf("%d",&n)&&n) { init(); mem(map,0); mem(dis,0); mem(vis,0); for(int i=1; i<=n; i++) scanf("%lf%lf%lf%lf",&G[i].x,&G[i].y,&G[i].z,&G[i].r); for(int i=1; i<=n-1; i++) for(int j=i+1; j<=n; j++) { double temp=dist(G[i],G[j]); if(temp-G[i].r-G[j].r<=0)//算出兩個球是否相交 map[i][j]=map[j][i]=0; else map[i][j]=map[j][i]=temp-G[i].r-G[j].r; } Prim(); } return 0;}
新聞熱點
疑難解答
