poj1328——Radar Installation（贪心）

最新推荐文章于 2022-11-27 23:18:23 发布

BYSora

最新推荐文章于 2022-11-27 23:18:23 发布

阅读量510

点赞数

本文链接：https://blog.csdn.net/blue_skyrim/article/details/51556708

版权

动态规划专栏收录该内容

60 篇文章 0 订阅

订阅专栏

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

3 2
1 2
-3 1
2 1

1 2
0 2

0 0
Sample Output

Case 1: 2
Case 2: 1

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <cstdio>
//#include <set>
#include <vector>
#include <iomanip>
#include <stack>
#include <map>
#include <queue>
#define MAXN 1010
#define mod 2012
#define INF 0x3f3f3f3f
using namespace std;
struct Node
{
    double left,right;
};
Node p[MAXN];
bool cmp(Node a,Node b)
{
    return a.left<b.left;
}
int main()
{
    ios::sync_with_stdio(false);
    int n,d,cnt=1;
    double x,y;
    while(cin>>n>>d&&(n||d))
    {
        bool flag=false;
        for(int i=0; i<n; ++i)
        {
            cin>>x>>y;
            p[i].left=x-sqrt(d*d-y*y);
            p[i].right=x+sqrt(d*d-y*y);
            if(fabs(y)>d)
                flag=true;
        }
        cout << "Case " << cnt++ << ": ";
        if(flag)
            cout<<"-1"<<endl;
        else
        {
            sort(p,p+n,cmp);
            int ans=1;
            Node tmp=p[0];
            for(int i=1; i<n; ++i)
            {
                if(p[i].left>tmp.right)
                {
                    ans++;
                    tmp=p[i];
                }
                else if(p[i].right<tmp.right)
                    tmp=p[i];
            }
            cout<<ans<<endl;
        }
    }
    return 0;
}