Radar Installation
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 50359 | Accepted: 11296 |
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
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
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
题意是:把x轴当作海岸线 , x轴上方为海 , 海中有许多小岛在x轴要设置雷达 ,题目给了雷达的覆盖范围半径d, 问要把所有的小岛覆盖 所需雷达的最少数目 。
一道简单的贪心,WA了九遍。。。。。。其原因就是没有考虑e>rr[i]的情况,想当然的以为rr是已排好序的。。。。
代码如下
#include <iostream> #include <stdio.h> #include <math.h> using namespace std; int main() { int n,d,i,j; double ll[1001],rr[1001]; int a[1001],b[1001],t; int x=1; while(scanf("%d%d",&n,&d)&&(n||d)) { int q=1; for(i=0; i<n; i++) { scanf("%d%d",&a[i],&b[i]); if(b[i]>d) q=0; } printf("Case %d:",x++); if(!q||!d) printf(" -1\n"); else { double r=0; int sum=1; for(i=0; i<n-1; i++) { for(j=0; j<n-1-i; j++) { if(a[j]>a[j+1]) { t=a[j]; a[j]=a[j+1]; a[j+1]=t; t=b[j]; b[j]=b[j+1]; b[j+1]=t; } } } for(i=0; i<n; i++) { r=sqrt(d*d-b[i]*b[i]); ll[i]=a[i]-r; //ll和rr分别为 每一个以小岛为圆心,d为半径的圆,在x轴的左右点 rr[i]=a[i]+r; } double e=rr[0]; for(i=1; i<n; i++) { if(e<ll[i]) //相邻的两个 以小岛为圆心,d为半径的圆没有交点 所以sum++ { e=rr[i]; sum++; } if(e>rr[i]) //考虑有的小岛在e左面的情况 e=rr[i]; } printf(" %d\n",sum); } } return 0; }