POJ 1328 Radar Installation

Radar Installation

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 75258		Accepted: 16841

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 2
1 2
-3 1
2 1

1 2
0 2

0 0

Sample Output

Case 1: 2
Case 2: 1

Source

Beijing 2002

这一题算船只到岛上的范围，重合了就不管，没有重合的部分就再加一个雷达。

倒着求解，方法很有记录价值。

#include<stdio.h>
#include<math.h>
#include<string.h>
#include<algorithm>
using namespace std;
int n,d;
struct Point
{
	double x,y;
}a[1111];
struct dis
{
	double s,e;
}b[1111];
bool cmp(dis x,dis y)
{
	return x.e<y.e;
}
double com1(double x,double y)
{
	double sum=sqrt(1.0*d*d-y*y);
	return x-sum;
}
double com2(double x,double y)
{
	double sum=sqrt(1.0*d*d-y*y);
	return x+sum;
}
int main()
{
	double s,e,temp;
	int i,count=1;
	while(scanf("%d%d",&n,&d),n||d)
	{
		int flag=0;
		for(i=0;i<n;i++)
		{
			scanf("%lf%lf",&a[i].x,&a[i].y);
			if(a[i].y>d)
			{
				flag=1;
				continue;
			}
			s=com1(a[i].x,a[i].y); e=com2(a[i].x,a[i].y);
			if(s>e)
			{
				temp=s;
				s=e;
				e=temp;
			}
			b[i].s=s;
			b[i].e=e;
		}
		if(flag)
			printf("Case %d: -1\n",count++);
		else
		{
			sort(b,b+n,cmp);
			double max=b[0].e;
			int ans=1;
			for(i=1;i<n;i++)
			{
				if(max>=b[i].s)
					continue;
				max=b[i].e;
				ans++;
			}
			printf("Case %d: %d\n",count++,ans);
		}
	}
	return 0;
}