hdu1348

Wall

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 3257    Accepted Submission(s): 931

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

 

题意：要在城堡外面建立城墙，要求城堡任意点的距离与城墙的距离>=r，求所建城墙的周长最短。
思路：该题是凸包问题，墙的周长 = 凸包的周长 + 以r为半径的圆的周长。

 

#include<algorithm>
#include<stdio.h>
#include<string>
#include<string.h>
#include<math.h>
#include<queue>
#include<map>
#include<iostream>
using namespace std;
#define N 1010
const double PI=acos(-1.0);
struct point
{
    double x,y,angel;
} p[N],stack[N];
int top,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));
}

bool mult(point p1,point p2,point p0)//叉乘
{
    return (p1.x-p0.x)*(p2.y-p0.y) >= (p2.x-p0.x)*(p1.y-p0.y);
}

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

void graham()
{
//p为点集，n为点的个数，stack为凸包点集，top为凸包个数
    int i,k=0;
    point temp;
    for(i=0; i<n; i++)
        if(p[i].y<p[k].y||((p[i].y==p[k].y)&&(p[i].x<p[k].x)))
            k=i;
    temp=p[0];
    p[0]=p[k];
    p[k]=temp;
    for(i=1; i<n; i++)
        p[i].angel=atan2(p[i].y-p[0].y,p[i].x-p[0].x);
    sort(p+1,p+n,cmp);
    stack[0]=p[0];
    stack[1]=p[1];
    stack[2]=p[2];
    top=3;
    for(i=3; i<n; i++)
    {
        while(top > 2 && mult(stack[top-2],stack[top-1],p[i])<=0)
            top--;
        stack[top++]=p[i];
    }
}

int main()
{
    int T,i,flag=0;
    double r,ans;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%lf",&n,&r);
        for(i=0; i<n; i++)
            scanf("%lf%lf",&p[i].x,&p[i].y);
        graham();
        ans=0;
        for(i=0; i<top-1; i++)
            ans+=dis(stack[i],stack[i+1]);
        ans+=dis(stack[top-1],stack[0]);
        ans+=2*PI*r;
        if(flag==1)
            printf("\n");
        printf("%.0lf\n",ans);
        flag=1;
    }
    return 0;
}