poj1328 Radar Installation

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

每天都要有进步

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

阅读量355

点赞数

分类专栏：暑假acm

本文链接：https://blog.csdn.net/u011472124/article/details/9412293

版权

暑假acm 专栏收录该内容

7 篇文章 0 订阅

订阅专栏

Radar Installation

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 41948		Accepted: 9286

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

简单的一题贪心，居然在pe上纠结半天。。

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
using namespace std;

struct point{
int x; int y;}p[1001];

int cmp(const void *a,const void *b){
struct point *c = (point*)a;
struct point *d = (point*)b;
if(c->x!=d->x)
    return c->x - d->x;
else
    return d->y - c->y;
}

int main()
{
    int case1=0,d,n,count=1;
    bool flag;
    while(1){
    case1++;
    count = 1;
    flag = false;
    cin>>n;
    cin>>d;
    if(n==0&&d==0)
        break;
    for(int i=0;i<n;i++)
    {
        cin>>p[i].x;
        cin>>p[i].y;
        if(p[i].y>d)
            flag=true;
    }
    if(flag){
        count = -1;
        goto end;
    }

    qsort(p,n,sizeof(p[0]),cmp);

    double left[1000],right[1000],temp;
    for(int i=0;i<n;i++)
        {
            left[i]=p[i].x-sqrt(d*d-p[i].y*p[i].y);
            right[i]=p[i].x+sqrt(d*d-p[i].y*p[i].y);
        }
        temp = right[0];

    for(int i=1;i<n;i++){
        if(right[i]<temp)
            temp=right[i];
        else if(temp<left[i]){
            count++;
            temp = right[i];
        }
    }
    end:
     cout<<"Case "<<case1<<": "<<count<<endl;
    }
     return 0;
}