poj 2349 Arctic Network 最小生成树

最新推荐文章于 2018-08-13 15:53:53 发布

joafelnglfds

最新推荐文章于 2018-08-13 15:53:53 发布

阅读量517

点赞数

分类专栏：图论文章标签： prim

本文链接：https://blog.csdn.net/is_cp/article/details/38373945

版权

图论专栏收录该内容

14 篇文章 0 订阅

订阅专栏

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

Sample Output

212.13

题意及分析：

有p个哨所，在它们之间建立通信网络，使得两两之间可以相互联系。有两种方式，一种是卫星，一种是无线电。无线电需要发射装置，卫星可以直接联系。卫星与非卫星点之间依旧需要发射装置。给出了各点的坐标和卫星的数量s。因为要求所有的发射装置功率相同，所以要求功率的最大值。功率的大小跟距离相关。

用最小生成树解释就是，先构造一棵最小生成树。在一棵最小生成树里，各点是联通的，并且每个点到树的距离最小。在这个前提下，排序之后，然后最大的几条边去掉（也就是相应的点 使用卫星 联系），剩下的边里最大的值就是要求的。

AC代码：

 
 
  
  #include
    
    
     
     
#include
     
     
      
      
#include
      
      
       
       
#include
       
       
        
        
#include
        
         #include 
         
           #include 
          
            #include 
           
             #define INF 0x3f3f3f3f using namespace std; struct node { int x; int y; }a[510]; int s,p; int vis[510]; double edge[510][510],dis[510]; int cmp(double a,double b) { return a>b; } double cal(int i,int j) { return sqrt((a[i].x-a[j].x)*(a[i].x-a[j].x)+(a[i].y-a[j].y)*(a[i].y-a[j].y)); } double prim() { int i,j,now; for(i=1;i<=p;i++) dis[i]=1000000000; memset(vis,0,sizeof(vis)); dis[1]=0; for(i=1;i<=p;i++) { double mi=1000000000; for(j=1;j<=p;j++) if(!vis[j]&&dis[j] 
            
              edge[now][j]) dis[j]=edge[now][j]; } // for(i=1;i<=p;i++) // printf("%f\n",dis[i]); sort(dis+1,dis+p+1,cmp); return dis[s]; //s个点，所以去掉s-1条边 } int main() { int i,j,n; scanf("%d",&n); while(n--) { scanf("%d%d",&s,&p); for(i=1;i<=p;i++) scanf("%d%d",&a[i].x,&a[i].y); for(i=1;i<=p;i++) for(j=i+1;j<=p;j++) edge[i][j]=edge[j][i]=cal(i,j); printf("%.2f\n",prim()); } return 0; }

joafelnglfds

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
poj 2349 Arctic Network 最小生成树

DescriptionThe 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 net
复制链接

扫一扫