1328:Radar Installation
-
总时间限制:
- 1000ms 内存限制:
- 65536kB
-
描述
-
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
输入
-
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
输出
- 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. 样例输入
-
3 2 1 2 -3 1 2 1 1 2 0 2 0 0
样例输出
-
Case 1: 2 Case 2: 1
来源
- Beijing 2002
- 查看
- 提交
- 统计
- 提示
- 提问
-
- 代码:
#include<cstdio> #include<queue> #include<cmath> using namespace std; typedef pair<double, double> PAIR; int main(){ int n, d; int cnt = 0,ans; while(scanf("%d%d",&n,&d) && (n || d)){ ans = 1; priority_queue<PAIR,vector<PAIR>,greater<PAIR> > que; bool flag = false; while(n--){ int a, b; scanf("%d%d",&a,&b); if(fabs(b) > d || flag) flag = true; else{ que.push(PAIR(a - sqrt(d*d - b*b),a + sqrt(d*d - b*b))); } } printf("Case %d: ", ++cnt); if(flag){ ans = -1; }else{ PAIR p = que.top(); que.pop(); while(!que.empty()){ PAIR tmp = que.top(); que.pop(); if(tmp.first > p.second){ ans++; p = tmp; }else if(tmp.second < p.second){ p = tmp; } } } printf("%d\n",ans); } return 0; }