SDAU课程练习1011

最新推荐文章于 2017-03-27 19:36:30 发布

窦小雨

最新推荐文章于 2017-03-27 19:36:30 发布

阅读量247

点赞数

分类专栏：贪心

本文链接：https://blog.csdn.net/qq_33402621/article/details/50946065

版权

贪心专栏收录该内容

37 篇文章 0 订阅

订阅专栏

Problem 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.
SDAU课程练习1011

Figure A Sample Input of Radar Installations

Problem Description

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.< br>< br>The input is terminated by a line containing pair of zeros< br>

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 
  

题目大意：

x 轴上方有 n 个小岛，现需要在 x 轴上建立雷达，雷达扫描面积为 r 给出 r 后，求覆盖 n 个小岛所需的雷达数量。

思路：

以小岛为圆心，r 为半径的话，圆周与 x 轴有 1 或 2 个交点，记录下来交点的左区间和右区间，按照左区间排序，如果下一个区间和这个区间有重叠的话，不需要建立新的雷达，然后记录重叠区间，依次与下面作比较。

如果不在同意区间，那么雷达数目加 1 。

感想：

写完之后和跃威交流了一下思路，发现我们思路不是很一致，但是推导出来的交点公式却是相同的。这大概说明了我们的思维的确很相似。。

AC代码：

#include
#include
#include
#include
using namespace std;
const int N = 1001;
struct SCOPE
{
double l,r;
}scope[N];
bool cmp(SCOPE a, SCOPE b)
{
return a.l
}
int main()
{
int n,R,i,Case=0;
double x,y,t;
while(scanf("%d %d", &n, &R),(n+R))
{
int ans=1;
for(i=0; i
{
scanf("%lf %lf", &x, &y);
scope[i].l = x - sqrt(R*R-y*y);
scope[i].r = x + sqrt(R*R-y*y);
if(y>R || R<=0 || y<0) ans=-1;
}
sort(scope, scope+n,cmp);
t = scope[0].r;
for(i=1; i
if(scope[i].l>t)
{
ans++;
t = scope[i].r;
}
else if(scope[i].r
printf("Case %d: %d\n",++Case, ans);
}
return 0;
}