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
#include"stdio.h"
#include"math.h"
#include"string.h"
#include"iostream"
#include"algorithm"
using namespace std;
struct dd
{
double x,y;
}w[101110];
bool cc(dd q,dd p)
{
return q.x<p.x||(q.x==p.x&&q.y>p.y);
}
int main()
{
int i,j,k,t=0;
int n,d,x,y;
int f;
while(cin>>n>>d&&(n||d))
{
f=0;
for(i=0;i<n;i++)
{
cin>>x>>y;
if(d<y)
f=1;
w[i].x=x-sqrt(d*d-y*y);
w[i].y=x+sqrt(d*d-y*y);
}
if(f)
{
printf("Case %d: -1\n",++t);
continue;
}
sort(w,w+n,cc);
double s=w[0].y;
int sum=1;
for(i=1;i<n;i++)
{
if(w[i].x<=s)
{
s=min(w[i].y,s);
continue;
}
else
{
sum++;
s=w[i].y;
}
}
printf("Case %d: %d\n",++t,sum);
}
return 0;
}