2017-08-04 16:19:13

writer:pprp

题意如下:

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

题意简化:
  个人觉得这道题最难的在于理解,简化以后的题意是:  

    • n个站点,s个卫星系统,每个卫星系统只能安排在一个站点
    • 有卫星系统的站点间通讯不需要代价
    • 任意两点(i, j)间皆可通讯,代价为dis[i][j]
    • 请用最小的代价使得任意两个站点间均可以通讯
    • n, s <= 1000

分析:

  n个站点,应该用Kruskal算法进行最小生成树的进行;用ans数组记录下来从小到大的边的边权,

  最终结果就应该是ans[num - s] num是最小生成树的边的数目,等于是最后n个比较大的被舍去,需要最大的就是被舍去以后最大的点


代码及分析:
#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm> using namespace std;
//n个卫星,m个基站
int n, m;
int x, y;
const int maxn = ;
const int INF = 0x3f3f3f3f;
int parent[maxn];
//有多少个边
int num;
//ans数组中存储的是升序排序的入树的边的权值
double ans[maxn]; struct point
{
int x;
int y;
} p[maxn]; struct ds
{
int u;
int v;
double w;
} d[maxn * maxn + maxn]; double dist(const point& a, const point& b)
{
return sqrt(1.0 * (a.x - b.x) * (a.x - b.x) +
1.0 * (a.y - b.y) * (a.y - b.y));
} bool cmp(const ds &a, const ds& b)
{
return a.w < b.w;
} //并查集中找到父节点的操作
int Find(int x)
{
//递归?
//parent[x] = Find(parent[x]);
//return parent[x]; //自己写的迭代
int tmp = x;
while(parent[tmp] != tmp)
{
tmp = parent[tmp];
} return tmp;
} void merge(int x, int y)
{
int fa = Find(x);
int fb = Find(y);
if(fa != fb)
{
parent[fa] = fb;
}
} void init()
{
scanf("%d%d",&n,&m);
num = ;
for(int i = ; i < m ; i++)
{
scanf("%d%d",&p[i].x,&p[i].y);
} for(int i = ; i < m ; i++)
for(int j = i + ; j < m ; j++)
{
d[num].u = i;
d[num].v = j;
d[num++].w = dist(p[i],p[j]);
} for(int i = ; i <= m ; i++)
parent[i] = i; //从小到大进行排序
sort(d,d+num,cmp);
} //最主要的代码:Kruskal
void kruskal()
{
int cnt = ;
for(int i = ; i < num ; i++)
{
int fa = Find(d[i].u);
int fb = Find(d[i].v); if(fa != fb)
{
merge(d[i].u,d[i].v);
ans[cnt++] = d[i].w;
}
}
printf("%.2f\n",ans[cnt - n]);
} int main()
{
int t; scanf("%d",&t); while(t--)
{
init();
kruskal();
}
return ;
}

注意点:在poj提交的时候对double型的应该用%f\n而不要用%lf\n

												

poj2349 Arctic Network - 最小生成树的更多相关文章

  1. [poj2349]Arctic Network(最小生成树+贪心)

    Arctic Network Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 17758   Accepted: 5646 D ...

  2. [Poj2349]Arctic Network(二分,最小生成树)

    [Poj2349]Arctic Network Description 国防部(DND)要用无线网络连接北部几个哨所.两种不同的通信技术被用于建立网络:每一个哨所有一个无线电收发器,一些哨所将有一个卫 ...

  3. POJ 2349 Arctic Network (最小生成树)

    Arctic Network Time Limit:2000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u Subm ...

  4. POJ2349 Arctic Network 2017-04-13 20:44 40人阅读 评论(0) 收藏

    Arctic Network Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 19113   Accepted: 6023 D ...

  5. POJ2349 Arctic Network(Prim)

    Arctic Network Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 16968   Accepted: 5412 D ...

  6. POJ-2349 Arctic Network(最小生成树+减免路径)

    http://poj.org/problem?id=2349 Description The Department of National Defence (DND) wishes to connec ...

  7. TZOJ 2415 Arctic Network(最小生成树第k小边)

    描述 The Department of National Defence (DND) wishes to connect several northern outposts by a wireles ...

  8. POJ2349 Arctic Network

    原题链接 先随便找一棵最小生成树,然后贪心的从大到小选择边,使其没有贡献. 显然固定生成树最长边的一个端点安装卫星频道后,从大到小选择边的一个端点作为卫星频道即可将该边的贡献去除. 所以最后的答案就是 ...

  9. POJ 2349 Arctic Network(最小生成树+求第k大边)

    题目链接:http://poj.org/problem?id=2349 题目大意:有n个前哨,和s个卫星通讯装置,任何两个装了卫星通讯装置的前哨都可以通过卫星进行通信,而不管他们的位置. 否则,只有两 ...

随机推荐

  1. 关于Z序的总结

    //转自:http://blog.csdn.net/flowshell/article/details/4797917 Z 序:一个重叠窗口的堆,每个窗口在Z 序中 都有唯一一个位置.一个窗口的Z 序 ...

  2. java倒序输出List

    先贴代码 package com.tsubasa.collection; import java.util.ArrayList; import java.util.Arrays; import jav ...

  3. delphi xe学习随意记录

    学习来源(根据他们的资料整理) 论坛:http://www.coder163.com(有视频) 博客:http://del.cnblogs.com/(万一的博客) 1.1.1    命名规范的概述 1 ...

  4. Spring Data 开发环境搭建(二)

    首先咱们先创建一个maven工程 在pom.xml加入以下 依赖 <!--Mysql 驱动包--> <dependency> <groupId>mysql</ ...

  5. 2015-03-10——简析javascript对象

    对于构造函数,它是Function对象的一个实例,可以定义自己的静态成员先实例化出对象,后执行function中内部代码 静态成员:  var abc = function () {};  //既是一 ...

  6. tomcat8以上管理页面提示403问题

    修改conf/tomcat-users.xml <role rolename="manager"/> <role rolename="manager-g ...

  7. 解决putty自动断开的问题

    解决putty自动断开的问题 putty窗口上右键>change settings.打开后如下,修改seconds of keepalives,让putty每隔若干秒发送心跳包

  8. WinForm TCP异步连接之服务器端

    C# — WinForm TCP连接之服务器端 TCP连接之服务器端,涉及到如下三个函数,分别是: /***************************** ** 函数功能: 服务端监听 ** 输 ...

  9. Fatal error in launcher: Unable to create process using '"'的报错解决

    执行命令前加python -m就好了 python -m pip install --upgrade pip这条命令用来升级pip

  10. django生成json

    好方便啊……list什么的一下都变成json了呢! import json from django.core.serializers.json import DjangoJSONEncoder def ...