题目:
见https://www.acwing.com/problem/content/description/114/
思路:
见https://www.acwing.com/video/89/,有了思路代码就很简单,没思路就难的一批
代码:
#include<iostream>
#include<cmath>
#include<algorithm>
#include<climits>
using namespace std;
const int N=1010;
typedef pair<double,double> PRR;
PRR ranges[N];
int res,r;
bool cmp(PRR A,PRR B)
{
return A.second<B.second;
}
int main()
{
int n,d;
cin>>n>>d;
int flag=0;
for(int i=1;i<=n;i++)
{
int x,y;
cin>>x>>y;
double s=d*d-y*y;
if(s<0)//审题!!!
flag=1;
if(s>=0)
{
ranges[++r].first=x-sqrt(s);
ranges[r].second=x+sqrt(s);
}
}
sort(ranges+1,ranges+r+1,cmp);
double temp=INT_MIN;
for(int i=1;i<=r;i++)
{
if(temp<ranges[i].first)
{
temp=ranges[i].second;
res++;
}
}
if(flag)
cout<<-1<<endl;
else
cout<<res<<endl;
return 0;
}