POJ1328-Radar Installation

POJ1328-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.

思路：
      刚开始思路不健全 首先把海岛按x坐标排序，然后根据勾股定理算得第一个雷达的位置 然后判断海盗是否在雷达半径里 写完之后wa 后来发现雷达应该会覆盖其左面的点 进行判断 如果海岛位于雷达左面而到雷达的距离又大于雷达半径 将雷达左移 这样就行了

代码：

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;
struct In
{
    double x;
    double y;
} acm[1000];
int cmp( const void *a ,const void *b)
{
    return ((In *)a)->x - ((In *)b)->x ;
}
int main()
{
    int m,n,i,j,k,count=0;
    double x,y;
    while(~scanf("%d %d",&n,&m)&&n||m)
    {
        int flag=1,f=1;
        count++;
        for(i=0; i<n; i++)
        {
            scanf("%lf %lf",&acm[i].x,&acm[i].y);
            if(acm[i].y>m)
            {
                f=0;
                continue;
            }
        }
        if(f==0)
            printf("Case %d: -1\n",count);
        qsort(acm,n,sizeof(acm[0]),cmp);
        if(f)
        {
            x = acm[0].x+sqrt(((1.0*m*m)-1.0*acm[0].y*acm[0].y));
            // printf("%lf@\n",x);
            for(j=1; j<n; j++)
            {
                if(acm[j].x<x)
                {
                    if(((acm[j].y*acm[j].y)+((x-acm[j].x)*(x-acm[j].x)))>m*m)
                    {
                        x = acm[j].x+sqrt(m*m-acm[j].y*acm[j].y);
                        // printf("%lf %lf %lf$\n",acm[j].x,acm[j].y,x);
                    }
                    else
                    {
                        //printf("%lf %lf %lf$$\n",acm[j].x,acm[j].y,x);
                        continue;
                    }
                }
                else if(((acm[j].y*acm[j].y)+((x-acm[j].x)*(x-acm[j].x)))<=m*m)
                {
                    // printf("%lf %lf@\n",acm[j].x,acm[j].y);
                    continue;
                }
                else
                {
                    flag++;
                    x = acm[j].x+sqrt((m*m)-(acm[j].y*acm[j].y));
                    // printf("%lf %lf %lf!\n",acm[j].x,acm[j].y,x);
                }
            }
            printf("Case %d: %d\n",count,flag);
        }
    }
    return 0;
}