2021“MINIEYE杯”中国大学生算法设计超级联赛（HDU多校）第7场 Smzzl with Safe Zone 题解

题面

题目链接

题目大意：

给定两个凸包，保证B凸包在A凸包里面，求B凸包任意一点到A凸包的最短距离的最大值。

做法：

非常明显是一个旋转卡壳。不断模拟可以得到，外凸包上的顶点到内凸包的最短距离必定大于外凸包对应线段上的某点到内凸包的最短距离。所以枚举外凸包的所有顶点对内凸包的距离进行旋转卡壳即可。
本题坑点在于，顶点到内凸包的最短距离有两种情况，一种是连接在内凸包的顶点上，另一种对内凸包某一线段做垂线所得的长度。所以我们要取逆元，而取模之后是无法比较大小的，所以这里用double先记录线段的大小比较然后每次独立更新答案即可。

代码：

//ConvexHull-2D-Andrew

#include "bits/stdc++.h"
#define ll long long
#define double long double

using namespace std;
const int MAXN = 1e5 + 6;
const ll INF = 1e18 + 7;
const ll MOD = 1e9 + 7;
const double EPS = 1e-12;

struct Point {
public:
    ll x, y;
    Point(){}
    Point(double a, double b) : x(a), y(b) {}
    bool operator < (Point const b) const {
        if (x == b.x) return  y < b.y;
        return x < b.x;
    }
    Point operator - (Point const &b) const { return Point(x - b.x, y - b.y); }
    Point operator + (Point const &b) const { return Point(x + b.x, y + b.y); }
    ll operator * (Point const &b) const { return x * b.y - y * b.x; }
    double operator & (Point const &b) const { return x * b.x + y * b.y; }
    double len() { return sqrt(*this & *this); }
    ll lenSquare() { return *this & *this; }
};
ostream& operator << (ostream &out, Point const &p) { return out << p.x << ',' << p.y; }
Point A[MAXN], B[MAXN];
ll Square(ll x) { return x * x;}

ll quick_pow(ll a, ll b) {
    ll ans = 1;
    a %= MOD;
    while (b) {
        if (b & 1) ans = ans * a % MOD;
        b >>= 1;
        a = a * a % MOD;
    }
    return ans;
}

inline double minDis(int i, int j) {
    double mn;
    if (((A[j + 1] - A[j])&(B[i] - A[j])) > 0 && ((A[j] - A[j + 1])&(B[i] - A[j + 1])) > 0) {
        mn = abs((B[i] - A[j]) * (A[j + 1] - A[j]));
        mn /= (A[j] - A[j + 1]).len();
        //cout << i << '&' << A[j] << "<->" << A[j + 1] << ":" << abs((B[i] - A[j]) * (A[j + 1] - A[j])) << "/" << (A[j] - A[j + 1]).len() << "->" << mn << endl;
    }else {
        mn = min((B[i] - A[j]).len(), (B[i] - A[j + 1]).len());
    }
    return mn;
}

inline ll minIntDis(int i, int j) {
    ll mn;
    if (((A[j + 1] - A[j])&(B[i] - A[j])) > 0 && ((A[j] - A[j + 1])&(B[i] - A[j + 1])) > 0) {
        mn = Square((B[i] - A[j]) * (A[j + 1] - A[j]) % MOD) % MOD * quick_pow((A[j] - A[j + 1]).lenSquare() % MOD, MOD - 2);
    }else {
        mn = min((B[i] - A[j]).lenSquare(), (B[i] - A[j + 1]).lenSquare());
    }
    return mn % MOD;
}

ll maxLenSquare(int m, int n) {//旋转卡壳
    //A[m],B[n];
    ll ans = 0;
    double mx = 0;
    double tmn = 1e20;
    int j = 0;
    for (int i = 0; i < m; ++i) {
        if (minDis(0, i) < tmn) {
            j = i;
            tmn = minDis(0, i);
        }
    }
    //cout << j << endl;
    for (int i = 0; i < n; ++i) {
        while (minDis(i, j + 1) <= minDis(i, j) + EPS) {
            j = (j + 1) % m;
        }
        double len = minDis(i, j);
        if (len > mx) {
            mx = len;
            ans = minIntDis(i, j);
        }
    }
    return ans;
}

void solve(void) {
    int n, m;
    cin >> m;
    for (int i = 0; i < m; ++i) {
        cin >> A[i].x >> A[i].y;
    }
    A[m] = A[0];A[m + 1] = A[1];
    cin >> n;
    for (int i = 0; i < n; ++i) {
        cin >> B[i].x >> B[i].y;
    }
    B[n] = B[0];
    B[n + 1] = B[1];
    cout << maxLenSquare(m, n) % MOD << endl;
}

int main(void) {
    int t; cin >> t; while (t--)
        solve();
    return 0;
}