计算几何专项：LA 2453

先求一遍凸包，然后根据凸包就可以求出所求的围墙长度了。具体的方法就是凸包周长加上每个顶点构成的一段以L为半径的圆弧。至于最后的精度问题，只要四舍五入就可以了。

#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
using namespace std;
const double eps=1e-6;
const double pi=acos(-1.0);
int dcmp(double x)
{
    if(fabs(x)<eps) return 0;
    else return x<0?-1:1;
}
struct point
{
    double x,y;
    point(double x=0,double y=0):x(x),y(y){}
};
point operator-(point a,point b){return point(a.x-b.x,a.y-b.y);}
point operator+(point a,point b){return point(a.x+b.x,a.y+b.y);}
bool operator<(const point& a ,const point& b)
{
    return dcmp(a.x-b.x)<0||(dcmp(a.x-b.x)==0&&dcmp(a.y-b.y)<0);
}
double cross(point a,point b){return a.x*b.y-a.y*b.x;}
double dot(point a,point b){return a.x*b.x+a.y*b.y;}
double length(point a){return sqrt(dot(a,a));}
double angle(point a,point b){return acos(dot(a,b)/length(a)/length(b));}
double convex(vector<point> p,double l)
{
    sort(p.begin(),p.end());
    int n=p.size();
    vector<point> ch(n+1);
    int m=0;
    for(int i=0;i<n;i++)
    {
        while(m>1&&cross(ch[m-1]-ch[m-2],p[i]-ch[m-2])<=0) m--;
        ch[m++]=p[i];
    }
    int k=m;
    for(int i=n-2;i>=0;i--)
    {
        while(m>k&&cross(ch[m-1]-ch[m-2],p[i]-ch[m-2])<=0) m--;
        ch[m++]=p[i];
    }
    if(n>1) m--;
    ch.resize(m);
    double ans=0;
    for(int i=0;i<m;i++)
    {
        point p1=ch[i],p2=ch[(i-1+m)%m],p3=ch[(i+1)%m];
        ans+=length(p3-p1);
        ans+=(pi-angle(p1-p2,p1-p3))*l;
    }
    return ans;
}
int n,l;
vector<point> p;
int main()
{
    int T;
    cin>>T;
    while(T--)
    {
        p.clear();
        cin>>n>>l;
        for(int i=0;i<n;i++)
        {
            int x,y;
            cin>>x>>y;
            p.push_back(point(x,y));
        }
        double ans=convex(p,l);
        int res=(ans+0.5);
        cout<<res<<endl;
        if(T) cout<<endl;
    }
    return 0;
}