原题目:http://poj.org/problem?id=1328
题目大意:
code:
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
using namespace std;
#define MaxiL 1010
/* run this program using the console pauser or add your own getch, system("pause") or input loop */
struct isl{
double lx,rx;
friend bool operator<(isl a,isl b){
return a.rx<b.rx;
}
}il[MaxiL];
int r,n;
int distr(){
sort(il,il+n);
int cil=0,res=0;
double crx;
while(cil<n){
crx=il[cil].rx;
cil++;
while(cil<n&&il[cil].lx<=crx&&il[cil].rx>=crx)cil++;
res++;
}
return res;
}
int main(int argc, char** argv) {
// freopen("in.txt","r",stdin);
int x,y;
bool imFlag;
int ncase=0;
double d;
while(scanf("%d%d",&n,&r)!=EOF&&n){
imFlag=false;
for(int i=0;i<n;i++){
scanf("%d%d",&x,&y);
if(y>r||r<0){
imFlag=true;
continue;
}
d=sqrt(r*r-y*y);
il[i].lx=x-d;
il[i].rx=x+d;
}
printf("Case %d: ",++ncase);
if(imFlag)printf("-1\n");
else printf("%d\n",distr());
}
return 0;
}