二分答案以后就是不能经过若干圆,能否从(1,1)走到(n,m)
只要(1,m),(n,1)不连通即可。
并查集维护一波即可。
复杂度
O(n2logw)
O
(
n
2
l
o
g
w
)
#include <bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
#define ll long long
#define N 3010
#define eps 1e-3
inline char gc(){
static char buf[1<<16],*S,*T;
if(T==S){T=(S=buf)+fread(buf,1,1<<16,stdin);if(T==S) return EOF;}
return *S++;
}
inline int read(){
int x=0,f=1;char ch=gc();
while(ch<'0'||ch>'9'){if(ch=='-') f=-1;ch=gc();}
while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=gc();
return x*f;
}
int n,a,b,fa[N];
struct Point{
int x,y;
}c[N];
inline int find(int x){return x==fa[x]?x:fa[x]=find(fa[x]);}
inline void merge(int x,int y){
int xx=find(x),yy=find(y);
if(xx!=yy) fa[xx]=yy;
}
inline double sqr(double x){return x*x;}
inline double dis(int i,int j){
return sqr(c[i].x-c[j].x)+sqr(c[i].y-c[j].y);
}
inline bool jud(double r){
for(int i=0;i<=n+1;++i) fa[i]=i;
for(int i=1;i<=n;++i){
if(c[i].x-r<=1||c[i].y+r>=b) merge(0,i);
if(c[i].x+r>=a||c[i].y-r<=1) merge(i,n+1);
for(int j=1;j<i;++j)
if(dis(i,j)<=sqr(2*r)) merge(i,j);
}return find(0)!=find(n+1);
}
int main(){
// freopen("a.in","r",stdin);
n=read();a=read();b=read();
for(int i=1;i<=n;++i) c[i].x=read(),c[i].y=read();
double l=0,r=min(a,b);
while(r-l>eps){
double mid=(r+l)/2;
if(jud(mid)) l=mid;
else r=mid;
}printf("%.2lf\n",l);
return 0;
}