• <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)  編輯 收藏 引用
            <2009年2月>
            25262728293031
            1234567
            891011121314
            15161718192021
            22232425262728
            1234567

            常用鏈接

            留言簿(8)

            隨筆檔案

            文章檔案

            Friends

            OJ

            搜索

            •  

            最新評論

            閱讀排行榜

            評論排行榜

            精品无码久久久久国产| 91麻豆精品国产91久久久久久| 91久久精品电影| 国产91久久综合| 久久丫忘忧草产品| 99久久中文字幕| 久久无码专区国产精品发布| 亚洲国产精品久久久天堂| 久久这里只有精品久久| 伊人色综合久久天天人守人婷| 人妻精品久久无码专区精东影业 | 久久综合九色欧美综合狠狠 | 久久人妻无码中文字幕| 久久综合丁香激情久久| 2021久久精品免费观看| 色综合久久久久网| 国产99久久精品一区二区| 97精品伊人久久大香线蕉| 国产69精品久久久久9999| 久久亚洲私人国产精品| 中文字幕精品久久| 91久久香蕉国产熟女线看| 久久国产精品无码HDAV| 日韩人妻无码精品久久久不卡| 亚洲国产一成久久精品国产成人综合| 精品久久久久久亚洲| 久久久亚洲欧洲日产国码aⅴ| 一日本道伊人久久综合影| 精品国产一区二区三区久久蜜臀| 国产午夜福利精品久久2021 | 2021国产精品午夜久久| 久久精品国产一区二区三区不卡| 久久青草国产精品一区| 国产精品毛片久久久久久久| 久久国产精品99精品国产| 日本人妻丰满熟妇久久久久久| 久久青青色综合| 亚洲精品乱码久久久久久蜜桃图片 | 99久久国产宗和精品1上映| 久久久免费观成人影院| 亚洲欧美一区二区三区久久|