Radar Installation
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
题目大意:如图x轴为海岸线,下面为陆地,上面为海,在海上有n个小岛,现在海岸线上装雷达,求最少需要装多少个雷达才能覆盖全部岛屿,d为雷达覆盖的半径
思路:求出能覆盖 i 岛屿的雷达x坐标的区间,贪心求最少雷达数
代码:
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
using namespace std;
struct node
{
double l,r;
}a[1005];
bool cmp(node a,node b)
{
if(a.r==b.r)
return a.l<b.l;
return a.r<b.r;
}
int main()
{
int n,d,t=1;
while(~scanf("%d%d",&n,&d)&&(n+d))
{
int maxx=0,x,y;
double m;
for(int i=0;i<n;i++)
{
scanf("%d%d",&x,&y);
if(maxx<y)maxx=y;
m=sqrt(d*d-y*y*1.0);
a[i].l=x-m,a[i].r=x+m;
}
if(maxx>d){printf("Case %d: -1\n",t++);continue;}
sort(a,a+n,cmp);
int ans=1;
double s=a[0].r;
for(int i=1;i<n;i++)
{
if(a[i].l<=s&&a[i].r>=s) continue;
else
{
ans++;
s=a[i].r;
}
}
printf("Case %d: %d\n",t++,ans);
}
return 0;
}