• <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簡化的處理下就行了,沒想到有點之間不能實現,看來不能偷懶,
            只能用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

            搜索

            •  

            最新評論

            閱讀排行榜

            評論排行榜

            久久亚洲欧洲国产综合| 久久精品9988| 久久发布国产伦子伦精品| 久久国产精品77777| 欧美大战日韩91综合一区婷婷久久青草 | 欧美一级久久久久久久大片| 亚洲国产精品成人久久| 久久香蕉国产线看观看猫咪?v| 色偷偷88888欧美精品久久久| 伊人久久大香线焦综合四虎| 无码精品久久久久久人妻中字| 久久人妻少妇嫩草AV蜜桃| 久久精品国产第一区二区三区| 亚洲国产高清精品线久久| 国产精品免费久久久久影院| 久久久久久九九99精品| 久久久久亚洲av综合波多野结衣 | 久久精品国产99久久久香蕉| 久久天天躁狠狠躁夜夜avapp| 尹人香蕉久久99天天拍| 国产巨作麻豆欧美亚洲综合久久 | 999久久久国产精品| 99久久99这里只有免费费精品 | 色综合色天天久久婷婷基地| 久久久久国产精品熟女影院 | 97久久精品人人澡人人爽| 狠狠干狠狠久久| 天天久久狠狠色综合| 精品少妇人妻av无码久久| 久久久免费精品re6| .精品久久久麻豆国产精品| 久久人人爽人人爽人人AV东京热| 久久婷婷国产剧情内射白浆| 久久99热这里只有精品国产| 亚洲狠狠婷婷综合久久蜜芽| 久久精品蜜芽亚洲国产AV| 国产99久久精品一区二区| 色综合久久久久| 久久亚洲精品国产精品婷婷 | 色综合久久中文综合网| 久久精品国产精品亚洲艾草网美妙|