博客
关于我
POJ - 1328 Radar Installation 贪心
阅读量:425 次
发布时间:2019-03-06

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

Radar Installation
Time Limit: 1000MS   Memory Limit: 10000K
Total Submissions: 96177   Accepted: 21378

Description

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.

Figure A Sample Input of Radar Installations


Input

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

Output

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.

Sample Input

3 21 2-3 12 11 20 20 0

Sample Output

Case 1: 2Case 2: 1

Source

可将点的坐标转为在x轴上对应的位置,然后根据右端对应的值进行排序判断。

#include<cstdio>#include<algorithm>#include<cmath>using namespace std;struct pos{	double left,right;};bool flag;bool compare(pos a, pos b){	return a.right < b.right;}int main(){	int n;	double d;	int m = 1;	pos a[1005];	while (~scanf("%d %lf", &n, &d))	{		if (!n || !d)		{			break;		}		int sum = 1;		flag = true;		double x, y;		for (int i = 0; i<n; i++)		{			scanf("%lf %lf", &x, &y);			if (!flag)			{				continue;			}			if (y > d)			{				flag = false;				continue;			}			a[i].left = x - sqrt(d*d - y*y);			a[i].right = x + sqrt(d*d - y*y);		}				if (!flag)		{			printf("Case %d: -1\n",m);			m++;			continue;		}		sort(a, a + n,compare);		double temp = a[0].right;		for (int i = 1; i < n; i++)		{			if (temp<a[i].left)			{				sum++;				temp = a[i].right;			}		}		printf("Case %d: %d\n", m,sum);		m++;	}	return 0;}





转载地址:http://wuwuz.baihongyu.com/

你可能感兴趣的文章
localhost:5000在MacOS V12(蒙特利)中不可用
查看>>
logstash mysql 准实时同步到 elasticsearch
查看>>
Luogu2973:[USACO10HOL]赶小猪
查看>>
mabatis 中出现&lt; 以及&gt; 代表什么意思?
查看>>
Mac book pro打开docker出现The data couldn’t be read because it is missing
查看>>
MAC M1大数据0-1成神篇-25 hadoop高可用搭建
查看>>
mac mysql 进程_Mac平台下启动MySQL到完全终止MySQL----终端八步走
查看>>
Mac OS 12.0.1 如何安装柯美287打印机驱动,刷卡打印
查看>>
MangoDB4.0版本的安装与配置
查看>>
Manjaro 24.1 “Xahea” 发布!具有 KDE Plasma 6.1.5、GNOME 46 和最新的内核增强功能
查看>>
mapping文件目录生成修改
查看>>
MapReduce程序依赖的jar包
查看>>
mariadb multi-source replication(mariadb多主复制)
查看>>
MariaDB的简单使用
查看>>
MaterialForm对tab页进行隐藏
查看>>
Member var and Static var.
查看>>
memcached高速缓存学习笔记001---memcached介绍和安装以及基本使用
查看>>
memcached高速缓存学习笔记003---利用JAVA程序操作memcached crud操作
查看>>
Memcached:Node.js 高性能缓存解决方案
查看>>
memcache、redis原理对比
查看>>