2016SDAU编程练习一1011

Problem L

Problem DescriptionAssume 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

 

 

InputThe 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. <br> <br>The input is terminated by a line containing pair of zeros <br>
 

OutputFor 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 Input3 2
1 2
-3 1
2 1

1 2
0 2

0 0

 

题意：雷达覆盖问题

 

思路：一开始没太明白，其实卡边界就行了

 

感想：借鉴了别人的

 

AC代码：

#include <iostream>
#include <algorithm>
#include <cmath>
#include<stdio.h>
using namespace std;
const int N = 1001;
struct SCOPE
{
    double l,r;
}scope[N];
bool cmp(SCOPE a, SCOPE b)
{
    return a.l<b.l;
}
int main()
{
    int n,R,i,Case=0;
    double x,y,t;
    while(scanf("%d %d", &n, &R),(n+R))
    {
        int ans=1;
        for(i=0; i<n; i++)
        {
            scanf("%lf %lf", &x, &y);
            scope[i].l = x - sqrt(R*R-y*y);
            scope[i].r = x + sqrt(R*R-y*y);
            if(y>R || R<=0 || y<0) ans=-1;
        }
        sort(scope, scope+n,cmp);
        t = scope[0].r;
        for(i=1; i<n && ans!=-1; i++)
        if(scope[i].l>t)
        {
            ans++;
            t = scope[i].r;
        }
        else if(scope[i].r<t) t=scope[i].r;
        printf("Case %d: %d\n",++Case, ans);
    }
    return 0;
}
 

Sample OutputCase 1: 2
Case 2: 1