描述
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
输入
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
输出
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.
样例输入
3 2
1 2
-3 1
2 1
1 2
0 2
0 0
样例输出
Case 1: 2
Case 2: 1
来源
Beijing 2002
http://bailian.openjudge.cn/practice/1328
#include <iostream>
#include <algorithm>
#include <math.h>
#include <string.h>
/* run this program using the console pauser or add your own getch, system("pause") or input loop */
using namespace std;
const int N=1010;
struct Node{
double a,b;
}node[N];
int n,d;
int x,y;
bool cmp(Node m,Node n){
return m.b<n.b;
}
int main(int argc, char** argv) {
int cnt = 1;
while(cin >> n >> d , n!=0 )
{
int flag = 0;
for(int i = 0 ; i < n ; i++ )
{
cin >> x >> y;
if( y > d )
{
flag = 1;
}
if ( flag == 0)
{
node[i].a= x - (double)sqrt(double(d*d-y*y));
node[i].b= x + (double)sqrt(double(d*d-y*y));
}
}
if(flag == 1)printf("Case %d: -1\n",cnt++);
if(flag == 0)
{
sort(node,node+n,cmp);
int res = 0 ;
double ed =-1e9;
for(int i = 0 ; i < n ; i++)
{
if(node[i].a > ed)
{
res++ ;
ed = node[i].b;
}
}
printf("Case %d: %d\n",cnt++,res);
}
}
return 0;
}