• <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

            搜索

            •  

            最新評論

            閱讀排行榜

            評論排行榜

            99久久人妻无码精品系列蜜桃 | 久久精品国产精品亚洲精品| 亚洲午夜久久久精品影院| 99久久婷婷国产综合精品草原| 94久久国产乱子伦精品免费| 一级女性全黄久久生活片免费| 亚洲国产精品无码久久一线 | 99久久免费国产精品| 欧美国产精品久久高清| 久久夜色精品国产噜噜亚洲AV| 精品无码久久久久久久动漫| 99久久国产宗和精品1上映 | 国产国产成人久久精品| 久久久国产打桩机| 精品无码人妻久久久久久| 亚洲午夜久久久久久噜噜噜| 国产成人AV综合久久| 精品久久久噜噜噜久久久 | 无码人妻精品一区二区三区久久 | 亚洲国产精品无码久久| 国产精品伊人久久伊人电影| 国产人久久人人人人爽 | 精品午夜久久福利大片| 无遮挡粉嫩小泬久久久久久久| 一级女性全黄久久生活片免费| 国产精品午夜久久| 91精品久久久久久无码| 97精品国产91久久久久久| 少妇精品久久久一区二区三区| 国产69精品久久久久APP下载| 久久精品夜色噜噜亚洲A∨| 国产农村妇女毛片精品久久| 亚洲国产精品婷婷久久| 日产精品久久久久久久| 亚洲AV无码久久精品狠狠爱浪潮| 精品熟女少妇AV免费久久| 久久精品国产亚洲AV不卡| 久久九九兔免费精品6| 久久综合给合久久狠狠狠97色69| 亚洲国产另类久久久精品小说| 99久久无色码中文字幕人妻|