Radar nyist287

Radar

时间限制： 1000 ms  |  内存限制： 65535 KB

难度： 3

描述

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.

 

输入

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

思路：

贪心。

#include <iostream>
#include <algorithm>
#include <cmath>

using namespace std;

#define MAXN 1001

struct Node
{
	double s, e;
}node[MAXN];

bool cmp(Node a, Node b)
{
	return a.s < b.s;
}

void input()
{
	int n, d, k = 0;
	int x, y;
	
	while (cin >> n >> d, n || d)
	{
		bool flag = true;
		int tot = 0;
		
		for (int i = 0; i < n; i++)
		{
			cin >> x >> y;
			
			if (y <= d)
			{
				double len = sqrt(d * d - y * y);
				
				node[tot].s = x - len;
				node[tot].e = x + len;
				tot++;
			}
			else
			{
				flag = false;
			}
		}
		
		cout << "Case " << ++k << ": ";
		
		if (!flag)
		{
			cout << -1 << endl;
		}
		else
		{
			int ans = 1;
			
			sort(node, node + tot, cmp);
			double temp = node[0].e;
			
			for (int i = 1; i < tot; i++)
			{
				if (node[i].s > temp)
				{
					ans++;
					temp = node[i].e;
				}
				else if (node[i].e < temp)
				{
					temp = node[i].e;
				}
			}
			
			cout << ans << endl;
		}
	}
}

int main()
{
	std::ios::sync_with_stdio(false);
	input();
	return 0;
}