博客
关于我
POJ - 1328 Radar Installation 贪心
阅读量:422 次
发布时间: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/

你可能感兴趣的文章
MySQL Order By实现原理分析和Filesort优化
查看>>
mysql problems
查看>>
mysql replace first,MySQL中处理各种重复的一些方法
查看>>
MySQL replace函数替换字符串语句的用法(mysql字符串替换)
查看>>
mysql replace用法
查看>>
Mysql Row_Format 参数讲解
查看>>
mysql select, from ,join ,on ,where groupby,having ,order by limit的执行顺序和书写顺序
查看>>
MySQL Server 5.5安装记录
查看>>
mysql server has gone away
查看>>
mysql slave 停了_slave 停止。求解决方法
查看>>
MySQL SQL 优化指南:主键、ORDER BY、GROUP BY 和 UPDATE 优化详解
查看>>
MYSQL sql语句针对数据记录时间范围查询的效率对比
查看>>
mysql sum 没返回,如果没有找到任何值,我如何在MySQL中获得SUM函数以返回'0'?
查看>>
mysql Timestamp时间隔了8小时
查看>>
Mysql tinyint(1)与tinyint(4)的区别
查看>>
mysql union orderby 无效
查看>>
mysql v$session_Oracle 进程查看v$session
查看>>
mysql where中如何判断不为空
查看>>
MySQL Workbench 使用手册:从入门到精通
查看>>
mysql workbench6.3.5_MySQL Workbench
查看>>