Once upon a time there was a greedy King who ordered his chief Architect to build a wall around the King's castle. The King was so greedy, that he would not listen to his Architect's proposals to build a beautiful brick wall with a perfect shape and nice tall towers. Instead, he ordered to build the wall around the whole castle using the least amount of stone and labor, but demanded that the wall should not come closer to the castle than a certain distance. If the King finds that the Architect has used more resources to build the wall than it was absolutely necessary to satisfy those requirements, then the Architect will loose his head. Moreover, he demanded Architect to introduce at once a plan of the wall listing the exact amount of resources that are needed to build the wall.
Your task is to help poor Architect to save his head, by writing a program that will find the minimum possible length of the wall that he could build around the castle to satisfy King's requirements.
The task is somewhat simplified by the fact, that the King's castle has a polygonal shape and is situated on a flat ground. The Architect has already established a Cartesian coordinate system and has precisely measured the coordinates of all castle's vertices in feet.
Your task is to help poor Architect to save his head, by writing a program that will find the minimum possible length of the wall that he could build around the castle to satisfy King's requirements.
The task is somewhat simplified by the fact, that the King's castle has a polygonal shape and is situated on a flat ground. The Architect has already established a Cartesian coordinate system and has precisely measured the coordinates of all castle's vertices in feet.
Next N lines describe coordinates of castle's vertices in a clockwise order. Each line contains two integer numbers Xi and Yi separated by a space (-10000 <= Xi, Yi <= 10000) that represent the coordinates of ith vertex. All vertices are different and the sides of the castle do not intersect anywhere except for vertices.
This problem contains multiple test cases!
The first line of a multiple input is an integer N, then a blank line followed by N input blocks. Each input block is in the format indicated in the problem description. There is a blank line between input blocks.
The output format consists of N output blocks. There is a blank line between output blocks.
1 9 100 200 400 300 400 300 300 400 300 400 400 500 400 500 200 350 200 200 200
1628
#include<bits/stdc++.h>
using namespace std;
#define pi acos(-1.0)
const double eps=1e-6;
struct point
{
double x,y;
}a[1100],b[1100];
double dis(point p1,point p2)
{
return sqrt((p1.x-p2.x)*(p1.x-p2.x)+(p1.y-p2.y)*(p1.y-p2.y));
}
double cross(point p1,point p2,point p3)//积分
{
return (p2.x-p1.x)*(p3.y-p1.y)-(p3.x-p1.x)*(p2.y-p1.y);
}
bool cmp1(point p1,point p2)
{
if(p1.y==p2.y) return p1.x<p2.x;
return p1.y<p2.y;
}
bool cmp2(point p1,point p2) //极角排序
{
int tmp=cross(a[0],p1,p2);
if(tmp>0) return 1;
else if(tmp==0&&dis(a[0],p1)<dis(a[0],p2)) return 1;
return 0;
}
double graham(int n) //凸包
{
b[0]=a[0];
b[1]=a[1];
int top=1;
for(int i=2;i<n;i++)
{
while(top>0&&cross(b[top-1],b[top],a[i])<=0) top--;
top++;
b[top]=a[i];
}
double sum=0;
for(int i=0;i<top;i++)
{
sum+=dis(b[i],b[i+1]);
}
sum+=dis(b[top],b[0]);
return sum;
}
int main()
{
int t,r,n;
scanf("%d",&t);
while(t--)
{
scanf("%d%d",&n,&r);
for(int i=0;i<n;i++)
scanf("%lf%lf",&a[i].x,&a[i].y);
sort(a,a+n,cmp1);
sort(a+1,a+n,cmp2);
double ans=graham(n)+2.0*r*pi;
printf("%.0lf\n",ans);
if(t!=0)
puts("");
}
}