POJ 1328(Radar Installation 区间贪心)

/*雷达安在x轴上
 *给出n个岛的坐标
 *求最少能覆盖所有岛的雷达数
 */
#include<cstdio>
#include<iostream>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<algorithm>
#include<string>
#include<cstring>
#include<cstdlib>
#include<cctype>
#include<cmath>
#include<sstream>
#include<stack>
#include<functional>
using namespace std;
typedef long long ll;
typedef pair<double, double> P;
const int INF=0x3f3f3f3f;
const int MAX_N = 1005;
P interval[MAX_N]; //雷达能覆盖第i个岛的区间
int n;
double d;
int main()
{
	#ifdef LOCAL
		freopen("in.txt","r",stdin);
	//	freopen("out.txt","w",stdout);
	#endif
	//ios::sync_with_stdio(false);
	int kase = 1;
    while(cin >> n >> d && (n || d)){
        double x, y;
        int flag = true;
        for(int i = 0; i < n; i++){
            scanf("%lf %lf", &x, &y);
            if(y > d)flag = false;
            else{
                double disx = sqrt(d * d - y * y);
                interval[i].first = x * 1.0 - disx;
                interval[i].second = x * 1.0 + disx;
                //cout << interval[i].first << " " << interval[i].second << endl;
            }
        }
        if(!flag){
            printf("Case %d: %d\n", kase++, -1);
            continue;
        }
        sort(interval, interval + n);

        int ans = 1;
        P last = interval[0];
        for(int i = 1; i < n; i++){
            if(interval[i].first > last.second){
                ans++;
                last = interval[i];
            }
            else if(interval[i].second < last.second){ //有交区间使用同一个雷达
                last = interval[i];
            }
        }

        printf("Case %d: %d\n", kase++, ans);
    }
	return 0;
}