英文题目翻译day7

雷达装置

描述：

假定海岸线是一个infinite直线。陆地在海岸线的一边，海洋在另一边。每个小岛是位于海边的一个点。并且所有雷达装置，都位于海岸线上，仅可以覆盖距自身距离为d的地方，所以一个海上小岛可以被一个雷达装置覆盖，如果二者之间的距离不大于d的话。

我们使用Cartesian坐标系，定义海岸线为x轴。海边在x轴上方，陆地则在下方。给出每个海上小岛的位置，并给出雷达装置可以覆盖的距离，你的任务是写一个程序来找到可以覆盖所有小岛的最少雷达装置数量。注意一个小岛的的位置由它的x-y坐标表示。

输入由几个测试样例组成。每个样例的第一行包含两个整数n（1<=n<=1000)和d，n是海上小岛的数量而d是雷达装置可以覆盖的距离。接下来n行每行包含两个整数代表每个小岛的坐标。空行来区分样例。

输入由包含一对0的行终止

输出：
每个测试样例由case数及其所需要的最少雷达装置数量组成，“-1”意味着该样例误解。

Radar Installation

描述：

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

原题链接：Problem Detail | ACS 2022寒假第一周周练 (jxnu.edu.cn)