【SHOI2014】【BZOJ3564】【洛谷P4288】信号增幅仪（坐标旋转）（最小圆覆盖）

BZOJ传送门

洛谷传送门

---

题解：

显然直接坐标旋转+放缩可以把问题转化为最小圆覆盖。

---

代码：

#include<bits/stdc++.h>
#define ll long long
#define re register
#define cs const

cs double PI=acos(-1),eps=1e-6;
struct Point{
	double x,y;
	Point(){}
	Point(double _x,double _y):x(_x),y(_y){}
	friend Point operator+(cs Point &a,cs Point &b){return Point(a.x+b.x,a.y+b.y);}
	friend Point operator-(cs Point &a,cs Point &b){return Point(a.x-b.x,a.y-b.y);}
	friend Point operator*(cs Point &a,double b){return Point(a.x*b,a.y*b);}
	friend double operator*(cs Point &a,cs Point &b){return a.x*b.y-a.y*b.x;}
	inline double norm()cs{return x*x+y*y;}
	inline Point rotate(double rad)cs{return Point(x*cos(rad)-y*sin(rad),x*sin(rad)+y*cos(rad));}
	inline Point rotate(double s,double c)cs{return Point(x*c-y*s,x*s+y*c);}
};

inline double dist(cs Point &a,cs Point &b){return sqrt((a-b).norm());}

struct Cir{
	Point O;double r;
	Cir(){}
	Cir(cs Point &_O,double _r):O(_O),r(_r){}
	inline bool in(cs Point &p){return r+eps>dist(O,p);}
};

inline Cir get_Cir(cs Point &p1,cs Point &p2,cs Point &p3){
	if(fabs((p1-p2)*(p2-p3))<eps){
		if(p1.x==p2.x){
			if((p1.y<p2.y)==(p2.y<p3.y))return Cir((p1+p3)*0.5,dist(p1,p2)*0.5);
			if((p1.y<p3.y)==(p3.y<p2.y))return Cir((p1+p2)*0.5,dist(p1,p2)*0.5);
			return Cir((p2+p3)*0.5,dist(p2,p3)*0.5);
		}
		else {
			if((p1.x<p2.x)==(p2.x<p3.x))return Cir((p1+p3)*0.5,dist(p1,p2)*0.5);
			if((p1.x<p3.x)==(p3.x<p2.x))return Cir((p1+p2)*0.5,dist(p1,p2)*0.5);
			return Cir((p2+p3)*0.5,dist(p2,p3)*0.5);
		}
	}
	double a=p2.x-p1.x,b=p2.y-p1.y,c=p3.x-p2.x,d=p3.y-p2.y;
	double e=p2.norm()-p1.norm(),f=p3.norm()-p2.norm();
	Point O=Point(0.5*(b*f-d*e)/(b*c-a*d),0.5*(a*f-c*e)/(a*d-b*c));
	return Cir(O,dist(O,p1));
}

cs int N=5e4+7;

int n;
Point p[N];
Cir C;
double b,s,c,d;
signed main(){
#ifdef zxyoi
	freopen("amplifier.in","r",stdin);
#endif
	scanf("%d",&n);
	for(int re i=1;i<=n;++i)scanf("%lf%lf",&p[i].x,&p[i].y);
	scanf("%lf%lf",&b,&d);b=(360-b)/180*PI;s=sin(b),c=cos(b);d=1/d;
	for(int re i=1;i<=n;++i)p[i]=p[i].rotate(s,c),p[i].x*=d;
	srand(time(0));std::random_shuffle(p+1,p+n+1);
	C=Cir(p[1],0);
	for(int re i=1;i<=n;++i)if(!C.in(p[i])){
		C.O=p[i];
		for(int re j=1;j<i;++j)if(!C.in(p[j])){
			C.O=(p[i]+p[j])*0.5;
			C.r=dist(C.O,p[j]);
			for(int re k=1;k<j;++k)if(!C.in(p[k]))C=get_Cir(p[i],p[j],p[k]);
		}
	}
	printf("%.3f\n",C.r);
	return 0;
}