Radar Installation-CSDN博客

本文链接：https://blog.csdn.net/lv414333532/article/details/47017749

Radar Installation

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 63159		Accepted: 14205

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

Sample Output

Case 1: 2
Case 2: 1

Source

#include <iostream>
#include<cstring>
#include<queue>
#include<stack>
#include<algorithm>
#include<cmath>
#include<cstdio>
using namespace std;
struct node
{
  double  l,r;
} que[1010];
bool cmp(node a,node b)
{

    return a.l<b.l;
}
int main()
{
    int n,m;
    bool flag;
    int k=0;
    int x,y;

    double R;
    while(~scanf("%d%d",&n,&m)&&(m+n))
    {
        flag=0;
        for(int i=0; i<n; i++)
        {
            scanf("%d%d",&x,&y);

            if(y>m)
                flag=1;
            else
            {
                R=sqrt(m*m-y*y);
                que[i].l=x-R;                 //能使第i个被岛屿覆盖的灯被安排的范围）

                que[i].r=x+R;
            }


        }
        if(flag)
        {
            printf("Case %d: -1\n",++k);
            continue;
        }
        sort(que,que+n,cmp);
        int ans=1;
        double rr=que[0].r;
        for(int i=1; i<n; i++)
        {

            if(que[i].r<=rr)
            {
                rr=que[i].r;
            }
            else if(que[i].l>rr)
            {
                ans++;

                rr=que[i].r;
            }
        }
        printf("Case %d: %d\n",++k,ans);

    }
    return 0;
}