# include <stdio.h>
# include <algorithm>
# include <math.h>
struct cd
{
double x;
double y;
bool operator < (cd a) const
{
return y<a.y;
}
}a[1001];
int main()
{
int n, d, count, i, j, N, flag, b, c;
N = 1;
// freopen("in.txt","r", stdin);
while (scanf("%d%d", &n, &d)&&n!=0&&d!=0)
{
flag = 0;
for (i = 0; i<n; i++)
{
scanf("%d%d", &b, &c);
if (c>d)
flag = 1;
a[i].x = b-sqrt((double)(d*d-c*c));
a[i].y = b+sqrt((double)(d*d-c*c));
}
if (flag)
{
printf("Case %d: -1\n", N++);
continue;
}
std::sort(a, a+n);
count = 1;
for (i = 0, j = 1; j<n; j++)
{
if (a[i].y<a[j].x)
{
count++;
i = j;
}
}
printf("Case %d: %d\n", N++, count);
}
return 0;
}
算出每个点可能的圆心的区间(注意:可以小数),按区间的右边界从小到大排序,从第一个区间开始,看接下来的区间是否与它有重合的部分,有的话把它们算作一部分,没有的话再从没有重合部分的那个区间往下找,看看最后有几部分!
radar 南工acm
最新推荐文章于 2017-03-28 12:42:23 发布