题意:
给出N个点,你需要建一堵围墙使得所有点都在围墙内并且围墙不能建在距离建筑L米范围内,求墙的最短边长。
题解:
求凸包,对满足围墙在点L米范围之外只需要将每条凸包的边向外平移L米,并补上一些圆弧即可,圆弧的弧度相加刚好凑出一个原,因此最终答案即凸包的边长+一个半径为L的圆的边长。
#define _CRT_SECURE_NO_WARNINGS
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<vector>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const LL N = 1e3 + 10, MOD = 1e9 + 7, INF = 0x3f3f3f3f;
const double pi = acos(-1);
PII p[N];
int book[N];
int cross(PII x, PII y)//向量叉乘
{
return x.first * y.second - x.second * y.first;
}
PII get_v(PII u, PII v)//求向量
{
return { v.first - u.first ,v.second - u.second };
}
bool check(vector<int>& v,PII z)//判断是否为逆时针
{
int t = v.size();
PII x = p[v[t - 2]], y = p[v[t - 1]];
return cross(get_v(x, y), get_v(y, z)) <= 0;
}
double get_d(PII x, PII y)//求两点间距离
{
int dx = x.first - y.first, dy = x.second - y.second;
return sqrt(dx * dx + dy * dy);
}
double get_sum(vector<int>& v)//求下/上凸包的总边长
{
double res = 0;
for (int i = 1; i < v.size(); ++i)
res += get_d(p[v[i - 1]], p[v[i]]);
return res;
}
void solve()
{
int n, l;
scanf("%d%d", &n, &l);
double ans = 2 * pi * l;//圆的边长
for (int i = 1; i <= n; ++i)
scanf("%d%d", &p[i].first, &p[i].second);
sort(p + 1, p + 1 + n, [&](PII x, PII y) {
if (x.first != y.first)
return x.first < y.first;
return x.second < y.second;
});//按x为第一优先级,y为第二优先级排序
vector<int>v;
for (int i = 1; i <= n; ++i)//下凸包
{
while (v.size() >= 2 && !check(v, p[i]))
v.pop_back();
v.push_back(i);
}
ans += get_sum(v);
for (auto i : v)
book[i] = 1;//记录下凸包中使用的点
v.clear();
book[1] = book[n] = 0;//起点和终点还要用
for (int i = n; i >= 1; --i)if (!book[i])//上凸包
{
while (v.size() >= 2 && !check(v, p[i]))
v.pop_back();
v.push_back(i);
}
ans += get_sum(v);
printf("%.0f\n", ans);
}
int main()
{
int T = 1;
//scanf("%d", &T);
while (T--)
{
solve();
}
return 0;
}