POJ Radar Installation （贪心）

Radar Installation

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 20000/10000K (Java/Other)

Total Submission(s) : 93   Accepted Submission(s) : 46

Problem 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


ac代码：
 
   
   
#include<stdio.h>
#include<string.h>
#include<iostream>
#include<math.h>
#include<algorithm>
#define MAXN 1010
using namespace std;
struct s
{
    double x;
    double y;
}d[MAXN];
bool cmp(s a,s b)
{
    if(a.x==b.x)
    return a.y>b.y;
    return a.x<b.x;
}
int main()
{
    int m,n,i;
    double s,really;
    int sum=0;
    int a,b;
    while(scanf("%d%d",&n,&m)!=EOF,m||n)
    {
        int bz=0;
        for(i=0;i<n;i++)
        {
            scanf("%d%d",&a,&b);
            d[i].x=double(a)-sqrt(double(m*m-b*b));
            d[i].y=double(a)+sqrt(double(m*m-b*b));
            if(b>m)
            bz=1;
        }
        if(bz)
        printf("-1\n");
        else
        {
            sort(d,d+n,cmp);
            double really=d[0].y;
            int num=1;
            for(i=1;i<n;i++)
            {
                if(d[i].x>really)
                {
                    num++;
                    really=d[i].y;
                }
            }
            printf("Case %d: %d\n",++sum,num);
        }
    }
    return 0;
}