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

            Description

            The Department of National Defence (DND) wishes to connect several northern outposts by a wireless network. Two different communication technologies are to be used in establishing the network: every outpost will have a radio transceiver and some outposts will in addition have a satellite channel.
            Any two outposts with a satellite channel can communicate via the satellite, regardless of their location. Otherwise, two outposts can communicate by radio only if the distance between them does not exceed D, which depends of the power of the transceivers. Higher power yields higher D but costs more. Due to purchasing and maintenance considerations, the transceivers at the outposts must be identical; that is, the value of D is the same for every pair of outposts.

            Your job is to determine the minimum D required for the transceivers. There must be at least one communication path (direct or indirect) between every pair of outposts.

            Input

            The first line of input contains N, the number of test cases. The first line of each test case contains 1 <= S <= 100, the number of satellite channels, and S < P <= 500, the number of outposts. P lines follow, giving the (x,y) coordinates of each outpost in km (coordinates are integers between 0 and 10,000).

            Output

            For each case, output should consist of a single line giving the minimum D required to connect the network. Output should be specified to 2 decimal points.

            Sample Input

            1 2 4 0 100 0 300 0 600 150 750 

            Sample Output

            212.13 

            Source


            #include<cstdio>
            #include
            <cstring>
            #include
            <iostream>
            #include
            <cmath>
            #include
            <algorithm>
            using namespace std;
            const int MAXN = 550;
            const double inf = 1e250;
            int m,n;
            double e[MAXN][MAXN],x[MAXN],y[MAXN],ord[MAXN],cost[MAXN];
            bool vi[MAXN];
            void prim(int s){
                
            for(int i=0;i<n;i++){
                    vi[i]
            =0;cost[i]=e[s][i];
                }
                vi[s]
            =1;cost[s]=0.0;ord[0]=0.0;
                
            int u=s;
                
            for(int i=1;i<n;i++){
                    ord[i]
            =inf;
                    
            for(int j=0;j<n;j++)
                        
            if(!vi[j] && cost[j]<ord[i])
                            ord[i]
            =cost[u=j];
                    vi[u]
            =1;
                    
            for(int j=0;j<n;j++)
                        
            if(!vi[j] && e[u][j]<cost[j])
                            cost[j]
            =e[u][j];
                }
                sort(ord,ord
            +n);
                printf(
            "%.2lf\n",ord[n-m]);
            }
            int main(){
                
            int t;
                scanf(
            "%d",&t);
                
            while(t--){
                    scanf(
            "%d%d",&m,&n);
                    
            for(int i=0;i<n;i++)
                        scanf(
            "%lf%lf",&x[i],&y[i]);
                    
            for(int i=0;i<n;i++)
                        
            for(int j=i+1;j<n;j++)
                            e[i][j]
            =e[j][i]=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
                    prim(
            0);
                }
                
            return 0;
            }

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


            posts - 3, comments - 1, trackbacks - 0, articles - 16

            Copyright © lenohoo

            日本加勒比久久精品| 午夜不卡久久精品无码免费| 99久久国产综合精品网成人影院 | 国内高清久久久久久| 色播久久人人爽人人爽人人片AV| 久久久久久久精品成人热色戒| 久久亚洲AV成人无码电影| 中文字幕成人精品久久不卡| 欧美日韩精品久久久免费观看| 老色鬼久久亚洲AV综合| 欧美精品一区二区久久| 久久精品国产久精国产思思| 久久露脸国产精品| 丰满少妇人妻久久久久久| 亚洲人成网站999久久久综合 | 久久国产精品久久| 一日本道伊人久久综合影| 99久久99久久精品免费看蜜桃| 无码任你躁久久久久久| 国产精品gz久久久| 久久久噜噜噜久久熟女AA片| 人妻丰满?V无码久久不卡| 国产精品一区二区久久精品| 一本色道久久88精品综合 | 国产精品亚洲美女久久久| 亚洲国产欧美国产综合久久| 国産精品久久久久久久| 99久久精品国产麻豆| 久久久久久人妻无码| 久久亚洲日韩精品一区二区三区| 天天影视色香欲综合久久| 精品国产热久久久福利| 久久综合狠狠综合久久激情 | 91精品国产综合久久婷婷| 久久亚洲私人国产精品vA| 久久夜色精品国产欧美乱| 亚洲色大成网站www久久九 | 亚洲国产成人久久综合野外| 久久久久无码国产精品不卡| 久久久噜噜噜久久| 性欧美大战久久久久久久|