poj 1328 Radar Installation（区间合并）

题目链接：http://poj.org/problem?id=1328

Radar Installation Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 84040   Accepted: 18768 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 Source Beijing 2002

[Submit]   [Go Back]   [Status]   [Discuss]

Home Page   Go Back  To top

题意：x轴下方是岸，上方是海，海上有岛，在岸边安装反导系统，求最小的反导系统个数，把所有的岛都覆盖住

解析：把所有的区间映射到X轴 上，通过x -（+） sqrt(d*d - y*y)

代码：

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<vector>
#include<stack>
#include<queue>
#define N 1009
using namespace std;
const int INF = 0x3f3f3f3f;

typedef pair<double, double> P;
P X[N];


int main()
{
    int n, d, x, y, cnt = 0;
    while(scanf("%d%d", &n, &d), n + d)
    {
        bool f = false;
        for(int i = 0; i < n; i++)
        {
            scanf("%d%d", &x, &y);
            if(abs(y) > d) f = true;
            X[i].first = x + sqrt(d*d - y*y);
            X[i].second = x - sqrt(d*d - y*y);
        }
        if(f) printf("Case %d: -1\n", ++cnt);
        else
        {
            int ans = 1;
            sort(X, X + n);
            double cur = X[0].first;
            for(int i = 0; i < n; i++)
            {
                if(X[i].second > cur)
                {
                    ans++;
                    cur = X[i].first;
                }
            }
            printf("Case %d: %d\n", ++cnt, ans);
        }
    }
}