NYOJ Radar
来源:互联网 发布:maya mac 2017中文版 编辑:程序博客网 时间:2024/05/26 22:07
Radar
时间限制:1000 ms | 内存限制:65535 KB
难度:3
- 描述
- Assume the coasting is an infinite straight line. Land is in one side of coasting, sea in the other. Each small island is a point locating in the sea side. And any radar installation, locating on the coasting, can only cover d distance, so an island in the sea can be covered by a radius installation, if the distance between them is at most d.
We use Cartesian coordinate system, defining the coasting is the x-axis. The sea side is above x-axis, and the land side below. Given the position of each island in the sea, and given the distance of the coverage of the radar installation, your task is to write a program to find the minimal number of radar installations to cover all the islands. Note that the position of an island is represented by its x-y coordinates.
- 输入
- The input consists of several test cases. The first line of each case contains two integers n (1<=n<=1000) and d, where n is the number of islands in the sea and d is the distance of coverage of the radar installation. This is followed by n lines each containing two integers representing the coordinate of the position of each island. Then a blank line follows to separate the cases.
The input is terminated by a line containing pair of zeros - 输出
- For each test case output one line consisting of the test case number followed by the minimal number of radar installations needed. "-1" installation means no solution for that case.
- 样例输入
3 21 2-3 12 11 20 20 0
- 样例输出
Case 1: 2Case 2: 1
题意 : 海上有许多小岛建立直角坐标系在x轴上安装雷达用最少的雷达把岛屿全都覆盖给出各岛坐标和雷达覆盖半径如果不能覆盖输出-1
#include<cstdio>#include<cstdlib>#include<cstring>#include<algorithm>#include<cmath>using namespace std;structNode{int x,y;double d;}A[1010];boolcmp(Node a,Node b){return a.d<b.d;}int main(){int i,n,d,sign,ans,t=1;double x,l;while(scanf("%d%d",&n,&d)==2){if(n==0&&d==0)break;sign=0;for(i=0;i<n;++i){scanf("%d%d",&A[i].x,&A[i].y);if(A[i].y>d)sign=1;A[i].d=A[i].x+sqrt(d*d-(A[i].y)*(A[i].y));}if(sign==1){printf("-1\n");continue;}stable_sort(A,A+n,cmp);x=A[0].d;ans=1;for(i=1;i<n;++i){l=sqrt(((A[i].x)-x)*((A[i].x)-x)+(A[i].y)*(A[i].y));if(l>d){ans++;x=A[i].d;}}printf("Case %d: %d\n",t++,ans);}return 0;}
0 0
- nyoj Radar
- NYOJ Radar
- NYOJ 287 Radar
- radar nyoj 287
- nyoj 287 Radar
- NYOJ-287 Radar
- NYOJ 287 Radar
- NYOJ-287 Radar(贪心)
- nyoj 287 Radar 【区间选点】
- poj 1328 Radar Installation(nyoj 287 Radar):贪心
- POJ&&NYOJ--1328题Radar Installation
- nyoj 287 radar (区间选点)
- NYOJ 287 Radar 贪心之 区间选点
- NYOJ Radar 贪心之区间选点问题
- poj 1328 && nyoj 287 Radar Installation【贪心】
- nyoj 题目287 Radar 贪心算法
- radar
- Radar
- 代码简洁之道:C++ 11 之auto+ for_each + lamda表达式
- asp.net 编译错误类型“同时存在于”不同的dll中.
- L*MM 文件管理器小结
- 在所有文件中查找包含某字符串的文件
- Java 内存分配全面浅析
- NYOJ Radar
- linux系统启动脚本执行顺序
- Core Animation学习笔记一:CATransactions
- std::for_each
- ORACLE 存储过程 得到表名
- 如何使用KeyChain保存和获取UDID
- 类前置声明的问题
- 浅析Android Camera开发中的三个尺寸和三种变形 (贡献一个自适配Picturesize和Previewsize的工具类)
- pin 插装学习之一