博客
关于我
强烈建议你试试无所不能的chatGPT,快点击我
Poj(2349),最小生成树的变形
阅读量:5911 次
发布时间:2019-06-19

本文共 2401 字,大约阅读时间需要 8 分钟。

题目链接:

Arctic Network
Time Limit: 2000MS   Memory Limit: 65536K
Total Submissions: 17032   Accepted: 5441

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

12 40 1000 3000 600150 750

Sample Output

212.13

Source

 
题意:1案例数,2个点是可以用无线的(用无线的点,到任何点的距离不受限制),4个点,下面是坐标,求最小生成树中的最大权值,和之前的不同点是在权值为0的点是不确定的。
思路:照样求最小生成树,有2个点的距离为0,即可以在最小生成树中删掉两条最长的边。最靠后的那条边就是最大的权值。
#include 
#include
#include
#include
using namespace std;int x[550];int y[550];struct Edge { int u,v; double w;}edge[550*550];int father[550];int Find_Set(int x){ if(x!=father[x]) father[x] = Find_Set(father[x]); return father[x];}int cmp (Edge a,Edge b){ return a.w < b.w;}double ans[550];int main(){ //freopen("input.txt","r",stdin); int cases; scanf("%d",&cases); while(cases--) { memset(ans,0,sizeof(ans)); int s,n; scanf("%d%d",&s,&n); for(int i=0;i

 

转载于:https://www.cnblogs.com/TreeDream/p/5748110.html

你可能感兴趣的文章
数据必须流动起来,企业反应越快成功的机会越大
查看>>
明年将大幅涨薪的20种IT职位 “数据科学”相关占三分之一
查看>>
Spring IoC 学习(4)
查看>>
数据不够怎么训练深度学习模型?不妨试试迁移学习
查看>>
Docker 会取代虚拟机吗?
查看>>
你会爱Vim编辑器的七个理由
查看>>
Android“勿扰”闹铃功能再次消失
查看>>
这款新工具可在不解密流量的情况下检测攻击载荷
查看>>
面对网络“灾难风暴” Fortinet“安立方”打造完美方舟
查看>>
Ubuntu Make新版上线:支持安装Swift编程语言
查看>>
大众点评支付渠道网关系统的实践之路
查看>>
如何优雅的使用RabbitMQ
查看>>
公民个人信息应在境内存储
查看>>
IP网络摄像机安装注意事项
查看>>
如何写出小而清晰的函数?(JS 版)
查看>>
解析:深度学习框架Caffe源码
查看>>
TCL华星光电与华显光电重组:疑为旗下公司上市铺路
查看>>
国家风光储输示范工程:破解新能源世界难题
查看>>
解读《森林防火视频监控系统技术规范》
查看>>
为什么美国科技巨头纷纷押注非洲?
查看>>