POJ 1328 Radar Installation（贪心+区间选点问题）

最新推荐文章于 2020-05-10 14:26:18 发布

shao824714565

最新推荐文章于 2020-05-10 14:26:18 发布

阅读量3w

点赞数

分类专栏：贪心

本文链接：https://blog.csdn.net/shao824714565/article/details/51883782

版权

贪心专栏收录该内容

11 篇文章 0 订阅

订阅专栏

Radar Installation

Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64u

Submit Status Practice POJ 1328

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

分析:

这道题目是贪心里面的区间选点问题。贪心策略是：选区间的最右端的点.

思路：首先抽象出这个模型，以海岛为圆心，雷达距离为半径，求出在陆地上的区间，则雷达选在这个区间之类那么必定能够扫描到这个海岛。求出所有区间后，就转化成区间选点问题。

AC代码：

#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<math.h>
using namespace std;
struct sgm
{
    double l,r;
} a[1010];
bool cmp(sgm A,sgm B)
{
    if(A.r!=B.r)
        return  A.r<B.r;
    else
        return A.l>B.l;
}
int main()
{
    int n,m,i,j,cse=1;
    while(scanf("%d%d",&n,&m)&&n+m)
    {
        int x,y,f;
        f=0;
        for(i=0; i<n; i++)
        {
            scanf("%d %d",&x,&y);
            if(y>m)
                f=1;
            else
            {
                a[i].l=(double)x-sqrt((double)(m*m-y*y));
                a[i].r=(double)x+sqrt((double)(m*m-y*y));
            }
        }
        if(f)
            printf("Case %d: -1\n",cse++);
        else
        {
            sort(a,a+n,cmp);
            //for(i=0;i<n;i++)
            //  printf("%lf %lf\n",a[i].l,a[i].r);
            int s=1;
            double x=a[0].r;
            for(i=1; i<n; i++)
            {
                if(a[i].l>x)
                {
                    x=a[i].r;
                    s++;
                }
            }
            printf("Case %d: %d\n",cse++,s);
        }
    }
    return 0;
}