291人阅读 评论(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;
}
0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：344071次
• 积分：10449
• 等级：
• 排名：第1673名
• 原创：675篇
• 转载：2篇
• 译文：0篇
• 评论：115条
博主信箱
相关链接
博客专栏
 POJ题目小练 文章：100篇 阅读：55589
文章分类
评论排行
最新评论