青青草原综合久久大伊人导航_色综合久久天天综合_日日噜噜夜夜狠狠久久丁香五月_热久久这里只有精品

posts - 74,  comments - 33,  trackbacks - 0
Building a Space Station
Time Limit: 1000MS Memory Limit: 30000K
Total Submissions: 548 Accepted: 347

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

Source

Japan 2003 Domestic
我暈 剛讀懂題目意思
我還想用Floyd簡化的處理下就行了,沒想到有點之間不能實現,看來不能偷懶,
只能用Dijiskal做了
代碼如下
for(i=0;i<n;i++){
????????????memset(flag,
0,sizeof(flag));
????????????
for(j=0;j<n;j++)
????????????????dis[j]
=map[i][j];
????????????
double?sum,Min;
????????????
int?sign;
????????????sum
=0;
????????????flag[i]
=1;
????????????
for(j=1;j<n;j++){
????????????????Min
=10000000;
????????????????
for(k=0;k<n;k++)
????????????????????
if(!flag[k]&&dis[k]<Min){
????????????????????????Min
=dis[k];
????????????????????????sign
=k;????
????????????????????}

????????????????flag[sign]
=1;
????????????????sum
+=Min;
????????????????
for(k=0;k<n;k++)
????????????????????
if(!flag[k]&&map[sign][k]<dis[k])
????????????????????????dis[k]
=map[sign][k];
????????????}

????????????
if(sum<min)min=sum;????
????????}
posted on 2009-02-20 21:51 KNIGHT 閱讀(197) 評論(0)  編輯 收藏 引用
<2009年2月>
25262728293031
1234567
891011121314
15161718192021
22232425262728
1234567

常用鏈接

留言簿(8)

隨筆檔案

文章檔案

Friends

OJ

搜索

  •  

最新評論

閱讀排行榜

評論排行榜

青青草原综合久久大伊人导航_色综合久久天天综合_日日噜噜夜夜狠狠久久丁香五月_热久久这里只有精品
  • <ins id="pjuwb"></ins>
    <blockquote id="pjuwb"><pre id="pjuwb"></pre></blockquote>
    <noscript id="pjuwb"></noscript>
          <sup id="pjuwb"><pre id="pjuwb"></pre></sup>
            <dd id="pjuwb"></dd>
            <abbr id="pjuwb"></abbr>
            欧美成人午夜激情视频| 午夜视黄欧洲亚洲| 欧美精品一区二区三区视频| 亚洲国产免费看| 亚洲日本欧美日韩高观看| 欧美国产一区在线| 亚洲主播在线观看| 久久久99国产精品免费| 最新国产拍偷乱拍精品| 亚洲乱码国产乱码精品精天堂| 国产精品电影观看| 麻豆国产精品va在线观看不卡| 免费人成精品欧美精品| 亚洲一区二区三区高清| 久久精品国产77777蜜臀| 亚洲美女网站| 亚洲欧美伊人| 亚洲精品久久久久久一区二区| 一区二区三区回区在观看免费视频| 国产午夜久久久久| 亚洲日本黄色| 狠狠色丁香婷综合久久| 一本色道久久综合一区| 伊人精品成人久久综合软件| 一本色道久久综合亚洲精品不卡| 国产亚洲一区二区精品| 亚洲精选在线观看| 激情文学一区| 亚洲系列中文字幕| 99精品国产福利在线观看免费 | 亚洲高清免费| 一区二区不卡在线视频 午夜欧美不卡在 | 久久精品国产一区二区电影| 欧美国产视频日韩| 老鸭窝亚洲一区二区三区| 国产精品盗摄一区二区三区| 亚洲国产aⅴ天堂久久| 国产日韩欧美在线| 在线视频日韩| 日韩午夜三级在线| 美女999久久久精品视频| 欧美在线啊v一区| 欧美视频网址| 亚洲美女av网站| 亚洲乱码久久| 欧美成人免费全部观看天天性色| 久久一区二区三区四区五区| 国产精品久久久久久久久久免费看 | 一区二区三区四区五区精品| 久久久精品性| 久久久久久欧美| 国产一级揄自揄精品视频| 亚洲一区亚洲二区| 亚洲免费一级电影| 国产精品国产三级国产普通话蜜臀 | 欧美在线视频网站| 国产欧美日韩另类视频免费观看| 日韩一区二区高清| 亚洲婷婷综合色高清在线| 欧美片在线观看| 亚洲精品一区二区三区在线观看 | 久久久久久九九九九| 国产欧美精品va在线观看| 亚洲欧美成人综合| 久久国产精品99国产精| 国产一区日韩一区| 久久狠狠婷婷| 欧美不卡一卡二卡免费版| 亚洲国产欧美日韩精品| 欧美高清在线精品一区| 亚洲国产日韩欧美在线图片| 日韩午夜在线视频| 国产精品h在线观看| 亚洲综合第一| 免费一级欧美在线大片| 亚洲国产你懂的| 欧美美女操人视频| 亚洲一区久久久| 久久午夜精品| 日韩一区二区精品葵司在线| 欧美日韩免费看| 性欧美8khd高清极品| 蜜臀av在线播放一区二区三区| 亚洲精品一区二区三区婷婷月| 欧美色欧美亚洲高清在线视频| 午夜精品99久久免费| 蜜臀a∨国产成人精品| 亚洲三级影院| 国产农村妇女精品一二区| 另类亚洲自拍| 亚洲一区二区日本| 美女精品在线观看| 久久精品国产91精品亚洲| 最近看过的日韩成人| 午夜久久tv| 亚洲激情成人网| 国产精品色一区二区三区| 久久深夜福利| 亚洲一区黄色| 亚洲精品国产视频| 久久频这里精品99香蕉| 亚洲无线观看| 亚洲国产精品久久久久婷婷884| 欧美涩涩视频| 免费观看不卡av| 欧美一级二级三级蜜桃| 亚洲欧洲日韩综合二区| 久久丁香综合五月国产三级网站| 亚洲欧洲三级| 一区在线播放视频| 国产精品亚洲美女av网站| 欧美成人久久| 久久久久久网址| 亚洲网站啪啪| 亚洲免费观看高清完整版在线观看熊| 久久精品一区二区三区不卡| 亚洲性色视频| 日韩一二三区视频| 亚洲福利在线观看| 黑人一区二区三区四区五区| 国产精品久久久一区麻豆最新章节| 久久手机精品视频| 欧美主播一区二区三区| 亚洲在线不卡| 一区二区三区四区国产| 日韩亚洲精品电影| 最新日韩中文字幕| 亚洲激情网站| 亚洲国产专区校园欧美| 欧美福利一区二区| 牛夜精品久久久久久久99黑人| 久久婷婷国产综合精品青草| 久久久精彩视频| 久久爱www久久做| 久久国产黑丝| 久久国产主播| 久久综合色婷婷| 久久婷婷国产综合精品青草 | 亚洲乱码国产乱码精品精| 亚洲激情国产| 99精品久久| 一区二区三区欧美视频| 亚洲一区免费| 羞羞色国产精品| 久久不射中文字幕| 久久久久久午夜| 免费久久99精品国产自| 亚洲电影免费观看高清完整版在线观看 | 国产午夜精品麻豆| 国语自产精品视频在线看一大j8 | 欧美日韩人人澡狠狠躁视频| 欧美日韩美女在线观看| 国产精品mv在线观看| 国产精品性做久久久久久| 国产婷婷成人久久av免费高清| 国产综合激情| 亚洲欧洲一区| 亚洲五月婷婷| 久久蜜桃资源一区二区老牛| 免费成人av资源网| 亚洲精品中文在线| 在线亚洲免费| 欧美中文字幕视频| 欧美 日韩 国产 一区| 亚洲日本视频| 午夜欧美电影在线观看| 老司机一区二区三区| 欧美日韩成人综合天天影院| 国产精品嫩草久久久久| 伊人成人在线| 在线视频精品| 久久综合网络一区二区| 91久久精品一区二区三区| 亚洲一区二区高清视频| 玖玖视频精品| 国产精品国产三级国产专区53| 国产亚洲精品久久飘花 | 国产亚洲欧美日韩精品| 亚洲日本免费电影| 久久国产精品第一页| 亚洲欧洲在线播放| 欧美自拍偷拍| 欧美性做爰毛片| 亚洲国产高清在线观看视频| 亚洲欧美日韩精品久久亚洲区 | 亚洲欧美欧美一区二区三区| 久久综合精品国产一区二区三区| 欧美日韩精品三区| 亚洲大片一区二区三区| 欧美一区二视频在线免费观看| 欧美激情二区三区| 欧美伊人久久| 国产精品久久97| 一区二区三区**美女毛片| 欧美jjzz| 久久久久青草大香线综合精品| 国产精品毛片a∨一区二区三区| 亚洲免费观看高清完整版在线观看| 久久久蜜桃精品| 亚洲欧美国产毛片在线|