• <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>
            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簡化的處理下就行了,沒想到有點之間不能實現(xiàn),看來不能偷懶,
            只能用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 閱讀(192) 評論(0)  編輯 收藏 引用

            只有注冊用戶登錄后才能發(fā)表評論。
            網(wǎng)站導(dǎo)航: 博客園   IT新聞   BlogJava   博問   Chat2DB   管理


            <2025年7月>
            293012345
            6789101112
            13141516171819
            20212223242526
            272829303112
            3456789

            常用鏈接

            留言簿(8)

            隨筆檔案

            文章檔案

            Friends

            OJ

            搜索

            •  

            最新評論

            閱讀排行榜

            評論排行榜

            国内精品伊人久久久久妇| 新狼窝色AV性久久久久久| 国产一区二区精品久久凹凸| 国产福利电影一区二区三区久久久久成人精品综合 | 中文字幕精品无码久久久久久3D日动漫 | 9999国产精品欧美久久久久久| 久久久久久久综合日本亚洲| 久久精品国产黑森林| 四虎国产精品成人免费久久| 91精品国产乱码久久久久久| 久久久久久久久久免免费精品| 精品久久人人爽天天玩人人妻| 欧美va久久久噜噜噜久久| 久久久久中文字幕| 思思久久99热只有频精品66| 日韩亚洲欧美久久久www综合网| 久久久久一本毛久久久| 婷婷五月深深久久精品| 日韩影院久久| 国产精品18久久久久久vr | 久久综合综合久久狠狠狠97色88| 久久国产精品二国产精品| 色综合久久综合中文综合网| 精品久久人人做人人爽综合| 久久久久久精品成人免费图片| 色综合久久精品中文字幕首页| 久久精品国产99久久久古代 | 久久精品无码一区二区WWW| 2020最新久久久视精品爱| 久久久无码一区二区三区| 久久只有这里有精品4| 国产成人精品久久综合| 免费观看久久精彩视频 | 久久综合视频网站| 99精品伊人久久久大香线蕉| 99久久成人国产精品免费| 久久亚洲精品人成综合网| 久久夜色精品国产噜噜麻豆| 久久精品国产亚洲AV蜜臀色欲| 亚洲欧美国产精品专区久久| 亚洲美日韩Av中文字幕无码久久久妻妇 |