poj1113---计算几何

//求最少的边长把城池围住
//其实就是求凸包的周长+圆周长

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<math.h>
#include<queue>
#define dist(a,b) sqrt(1.0*(a.x-b.x)*(a.x-b.x)+1.0*(a.y-b.y)*(a.y-b.y))
#define cross(a,b,c) 1.0*(b.x-a.x)*(c.y-a.y)-1.0*(b.y-a.y)*(c.x-a.x)
#define dot(a,b,c) (b.x-a.x)*(c.x-a.x)+(b.y-a.y)*(c.y-a.y)
#define delt(a) fabs(a)<eps?0:a>0?1:-1
#define pi acos(-1.0)
#define eps 1e-8
#define inf 1e20
#define N 1005
#define M 1005
using namespace std;
typedef __int64 i64;
struct TPoint
{
	double x,y;
}pt[N],st,ans[N];
int n,m,t;
void scan()
{
	scanf("%d%d",&n,&t);
	for(int i=0;i<n;i++)
		scanf("%lf%lf",&pt[i].x,&pt[i].y);
}
bool cmpx(TPoint a,TPoint b)
{
	return a.x<b.x||(a.x==b.x&&a.y<b.y);
}
bool cmp(TPoint a,TPoint b)
{
	int d1=delt(cross(pt[0],a,b));
	return d1>0||(d1==0&&dist(pt[0],a)<dist(pt[0],b));
}
void graham()
{
	int i,j;
	for(i=j=2;i<n;i++)
	{
		while(j>1&&delt(cross(pt[j-2],pt[i],pt[j-1]))>0) j--;
		pt[j++]=pt[i];
	}
	n=j;
}
void solve()
{
	int i;
	sort(pt,pt+n,cmpx);
	sort(pt,pt+n,cmp);
	graham();
	pt[n]=pt[0];
	double suml=0;
	for(i=0;i<n;i++) suml+=dist(pt[i],pt[i+1]);
	suml+=2*pi*t;
	printf("%.0f\n",suml);
}
int main()
{
	scan();
	solve();
    return 0;
}