Radar Installation
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 78326 | Accepted: 17518 |
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
通过观察可以发现,能覆盖岛的雷达一定在以岛为圆心,以d为半径的圆内,因为雷达在x轴上,以此可以求出每个岛所对应的
雷达区间,之后题意就转化为了求区间交集。要注意区间坐标的精度问题,至少要用上float才能AC。
#include <iostream> #include <cstdio> #include <cstdlib> #include <cstring> #include <cmath> #include <stack> #include <bitset> #include <queue> #include <set> #include <map> #include <string> #include <algorithm> #define FOP freopen("data.txt","r",stdin) #define inf 0x3f3f3f3f #define maxn 1000010 #define mod 1000000007 #define PI acos(-1.0) #define LL long long using namespace std; struct Point{ int x, y; float l, r; }p[1010]; bool compare(Point p1, Point p2) { if(p1.l == p2.l) return p1.r < p2.r; else return p1.l < p2.l; } int n, d; int main() { int casen = 0; while(scanf("%d%d", &n, &d) && !(n == 0 && d == 0)){ casen++; int ans = 1; bool flag = false; int x, y; for(int i = 1; i <= n; i++) { scanf("%d%d", &x, &y); p[i].x = x, p[i].y = y; if(abs(y) > d){ flag = true; } else { float t = (float)sqrt(d * d - y * y); p[i].l = (float)x - t; p[i].r = (float)x + t; } } if(flag){ printf("Case %d: %d\n", casen, -1); continue; } sort(p + 1, p + n + 1, compare); for(int i = 2; i <= n; i++) { if(p[i-1].r >= p[i].l){ if(p[i-1].r < p[i].r) p[i].r = p[i-1].r; } else { ans++; } } printf("Case %d: %d\n", casen, ans); } return 0; }