【凸包_Graham】Wall POJ1113

Wall

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 25230		Accepted: 8405

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.

Sample Input

9 100
200 400
300 400
300 300
400 300
400 400
500 400
500 200
350 200
200 200

Sample Output

1628

Hint

结果四舍五入就可以了

Source

Northeastern Europe 2001

题目大意：

告诉你N个点，然后用一个栅栏把这N个点围起来，并且栅栏距离任意一个点都必须要 >=L

由样例我们可以很容易推出最终的答案就是把这N个点求一个凸包（把直线平移一下就得到了），然后在加上半径为L的圆的周长（拐角部分）

第一道凸包的题目，感觉还可以，用的graham算法，代码也挺好写的

测评情况（POJ）（前两次WA又是手残了。。。。）

C++ AC Code

/*http://blog.csdn.net/jiangzh7
By Jiangzh*/
#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
#define sqr(_) ((_)*(_))
const int N=1000+10;
const double pi=4.0*atan(1.0);
int n,L;
struct node{int x,y;}a[N];
int st[N],top;
int P[N],Cnt;

void read()
{
	scanf("%d%d",&n,&L);
	for(int i=1;i<=n;i++) scanf("%d%d",&a[i].x,&a[i].y);
}

bool cmp(node a,node b)
{
	if(a.x==b.x) return a.y<b.y;
	return a.x<b.x;
}

bool cross(int i,int j,int k)
{
	int x1=a[j].x-a[i].x, y1=a[j].y-a[i].y;
	int x2=a[k].x-a[j].x, y2=a[k].y-a[j].y;
	return (x1*y2>=x2*y1);
}

double dis(int i,int j)
{
	return sqrt((double)sqr(a[i].x-a[j].x)+(double)sqr(a[i].y-a[j].y));
}

void work()
{
	sort(a+1,a+1+n,cmp);
	st[top=1]=1;
	for(int i=2;i<=n;i++)
	{
		while(top>1 && cross(st[top],st[top-1],i)) top--;
		st[++top]=i;
	}
	for(int i=1;i<=top;i++) P[Cnt++]=st[i];
	st[top=1]=n;
	for(int i=n-1;i>=1;i--)
	{
		while(top>1 && cross(st[top],st[top-1],i)) top--;
		st[++top]=i;
	}
	for(int i=2;i<=top;i++) P[Cnt++]=st[i];
	double res=0.0;
	for(int i=1;i<Cnt;i++) res+=dis(P[i],P[i-1]);
	res+=pi*2.0*(double)L;
	printf("%d\n",(int)(res+0.5));
}

int main()
{
	freopen("poj1113.in","r",stdin);
	freopen("poj1113.out","w",stdout);
	read();
	work();
	return 0;
}