gym 101158J 2016-2017 ACM-ICPC, Asia Tsukuba Regional Contest

比赛的时候spj冇得，以为随便交一发过了爆炸高兴，第一次比赛中写200行的计算几何就1A了，然后rejudge就没了。

后来发现确实不能取最小圆覆盖的圆心，而由于这是个凸包，圆心肯定在凸包内时面积才能取到最大值，所以可以再凸包内三分套三分找圆心，可以感受到三分x后三分y一个向上凸的函数，是可以取到极值的。

然后套多边形和圆求相交面积的模板就行了。

#include<bits/stdc++.h>
#define maxl 110
#define eps 1e-12
using namespace std;
const double pi=acos(-1.0);

inline int sgn(double x)
{
	if(x>-eps && x<eps) return 0;
	if(x>0)	return 1;
	else	return -1;
}
struct point
{
	double x,y;
	point(double a=0,double b=0)
	{
		x=a,y=b;
	}
	point operator - (const point b) const
	{
		return point(x-b.x,y-b.y);
	}
	point operator + (const point b)const
	{
		return point(x+b.x,y+b.y);
	}
	friend point operator * (const double t,const point p)
	{
		return point(t*p.x,t*p.y);
	}
	inline void transxy(double b)//逆时针旋转b弧度
	{
		double tx=x,ty=y;
		x=tx*cos(b)-ty*sin(b);
		y=tx*sin(b)+ty*cos(b);
	}
	void transxy(double sinb,double cosb)
	{
		double tx=x,ty=y;
		x=tx*cosb-ty*sinb;
		y=tx*sinb+ty*cosb;
	}
	inline double norm()
	{
		return sqrt(x*x+y*y);
	}
};
inline double det(const point a,const point b)
{
	return a.x*b.y-a.y*b.x;
}
inline double dot(const point a,const point b)
{
	return a.x*b.x+a.y*b.y;
}
struct line
{
	point s,e;
	double k;
	line(point a=point(),point b=point())
	{
		s=a;e=b;
		k=atan2(e.y-s.y,e.x-s.x);
	}
};

int n;
point a[maxl],res[maxl];
double R,radius,ans;

inline void prework()
{
	scanf("%d%lf",&n,&R);
	for(int i=0;i<n;i++)
		scanf("%lf%lf",&a[i].x,&a[i].y);
	a[n]=a[0];
}

double mysqrt(double n)
{
	return sqrt(max(0.0,n));
}
double sqr(double x){return x*x;}

inline void circle_cross_line(line L,point o,double r,point ret[],int &num)
{
	point a=L.s;point b=L.e;
	double x0=o.x,y0=o.y;
	double x1=a.x,y1=a.y;
	double x2=b.x,y2=b.y;
	double dx=x2-x1,dy=y2-y1;
	double A=dx*dx+dy*dy;
	double B=2*dx*(x1-x0)+2*dy*(y1-y0);
	double C=sqr(x1-x0)+sqr(y1-y0)-sqr(r);
	double delta=B*B-4*A*C;
	num=0;
 	if(sgn(delta)>=0)
    {
		double t1=(-B-mysqrt(delta))/(2*A);
		double t2=(-B+mysqrt(delta))/(2*A);
     	if(sgn(t1-1)<=0&&sgn(t1)>=0)
        	ret[num++]=point(x1+t1*dx,y1+t1*dy);
    	if(sgn(t2-1)<=0&&sgn(t2)>=0)
        	ret[num++]=point(x1+t2*dx,y1+t2*dy);
    }
}

double sector_area(const point &a,const point &b)
{
	double theta=atan2(a.y,a.x)-atan2(b.y,b.x);
	while(theta<=0) theta+=2*pi;
	while(theta>2*pi) theta-=2*pi;
	theta=min(theta,2*pi-theta);
	return R*R*theta/2;
}
 
inline double calc(const point &a,const point &b)
{
	point p[2];int num=0;
	bool ina=sgn(sqrt(dot(a,a))-R)<0,inb=sgn(sqrt(dot(b,b))-R)<0;
	if(ina)
	{
		if(inb) return fabs(det(a,b))/2;
		else
		{
			circle_cross_line(line(a,b),point(0,0),R,p,num);
            return fabs(sector_area(b,p[0]))+fabs(det(a,p[0]))/2.0;
		}
	}
	else
	{
		if(inb)
		{
			circle_cross_line(line(a,b),point(0,0),R,p,num);
			return sector_area(p[0],a)+fabs(det(p[0],b))/2;
		}
		else
		{
			circle_cross_line(line(a,b),point(0,0),R,p,num);
			if(num==2)
				return sector_area(a,p[0])+sector_area(p[1],b)+fabs(det(p[0],p[1]))/2.0;
			else
				return sector_area(a,b);
		}
	}
}

double area()
{
	double ret=0;
	for(int i=0;i<n;i++)
	{
		int f=sgn(det(res[i],res[i+1]));
		if(f!=0)
			ret+=f*calc(res[i],res[i+1]);
	}
	return ret;
}

inline double getarea(double x,double y)
{
	for(int i=0;i<=n;i++)
		res[i].x=a[i].x-x,res[i].y=a[i].y-y;
	return area();	
}

inline double getpt(point a,point b,double x)
{
	point v=b-a;
	double t=(x-a.x)/(b.x-a.x);
	return a.y+t*v.y;
}

inline double findy(double x)
{
	
	double ly=1000,ry=0,yy,midy,midmidy;
	for(int i=0;i<n;i++)
	if((a[i].x<=x && a[i+1].x>=x) || (a[i].x>=x && a[i+1].x<=x))
	{
		yy=getpt(a[i],a[i+1],x);
		ly=min(ly,yy);
		ry=max(ry,yy);
	}
	double a1,a2;
	while(ly+eps<ry)
	{
		midy=(ly+ry)/2;
		midmidy=(midy+ry)/2;
		a1=getarea(x,midy);
		a2=getarea(x,midmidy);
		if(a1<a2)
			ly=midy;
		else
			ry=midmidy;
	}
	return getarea(x,ly);
}

inline void mainwork()
{
	double lx=1000,rx=0,midx,midmidx;
	double a1,a2;
	for(int i=0;i<=n;i++)
		lx=min(a[i].x,lx),rx=max(a[i].x,rx); 
	while(lx+eps<rx)
	{
		midx=(lx+rx)/2;
		midmidx=(midx+rx)/2;
		a1=findy(midx);
		a2=findy(midmidx);
		if(findy(midx)<findy(midmidx))
			lx=midx;
		else
			rx=midmidx;
	}
	ans=findy(lx);
}

inline void print()
{
	printf("%.12f",ans);
}

int main()
{
	prework();
	mainwork();
	print();
	return 0;
}