贪心——Radar Installation

最新推荐文章于 2022-04-13 21:57:50 发布

CODE_BALL

最新推荐文章于 2022-04-13 21:57:50 发布

阅读量528

点赞数

分类专栏：贪心 POJ

本文链接：https://blog.csdn.net/codeball/article/details/29612791

版权

POJ 同时被 2 个专栏收录

8 篇文章 0 订阅

订阅专栏

贪心

2 篇文章 0 订阅

订阅专栏

Radar Installation

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 50093		Accepted: 11220

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

Beijing 2002

题意：

以X轴为岸边，X轴以上部分为海洋，海洋上分布着小岛，现在要在岸边建立雷达监视小岛，问至少要建多少雷达。

思路：

雷达的监控范围是以D为半径的圆。则以小岛为圆心，以D为半径画圆，这个圆与X轴的交点区间就是可以放置雷达的区间，若小岛的Y大于D，则无论如何都与X轴没有交点，则不会完全覆盖。

在都有交点的前提下，这些区间就转换成了最基本的贪心问题——选活动，一个区间的起点大于前面所有区间的起点终点，则应该在建设一个雷达。

#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>

using namespace std;

struct node
{
    double qd;
    double zd;
};
struct node cun[1000000];

int cmp(struct node i,struct node j)
{
    return i.zd < j.zd;
}

int main()
{
    double x,y,d,bj,j;
    int i,k,num,n;
    double xx;
    for(k = 1;; k++)
    {
        scanf("%d%lf",&n,&d);
        bj = 1;
        num = 0;
        if(n == 0 && d == 0)
            break;
        for(i = 0; i < n; i++)
        {
            scanf("%lf%lf",&x,&y);
            if(y > d)
                bj = 0;
            xx = sqrt(d * d - y * y);
            cun[i].qd = x - xx;
            cun[i].zd = x + xx;
        }
        if(bj == 0)
            printf("Case %d: -1\n",k);
        else
        {
            sort(cun,cun+n,cmp);
            j = cun[0].zd;
            num++;
            for(i = 1; i < n; i++)
            {
                if(cun[i].qd > j)
                {
                    num++;
                    j = cun[i].zd;
                }
            }
            printf("Case %d: %d\n",k,num);
        }
    }
    return 0;
}