Radar Installation
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 51301 | Accepted: 11512 |
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
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
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<iostream>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
struct node
{
double a,b;
}s[1005],l[1005];
int cmp(node x,node y)
{
return x.b<y.b;
}
int main()
{
int n,m,k=0;
while(cin>>n>>m)
{
if(n==0&&m==0) break;
int i,j,p=0;
for(i=0;i<n;i++)
{
scanf("%lf%lf",&s[i].a,&s[i].b);
if(s[i].b<0||s[i].b>m)
p=1;
l[i].a=s[i].a-sqrt(m*m-s[i].b*s[i].b);
l[i].b=s[i].a+sqrt(m*m-s[i].b*s[i].b);
}
sort(l,l+n,cmp);
int sum=1; double r=l[0].b;
for(i=1;i<n;i++)
{
if(l[i].a>r)
{
r=l[i].b;
sum++;
}
}
printf("Case %d: ",++k);
if(p)
cout<<-1<<endl;
else
cout<<sum<<endl;
}
return 0;
}