POJ 1328 Radar Installation(贪心)

Radar Installation

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 93311		Accepted: 20834

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

思路:转化为区间找点问题

代码:

#include<stdio.h>
#include<math.h>
#include<algorithm>
using namespace std;

struct coor
{
    double head,tail;
}island[1005];

bool cmp(coor a,coor b)
{
    if(a.tail!=b.tail)return a.tail<b.tail;
    else return a.tail<b.tail;
}

int main()
{
    int n,r,i,cnt=0;
    double x,y;
    while(scanf("%d%d",&n,&r),n||r)
    {
        int ans=1,flag=1;
        for(i=0;i<n;i++)
        {
            scanf("%lf%lf",&x,&y);
            if(r>=y)
            {
                island[i].head=x-sqrt(r*r-y*y);
                island[i].tail=x+sqrt(r*r-y*y);
            }
            else
                flag=0;
        }
        sort(island,island+n,cmp);
        int j=0;
        for(i=1;i<n;i++)
        {
            if(island[i].head>island[j].tail)
            {
                ans++;
                j=i;
            }
        }
        if(flag==0)printf("Case %d: -1\n",++cnt);
        else printf("Case %d: %d\n",++cnt,ans);
    }
    return 0;
}