Wall
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7700 Accepted Submission(s): 2238
Problem Description
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.
Input
The first line of the input file contains two integer numbers N and L separated by a space. N (3 <= N <= 1000) is the number of vertices in the King's castle, and L (1 <= L <= 1000) is the minimal number of feet that King allows for the wall to come close to the castle.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.
Output
Write to the output file the single number that represents the minimal possible length of the wall in feet that could be built around the castle to satisfy King's requirements. You must present the integer number of feet to the King, because the floating numbers are not invented yet. However, you must round the result in such a way, that it is accurate to 8 inches (1 foot is equal to 12 inches), since the King will not tolerate larger error in the estimates.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.
Sample Input
1
9 100
200 400
300 400
300 300
400 300
400 400
500 400
500 200
350 200
200 200
Sample Output
1628
//62ms 1896K
#include<stdio.h>
#include<algorithm>
#include<cmath>
using namespace std;
#define N 1005 //顶点个数
const double eps = 1e-6;
const double pi = 3.1415926535 ;
struct point{
double x,y;
};
int n,m;
point res[N];
point p[N];
double dis(point a,point b)
{//求两点距离
return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
}
double xmulti(point p1,point p2,point p0)
{//给出三点坐标求p1p0和p2p0的叉乘,如果大于0,p1在p2的顺时针方向
return (p1.x-p0.x)*(p2.y-p0.y)-(p2.x-p0.x)*(p1.y-p0.y);
}
int cmp(point a,point b)
{//其余点按以p0为中心的极角逆时针排序所得的点集
if(xmulti(a,b,p[0])>0)
return 1;
//极角相同返回距离远的
if(xmulti(a,b,p[0])==0&&dis(b,p[0])-dis(a,p[0])>eps)
return 1;
return 0;
}
int Graham()
{//排序按照极坐标处理,是经典的Graham扫描算法。其余的为改良版
//该算法处理3个点及以上的凸包问题
int k=0;
for(int i=0;i<n;i++)
{//找最左边的点
if(p[k].y>p[i].y||((p[k].y==p[i].y)&&(p[k].x>p[i].x)))
k=i;
}
swap(p[0],p[k]);
int top=2;
sort(p+1,p+n,cmp);
res[0]=p[0];
res[1]=p[1];
res[2]=p[2];
for(int i=3;i<n;i++)
{
while(top>=1&&xmulti(p[i],res[top],res[top-1])>=0)
{
top--;
}
res[++top]=p[i];
}
return top;
}
int main()
{
int T;
scanf("%d",&T);
while(T--)
{
scanf("%d%d",&n,&m);
for(int i=0;i<n;i++)
scanf("%lf%lf",&p[i].x,&p[i].y);
double sum=0;
int top=Graham();
for(int i=1;i<=top;i++)
sum+=dis(res[i],res[i-1]);
//加上凸包封口--最后一个点和p[0]的距离
sum+=dis(res[0],res[top]);
sum+=2*pi*m;//本题还要加上扩大后的凸包直线连接所用的圆弧
printf("%.0lf\n",sum);
if(T)printf("\n");//注意细节每组结束还要多输出一个换行
}
return 0;
}