//#pragma GCC optimize(3,"Ofast","inline") #include #include #include #include #define LD double #define LL long long #define Re register int #define Rd register LD #define Vector Point using namespace std; const int N=2003; const LD eps=1e-13; int n,m;mapvis; inline int dcmp(Rd a){return a<-eps?-1:(a>eps?1:0);} struct Point{ LD x,y;Point(LD X=0,LD Y=0){x=X,y=Y;} inline void in(){scanf("%lf%lf",&x,&y);} }; struct Segment{ LD L,R;Segment(LD l=0,LD r=0){L=l,R=r;} inline bool operator<(Segment O)const{return L!=O.L?L0&&dcmp(Y-C[i].U)<0){ Rd tmp=sqrt(SS(C[i].r)-SS(C[i].y-Y)); if(dcmp(tmp)>0)Seg[++t]=Segment(C[i].x-tmp,C[i].x+tmp); } if(!t)return 0.0; sort(Seg+1,Seg+t+1); for(Re i=1,j;i<=t;i=j+1){ Rd L=Seg[i].L,R=Seg[i].R;j=i; while(j=1;--i){ Re flag=1; for(Re j=1;j<=n&&flag;++j) if(dcmp(C_[i].r-C[j].r+dis(C_[i],C[j]))<=0)flag=0; if(flag)C[++n]=C_[i]; } sort(C+1,C+n+1); for(Re i=1,j;i<=n;i=j+1){ Rd D=C[i].D,U=C[i].U;j=i; while(j