#pragma once
#include "../../ds/cvh/lib.hpp"
namespace tifa_libs {
// clang-format off
enum class CVHRECT : u8 { min_area, min_circum };
// clang-format on
// Coverage rectangle with min circum
template <CVHRECT type, class FP>
CEXP polygon<FP> coverage_rect(cT_(cvh<FP>) ch) NE {
cu32 n = ch.size();
retif_((n == 0) [[unlikely]], ch);
if (n == 1) return {{ch[0], ch[0], ch[0], ch[0]}};
if (n == 2) return {{ch[0], ch[0], ch[1], ch[1]}};
FP ans = std::numeric_limits<FP>::max();
u32 r = 1, p = 1, q = 1, ans_i = 0, ans_r = 0, ans_p = 0, ans_q = 0;
flt_ (u32, i, 0, n) {
const auto ni = ch.next(i);
while (!is_neg(cross(ch.vs[i], ch.vs[ni], ch.vs[ch.next(r)]) -
cross(ch.vs[i], ch.vs[ni], ch.vs[r]))) r = ch.next(r);
while (!is_neg(dot(ch.vs[i], ch.vs[ni], ch.vs[ch.next(p)]) -
dot(ch.vs[i], ch.vs[ni], ch.vs[p]))) p = ch.next(p);
if (i == 0) q = p;
while (!is_pos(dot(ch.vs[i], ch.vs[ni], ch.vs[ch.next(q)]) -
dot(ch.vs[i], ch.vs[ni], ch.vs[q]))) q = ch.next(q);
FP _;
if CEXP (type == CVHRECT::min_area)
_ = cross(ch.vs[i], ch.vs[ni], ch.vs[r]) *
(dot(ch.vs[i], ch.vs[ni], ch.vs[p]) - dot(ch.vs[i], ch.vs[ni], ch.vs[q])) /
(ch.vs[i] - ch.vs[ni]).norm2();
else if CEXP (type == CVHRECT::min_circum)
_ = (cross(ch.vs[i], ch.vs[ni], ch.vs[r]) +
(dot(ch.vs[i], ch.vs[ni], ch.vs[p]) - dot(ch.vs[i], ch.vs[ni], ch.vs[q]))) /
(ch.vs[i] - ch.vs[ni]).abs();
if (ans > _) ans = _, ans_i = i, ans_r = r, ans_p = p, ans_q = q;
}
point dir = line{ch[ans_i], ch[ch.next(ans_i)]}.direction(), vdir = rot90(dir);
line li{ch[ans_i], ch[ans_i] + dir},
lp{ch[ans_p], ch[ans_p] + vdir},
lr{ch[ans_r], ch[ans_r] + dir},
lq{ch[ans_q], ch[ans_q] + vdir};
return {{ins_LL(li, lp), ins_LL(lp, lr), ins_LL(lr, lq), ins_LL(lq, li)}};
}
} // namespace tifa_libs
#line 2 "src/geo2d/rotcal/coverage_rect/lib.hpp"
#line 2 "src/geo2d/ds/cvh/lib.hpp"
#line 2 "src/geo2d/dot/lib.hpp"
#line 2 "src/util/util/lib.hpp"
// https://github.com/Tiphereth-A/CP-lib
#include <bits/extc++.h>
// clang-format off
namespace tifa_libs {
#define CEXP constexpr
#define CEXPE constexpr explicit
#define CR const&
#define CP const*
#define PC *const
#define CPC const*const
#define TPN typename
#define NE noexcept
#define CNE const noexcept
#define ND [[nodiscard]]
#define cT_(...) std::conditional_t<sizeof(__VA_ARGS__) <= sizeof(size_t) * 2, __VA_ARGS__, __VA_ARGS__ CR>
// NOLINTNEXTLINE(misc-const-correctness)
#define flt_(T, i, l, r, ...) for (T i = (l), i##e = (r)__VA_OPT__(, ) __VA_ARGS__; i < i##e; ++i)
#define retif_(cond, if_true, ...) if cond return if_true __VA_OPT__(; else return __VA_ARGS__)
#ifdef ONLINE_JUDGE
#undef assert
#define assert(x) 42
#endif
using namespace std::ranges;
using namespace std::literals;
template <class T>
CEXP T abs(T x) NE { retif_((x < 0), -x, x); }
} // namespace tifa_libs
// clang-format on
#line 4 "src/geo2d/dot/lib.hpp"
namespace tifa_libs {
template <class P>
CEXP TPN P::FP_t dot(P CR o, P CR a, P CR b) NE { return (a - o) * (b - o); }
template <class P>
CEXP int sgn_dot(P CR o, P CR a, P CR b) NE { return sgn(dot(o, a, b)); }
} // namespace tifa_libs
#line 2 "src/geo2d/ds/po/lib.hpp"
#line 2 "src/edh/discretization/lib.hpp"
#line 2 "src/fast/rsort32/lib.hpp"
#line 2 "src/util/alias/others/lib.hpp"
#line 2 "src/util/consts/lib.hpp"
#line 2 "src/util/alias/num/lib.hpp"
#line 4 "src/util/alias/num/lib.hpp"
// clang-format off
namespace tifa_libs {
#define mk0_(w, t) using w = t; using c##w = const t
#define mk_(w, t) mk0_(w, t); CEXP w operator""_##w(unsigned long long x) NE { return (w)x; }
mk_(i8, int8_t) mk_(u8, uint8_t) mk_(i16, int16_t) mk_(u16, uint16_t) mk_(i32, int32_t) mk_(u32, uint32_t) mk_(i64, int64_t) mk_(u64, uint64_t) mk_(isz, ssize_t) mk_(usz, size_t) mk_(chr, char) mk_(schr, signed char) mk_(uchr, unsigned char) mk_(sint, signed) mk_(uint, unsigned);
mk0_(i128, __int128_t); mk0_(u128, __uint128_t); mk0_(f32, float); mk0_(f64, double); mk0_(f128, long double);
#undef mk0_
#undef mk_
} // namespace tifa_libs
// clang-format on
#line 4 "src/util/consts/lib.hpp"
// clang-format off
namespace tifa_libs {
using std::numbers::pi_v;
template <std::floating_point FP>
inline FP eps_v = std::sqrt(std::numeric_limits<FP>::epsilon());
template <std::floating_point FP>
CEXP void set_eps(FP v) NE { eps_v<FP> = v; }
CEXP u32 TIME = ((__TIME__[0] & 15) << 20) | ((__TIME__[1] & 15) << 16) | ((__TIME__[3] & 15) << 12) | ((__TIME__[4] & 15) << 8) | ((__TIME__[6] & 15) << 4) | (__TIME__[7] & 15);
CEXP auto STR2U16 = [] { std::array<u32, 65536> table{}; table.fill(-1_u32); flt_ (u32, i, 48, 58) flt_ (u32, j, 48, 58) table[i << 8 | j] = (j & 15) * 10 + (i & 15); return table; }();
inline const auto fn_0 = [](auto&&...) NE {};
inline const auto fn_is0 = [](auto x) NE { return x == 0; };
} // namespace tifa_libs
// clang-format on
#line 4 "src/util/alias/others/lib.hpp"
namespace tifa_libs {
template <class T>
struct chash {
CEXP static u64 C = u64(pi_v<f128> * 2e18) | 71;
CEXP u64 operator()(T x) CNE { return __builtin_bswap64(((u64)x ^ TIME) * C); }
};
// clang-format off
#define mk_(w, t) using w = t; using c##w = const t;
mk_(strn, std::string) mk_(strnv, std::string_view)
#undef mk_
template <class T> struct edge_t { T w; u32 u, v; CEXP auto operator<=>(edge_t CR) const = default; }; template <class T> using cedge_t = const edge_t<T>;
template <class T> struct pt3 { T _0, _1, _2; CEXP auto operator<=>(pt3 CR) const = default; }; template <class T> using cpt3 = const pt3<T>;
template <class T> struct pt4 { T _0, _1, _2, _3; CEXP auto operator<=>(pt4 CR) const = default; }; template <class T> using cpt4 = const pt4<T>;
#define mkT_(w, t, ...) template <class T> using w = t __VA_OPT__(, ) __VA_ARGS__; template <class T> using c##w = const t __VA_OPT__(, ) __VA_ARGS__;
mkT_(ptt, std::pair<T, T>) mkT_(alc, std::pmr::polymorphic_allocator<T>) mkT_(vec, std::vector<T>) mkT_(vvec, vec<vec<T>>) mkT_(v3ec, vvec<vec<T>>) mkT_(vecpt, vec<ptt<T>>) mkT_(vvecpt, vvec<ptt<T>>) mkT_(ptvec, ptt<vec<T>>) mkT_(ptvvec, ptt<vvec<T>>)
#undef mkT_
template <class T> using itl = std ::initializer_list<T>;
template <class T, usz ext = std::dynamic_extent> using spn = std::span<T const, ext>;
template <class T, usz N> using arr = std::array<T, N>; template <class T, usz N> using carr = std::array<const T, N>;
template <class U, class T> using vecp = vec<std::pair<U, T>>; template <class U, class T> using vvecp = vvec<std::pair<U, T>>;
template <class U, class T> using vvecp = vvec<std::pair<U, T>>; template <class U, class T> using vvvecp = vvec<vvec<std::pair<U, T>>>;
#ifdef PB_DS_ASSOC_CNTNR_HPP
template <class T, class C = std::less<T>> using set = __gnu_pbds::tree<T, __gnu_pbds::null_type, C>;
template <class K, class V, class C = std::less<K>> using map = __gnu_pbds::tree<K, V, C>;
// hset<u64> s({}, {}, {}, {}, {1<<16});
template <class T, class HF = chash<T>> using hset = __gnu_pbds::gp_hash_table<T, __gnu_pbds::null_type, HF>;
// hmap<u64, int> s({}, {}, {}, {}, {1<<16});
template <class K, class V, class HF = chash<K>> using hmap = __gnu_pbds::gp_hash_table<K, V, HF>;
#else
using std::set, std::map;
template <class T, class HF = chash<T>> using hset = std::unordered_set<T, HF>;
template <class K, class V, class HF = chash<K>> using hmap = std::unordered_map<K, V, HF>;
#endif
#ifdef PB_DS_PRIORITY_QUEUE_HPP
template <class T, class C = std::less<T>> using pq = __gnu_pbds::priority_queue<T, C>;
#else
template <class T, class C = std::less<T>> using pq = std::priority_queue<T, vec<T>, C>;
#endif
template <class T> using pqg = pq<T, std::greater<T>>;
// clang-format on
#define mk1_(V, A, T) using V##A = V<T>;
#define mk_(V, A, T) mk1_(V, A, T) mk1_(c##V, A, T)
#define mk(A, T) mk_(edge_t, A, T) mk_(ptt, A, T) mk_(pt3, A, T) mk_(pt4, A, T) mk_(vec, A, T) mk_(vvec, A, T) mk_(v3ec, A, T) mk_(vecpt, A, T) mk_(vvecpt, A, T) mk_(ptvec, A, T) mk_(ptvvec, A, T) mk1_(spn, A, T) mk1_(itl, A, T)
mk(b, bool) mk(c, chr) mk(i, i32) mk(u, u32) mk(ii, i64) mk(uu, u64) mk(t, isz) mk(z, usz) mk(f, f32) mk(d, f64) mk(s, strn);
#undef mk
#undef mk_
#undef mk1_
} // namespace tifa_libs
#line 4 "src/fast/rsort32/lib.hpp"
namespace tifa_libs {
template <class C>
requires(std::is_array_v<C> && std::integral<decltype(std::declval<C>()[0])> && sizeof(std::declval<C>()[0]) == 4) || (std::contiguous_iterator<TPN C::iterator> && std::integral<TPN C::value_type> && sizeof(TPN C::value_type) == 4)
void rsort32(C& a) NE {
if (a.size() <= 1) return;
if (a.size() <= 200'000) {
std::ranges::sort(a);
return;
}
arr<u32, 256> _0{}, _1{}, _2{}, _3{};
cu32 n = (u32)a.size();
vecu b(n);
u32 *a_ = (u32*)a.data(), *b_ = (u32*)b.data();
for (cu32 *_ = a_ + n, *i = a_; i < _; ++i) ++_0[*i & 255], ++_1[*i >> 8 & 255], ++_2[*i >> 16 & 255], ++_3[*i >> 24 & 255];
flt_ (u32, i, 1, 256) _0[i] += _0[i - 1], _1[i] += _1[i - 1], _2[i] += _2[i - 1], _3[i] += _3[i - 1];
for (u32 CP i = a_ + n; --i >= a_;) b_[--_0[*i & 255]] = *i;
for (u32 CP i = b_ + n; --i >= b_;) a_[--_1[*i >> 8 & 255]] = *i;
for (u32 CP i = a_ + n; --i >= a_;) b_[--_2[*i >> 16 & 255]] = *i;
for (u32 CP i = b_ + n; --i >= b_;) a_[--_3[*i >> 24 & 255]] = *i;
if CEXP (std::is_signed_v<TPN C::value_type>) {
u32 i = n;
while (i && a[i - 1] < 0) --i;
rotate(a_, a_ + n, a_ + i);
}
}
template <class C>
requires(std::is_array_v<C> && std::integral<decltype(std::declval<C>()[0])> && sizeof(std::declval<C>()[0]) == 4) || range<C>
void sort(C& a) NE {
if CEXP (std::is_array_v<C> || (std::contiguous_iterator<TPN C::iterator> && std::integral<TPN C::value_type> && sizeof(TPN C::value_type) == 4)) rsort32(a);
else std::ranges::sort(a);
}
} // namespace tifa_libs
#line 4 "src/edh/discretization/lib.hpp"
namespace tifa_libs {
template <common_range T>
CEXP T uniq(T v) NE {
tifa_libs::sort(v);
auto r = unique(begin(v), end(v));
return {begin(v), begin(r)};
}
template <common_range T>
CEXP std::pair<T, vecu> gen_id(T CR v) NE {
const T _ = uniq(v);
vecu _1;
_1.reserve(v.size());
flt_ (u32, i, 0, (u32)v.size()) _1.push_back(u32(lower_bound(_, v[i]) - begin(_)));
return {_, _1};
}
} // namespace tifa_libs
#line 2 "src/math/kahan/lib.hpp"
#line 4 "src/math/kahan/lib.hpp"
namespace tifa_libs {
template <std::floating_point FP>
class kahan_fp {
FP sum, c{0};
public:
CEXP kahan_fp(FP val = 0) NE : sum{val} {}
CEXP kahan_fp& operator+=(FP x) NE {
const FP y = x - c;
volatile FP t = sum + y, z = t - sum;
c = z - y, sum = t;
return *this;
}
CEXP operator FP() CNE { return sum; }
};
template <class FP>
using kahan = std::conditional_t<std::floating_point<FP>, kahan_fp<FP>, FP>;
} // namespace tifa_libs
#line 2 "src/geo2d/cross/lib.hpp"
#line 2 "src/util/func_fp/lib.hpp"
#line 2 "src/util/traits/math/lib.hpp"
// clang-format off
#line 4 "src/util/traits/math/lib.hpp"
namespace tifa_libs {
template <class T> concept char_c = std::same_as<T, char> || std::same_as<T, signed char> || std::same_as<T, unsigned char>;
#pragma GCC diagnostic ignored "-Wpedantic"
template <class T> concept s128_c = std::same_as<T, __int128_t> || std::same_as<T, __int128>;
template <class T> concept u128_c = std::same_as<T, __uint128_t> || std::same_as<T, unsigned __int128>;
template <class T> concept i128_c = s128_c<T> || u128_c<T>;
#pragma GCC diagnostic warning "-Wpedantic"
template <class T> concept imost64_c = std::integral<T> && sizeof(T) * __CHAR_BIT__ <= 64;
template <class T> concept smost64_c = imost64_c<T> && std::signed_integral<T>;
template <class T> concept umost64_c = imost64_c<T> && std::unsigned_integral<T>;
template <class T> concept int_c = i128_c<T> || imost64_c<T>;
template <class T> concept sint_c = s128_c<T> || smost64_c<T>;
template <class T> concept uint_c = u128_c<T> || umost64_c<T>;
template <class T> concept arithm_c = std::is_arithmetic_v<T> || int_c<T>;
template <class T> concept mint_c = requires(T x) { {x.mod()} -> uint_c; {x.val()} -> uint_c; };
template <class T> concept dft_c = requires(T x, std::vector<TPN T::data_t> v, u32 n) { {x.size()} -> std::same_as<u32>; x.bzr(n); x.dif(v, n); x.dit(v, n); };
template <class T> concept ntt_c = dft_c<T> && requires(T x) { T::max_size; T::G; };
template <class T> struct to_sint : std::make_signed<T> {};
template <> struct to_sint<u128> { using type = i128; };
template <> struct to_sint<i128> { using type = i128; };
template <class T> using to_sint_t = TPN to_sint<T>::type;
template <class T> struct to_uint : std::make_unsigned<T> {};
template <> struct to_uint<u128> { using type = u128; };
template <> struct to_uint<i128> { using type = u128; };
template <class T> using to_uint_t = TPN to_uint<T>::type;
template <arithm_c T> struct to_bigger : std::make_unsigned<T> {};
#define _(w,ww) template <> struct to_bigger<w> { using type = ww; }
#define _2(w,ww) _(i##w,i##ww); _(u##w,u##ww);
_2(8, 16); _2(16, 32); _2(32, 64); _2(64, 128); _(f32, f64); _(f64, f128);
#undef _2
#undef _
template <class T> using to_bigger_t = TPN to_bigger<T>::type;
template <arithm_c T> CEXP T inf_v = [] {
if CEXP(sint_c<T>) return T(to_uint_t<T>(-1) / 4 - 1);
else if CEXP(uint_c<T>) return T(-1) / 2 - 1;
else return std::numeric_limits<T>::max() / 2 - 1;
}();
} // namespace tifa_libs
// clang-format on
#line 5 "src/util/func_fp/lib.hpp"
namespace tifa_libs {
template <sint_c T>
CEXP int sgn(T x) NE { return (!!x) | (x >> (sizeof(T) * 8 - 1)); }
CEXP int sgn(uint_c auto x) NE { return !!x; }
template <std::floating_point FP>
CEXP int sgn(FP x) NE { return (x > eps_v<FP>)-(x < -eps_v<FP>); }
template <class FP>
CEXP bool is_neg(FP x) NE { return sgn(x) < 0; }
template <class FP>
CEXP bool is_zero(FP x) NE { return !sgn(x); }
template <class FP>
CEXP bool is_pos(FP x) NE { return sgn(x) > 0; }
CEXP int comp(sint_c auto l, sint_c auto r) NE { return sgn(l - r); }
CEXP int comp(uint_c auto l, uint_c auto r) NE { return (!!(l - r)) | -(l < r); }
template <std::floating_point FP>
CEXP int comp(FP l, FP r) NE { return sgn((l - r) / max({abs(l), abs(r), FP(1)})); }
template <class FP>
CEXP bool is_lt(FP l, FP r) NE { return comp(l, r) < 0; }
template <class FP>
CEXP bool is_eq(FP l, FP r) NE { return !comp(l, r); }
template <class FP>
CEXP bool is_gt(FP l, FP r) NE { return comp(l, r) > 0; }
//! containing endpoints
CEXP bool is_in_middle(arithm_c auto l, arithm_c auto mid, arithm_c auto r) NE { return is_eq(l, mid) || is_eq(r, mid) || ((l < mid) ^ (r < mid)); }
//! containing endpoints
template <class FP>
CEXP bool is_intersect(FP l1, FP r1, FP l2, FP r2) NE {
if (l1 > r1) swap(l1, r1);
if (l2 > r2) swap(l2, r2);
return !(is_lt(r1, l2) || is_lt(r2, l1));
}
} // namespace tifa_libs
#line 4 "src/geo2d/cross/lib.hpp"
namespace tifa_libs {
template <class P>
CEXP auto cross(P CR o, P CR a, P CR b) NE { return (a - o) ^ (b - o); }
template <class P>
requires std::floating_point<TPN P::FP_t>
CEXP auto cross_unit(P CR o, P CR a, P CR b) NE { return (a - o).do_unit() ^ (b - o).do_unit(); }
template <class P>
requires std::floating_point<TPN P::FP_t>
CEXP int sgn_cross(P CR o, P CR a, P CR b) NE { return sgn(cross_unit(o, a, b)); }
template <class P>
CEXP int sgn_cross(P CR o, P CR a, P CR b) NE { return sgn(cross(o, a, b)); }
} // namespace tifa_libs
#line 2 "src/geo2d/dis/pp/lib.hpp"
#line 2 "src/geo2d/ds/p/lib.hpp"
#line 2 "src/util/traits/others/lib.hpp"
// clang-format off
#line 4 "src/util/traits/others/lib.hpp"
namespace tifa_libs {
//! only for template without non-type argument
template <class, template <class...> class> CEXP bool specialized_from_v = false;
template <template <class...> class T, class... Args> CEXP bool specialized_from_v<T<Args...>, T> = true;
static_assert(specialized_from_v<vecu, std::vector>);
template <class T> concept container_c = common_range<T> && !std::is_array_v<std::remove_cvref_t<T>> && !std::same_as<std::remove_cvref_t<T>, strn> && !std::same_as<std::remove_cvref_t<T>, strnv>;
template <class T> concept istream_c = std::derived_from<T, std::istream> || std::derived_from<T, std::wistream> || requires(T is) { is.peek(); };
template <class T> concept ostream_c = std::derived_from<T, std::ostream> || std::derived_from<T, std::wostream> || requires(T os) { os.flush(); };
} // namespace tifa_libs
// clang-format on
#line 5 "src/geo2d/ds/p/lib.hpp"
namespace tifa_libs {
template <class FP>
struct point {
using FP_t = FP;
FP x, y;
CEXP point() = default;
CEXP point(FP x, FP y) NE : x{x}, y{y} {}
friend auto& operator>>(istream_c auto& is, point& p) NE { return is >> p.x >> p.y; }
friend auto& operator<<(ostream_c auto& os, point CR p) NE { return os << p.x << ' ' << p.y; }
// s + (t - s) * r
template <std::floating_point T>
friend CEXP point lerp(point CR s, point CR t, T r) NE { return s + (t - s) * r; }
friend CEXP point mid_point(point CR s, point CR t) NE { return lerp(s, t, .5); }
CEXP point& operator+=(arithm_c auto n) NE {
this->x += n, this->y += n;
return *this;
}
CEXP point& operator-=(arithm_c auto n) NE {
this->x -= n, this->y -= n;
return *this;
}
CEXP point& operator*=(arithm_c auto n) NE {
this->x *= n, this->y *= n;
return *this;
}
CEXP point& operator/=(arithm_c auto n) NE {
this->x /= n, this->y /= n;
return *this;
}
friend CEXP point operator+(point x, arithm_c auto n) NE { return x += n; }
friend CEXP point operator+(arithm_c auto n, point x) NE { return x += n; }
friend CEXP point operator-(point x, arithm_c auto n) NE { return x -= n; }
friend CEXP point operator-(arithm_c auto n, point x) NE { return x -= n; }
friend CEXP point operator*(point x, arithm_c auto n) NE { return x *= n; }
friend CEXP point operator*(arithm_c auto n, point x) NE { return x *= n; }
friend CEXP point operator/(point x, arithm_c auto n) NE { return x /= n; }
friend CEXP point operator/(arithm_c auto n, point x) NE { return x /= n; }
CEXP point& operator+=(point CR p) NE {
this->x += p.x, this->y += p.y;
return *this;
}
CEXP point& operator-=(point CR p) NE {
this->x -= p.x, this->y -= p.y;
return *this;
}
CEXP point operator+(point CR p) CNE { return point(*this) += p; }
CEXP point operator-(point CR p) CNE { return point(*this) -= p; }
CEXP point operator-() CNE { return point{-x, -y}; }
CEXP auto operator<=>(point CR p) CNE {
if (auto CR c = comp(x, p.x); c) return c;
return comp(y, p.y);
}
CEXP bool operator==(point CR p) CNE { return (*this <=> p) == 0; }
CEXP FP operator*(point CR p) CNE { return x * p.x + y * p.y; }
CEXP FP operator^(point CR p) CNE { return x * p.y - y * p.x; }
CEXP FP arg() CNE {
static_assert(std::is_floating_point_v<FP>);
return std::atan2(y, x);
}
CEXP FP arg_2pi() CNE {
FP res = arg();
retif_((is_neg(res)), res + 2 * pi_v<FP>, res);
}
CEXP FP norm2() CNE { return x * x + y * y; }
CEXP FP norm() CNE {
static_assert(std::is_floating_point_v<FP>);
return std::hypot(x, y);
}
CEXP point& do_unit() NE {
static_assert(std::is_floating_point_v<FP>);
return *this /= norm();
}
static CEXP arr<u32, 9> QUAD__{6, 7, 8, 5, 0, 1, 4, 3, 2};
// 4 3 2
// 5 0 1
// 6 7 8
ND CEXP u32 quad() CNE { return QUAD__[(sgn(y) + 1) * 3 + sgn(x) + 1]; }
CEXP int toleft(point CR p) CNE { return sgn(*this ^ p); }
CEXP point& do_rot(FP theta) NE {
const FP x0 = x, y0 = y, ct = std::cos(theta), st = std::sin(theta);
x = x0 * ct - y0 * st, y = x0 * st + y0 * ct;
return *this;
}
friend CEXP point rot(point p, FP theta) NE { return p.do_rot(theta); }
CEXP point& do_rot90() NE {
const FP _ = x;
x = -y, y = _;
return *this;
}
friend CEXP point rot90(point p) NE { return p.do_rot90(); }
CEXP point& do_rot270() NE {
const FP _ = y;
y = -x, x = _;
return *this;
}
friend CEXP point rot270(point p) NE { return p.do_rot270(); }
};
} // namespace tifa_libs
#line 4 "src/geo2d/dis/pp/lib.hpp"
namespace tifa_libs {
// distance of two points
// @return $(|x_1-x_2|^p + |y_1-y_2|^p)^{1/p}$, p = 0 means $\infty$
template <class FP, u32 p = 2>
CEXP FP dist_PP(point<FP> CR p1, point<FP> CR p2) NE {
static_assert(p < 2 || std::floating_point<FP>);
if CEXP (p == 0) return max(abs(p1.x - p2.x), abs(p1.y - p2.y)); // Chebyshev
else if CEXP (p == 1) return abs(p1.x - p2.x) + abs(p1.y - p2.y); // Manhattan
else if CEXP (p == 2) return (p1 - p2).norm(); // Euclidian
else return std::pow(std::pow(abs(p1.x - p2.x), p) + std::pow(abs(p1.y - p2.y), p), FP{1} / p);
}
} // namespace tifa_libs
#line 7 "src/geo2d/ds/po/lib.hpp"
namespace tifa_libs {
template <class FP>
struct polygon {
vec<point<FP>> vs;
CEXP polygon() = default;
CEXPE polygon(u32 sz) NE : vs(sz) {}
CEXP polygon(itl<point<FP>> vs_) NE : vs(vs_) {}
CEXP polygon(spn<point<FP>> vs_) NE : vs(begin(vs_), end(vs_)) {}
friend auto& operator>>(istream_c auto& is, polygon& p) NE {
for (auto& i : p.vs) is >> i;
return is;
}
friend auto& operator<<(ostream_c auto& os, polygon CR p) NE {
retif_((p.vs.empty()) [[unlikely]], os);
for (auto it = begin(p.vs); it != end(p.vs) - 1; ++it) os << *it << ' ';
return os << p.vs.back();
}
ND CEXP u32 size() CNE { return (u32)vs.size(); }
CEXP point<FP>& operator[](u32 x) NE { return vs[x]; }
CEXP point<FP> CR operator[](u32 x) CNE { return vs[x]; }
CEXP polygon& resort() NE {
sort(vs);
return *this;
}
CEXP polygon& reunique() NE {
vs = uniq(vs);
return *this;
}
CEXP auto prev(TPN vec<point<FP>>::const_iterator it) CNE {
if (it == begin(vs)) it = end(vs);
return --it;
}
CEXP auto next(TPN vec<point<FP>>::const_iterator it) CNE { retif_((++it == end(vs)) [[unlikely]], begin(vs), it); }
ND CEXP u32 prev(u32 idx) CNE { retif_((idx == 0) [[unlikely]], size() - 1, idx - 1); }
ND CEXP u32 next(u32 idx) CNE { retif_((idx + 1 == size()) [[unlikely]], 0, idx + 1); }
CEXP FP circum() CNE {
kahan<FP> ret = dist_PP(vs.back(), vs.front());
flt_ (u32, i, 0, size() - 1) ret += dist_PP(vs[i], vs[i + 1]);
return ret;
}
CEXP FP area2() CNE {
retif_((size() < 3) [[unlikely]], 0);
kahan<FP> ret = vs.back() ^ vs.front();
flt_ (u32, i, 0, size() - 1) ret += vs[i] ^ vs[i + 1];
return ret;
}
CEXP FP area() CNE {
static_assert(std::floating_point<FP>);
return area2() * (FP).5;
}
ND CEXP bool is_convex() CNE {
arr<bool, 2> flag{false, false};
cu32 n = size();
retif_((n < 3) [[unlikely]], true);
for (u32 i = 0, j = next(i), k = next(j); i < n; ++i, j = next(j), k = next(k)) {
if (auto sgn = sgn_cross(vs[i], vs[j], vs[k]); sgn) flag[(sgn + 1) / 2] = true;
if (flag[0] && flag[1]) return false;
}
return true;
}
// @return nullopt if @p on board of polygon, otherwise winding number
CEXP auto winding(point<FP> CR p) CNE {
std::optional<u32> ret{0};
flt_ (u32, i, 0, size()) {
auto &&u = vs[i], &&v = vs[next(i)];
if (!sgn_cross(p, u, v) && !sgn_dot(p, u, v)) {
ret = std::nullopt;
return ret;
}
if (is_zero(u.y - v.y)) continue;
if (is_lt(u.y, v.y) && !is_pos(u, v, p)) continue;
if (is_gt(u.y, v.y) && !is_neg(u, v, p)) continue;
if (is_lt(u.y, p.y) && !is_lt(v.y, p.y)) ++ret.value();
if (!is_lt(u.y, p.y) && is_lt(v.y, p.y)) --ret.value();
}
return ret;
}
};
} // namespace tifa_libs
#line 2 "src/geo2d/ins/ll/lib.hpp"
#line 2 "src/geo2d/ds/l/lib.hpp"
#line 5 "src/geo2d/ds/l/lib.hpp"
namespace tifa_libs {
template <class FP>
struct line {
point<FP> l, r;
CEXP line() = default;
CEXP line(point<FP> CR s, point<FP> CR t) NE : l(s), r(t) {}
CEXP line(point<FP> CR s, FP angle_x) NE : l(s), r(s + is_eq(angle_x, pi_v<FP> / 2) ? point<FP>{0, 1} : point<FP>{1, std::tan(angle_x)}) { assert(angle_x > 0 && angle_x < pi_v<FP>); }
// ax + by + c = 0
CEXP line(FP a, FP b, FP c) NE {
if (is_zero(a)) l = {0, -c / b}, r = {1, -c / b};
else if (is_zero(b)) l = {-c / a, 0}, r = {-c / a, 1};
else l = {0, -c / b}, r = {1, -(c + a) / b};
}
CEXP line(FP s_x, FP s_y, FP t_x, FP t_y) NE : l{s_x, s_y}, r{t_x, t_y} {}
friend std::istream& operator>>(std::istream& is, line& l) NE { return is >> l.l >> l.r; }
friend std::ostream& operator<<(std::ostream& os, line CR l) NE { return os << l.l << ' ' << l.r; }
CEXP point<FP> direction() CNE { return r - l; }
CEXP bool is_parallel(line CR r) CNE { return is_zero(direction() ^ r.direction()); }
friend CEXP bool is_parallel(line CR l, line CR r) NE { return l.is_parallel(r); }
CEXP bool is_same_dir(line CR r) CNE { return is_parallel(r) && is_pos(direction() * r.direction()); }
friend CEXP bool is_same_dir(line CR l, line CR r) NE { return l.is_same_dir(r); }
friend CEXP bool operator==(line CR l, line CR r) NE { return l.l == r.l && l.r == r.r; }
friend CEXP auto operator<=>(line CR l, line CR r) NE {
if (l == r) return 0;
if (l.is_same_dir(r)) {
retif_((r.is_include_strict(l.l)), -1, 1);
} else if (const auto vl = l.direction(), vr = r.direction(); vl.quad() != vr.quad()) return (i32)vl.quad() - (i32)vr.quad();
else return -sgn(vl ^ vr);
}
CEXP int toleft(point<FP> CR p) CNE { return sgn_cross(l, r, p); }
// half plane
CEXP bool is_include_strict(point<FP> CR p) CNE { return toleft(p) > 0; }
// half plane
CEXP bool is_include(point<FP> CR p) CNE { return toleft(p) >= 0; }
// translate @dist along the direction of half plane
CEXP line& do_push(FP dist) NE {
const point delta = direction().do_rot90().do_unit() * dist;
l += delta, r += delta;
return *this;
}
};
} // namespace tifa_libs
#line 4 "src/geo2d/ins/ll/lib.hpp"
namespace tifa_libs {
// judge if two lines are intersected or not
template <class FP>
CEXP bool is_ins_LL(line<FP> CR l1, line<FP> CR l2) NE { return !is_zero(cross(l2.l, l2.r, l1.l) - cross(l2.l, l2.r, l1.r)); }
// intersection point of two lines
template <class FP>
CEXP point<FP> ins_LL(line<FP> CR l1, line<FP> CR l2) NE {
const FP a1 = cross(l2.l, l2.r, l1.l), a2 = -cross(l2.l, l2.r, l1.r);
return (l1.l * a2 + l1.r * a1) / (a1 + a2);
}
template <class FP>
CEXP point<FP> ins_LL(line<FP> CR l, FP a, FP b, FP c) NE {
const FP a1 = abs(a * l.l.x + b * l.l.y + c), a2 = abs(a * l.r.x + b * l.r.y + c);
return (l.l * a2 + l.r * a1) / (a1 + a2);
}
} // namespace tifa_libs
#line 6 "src/geo2d/ds/cvh/lib.hpp"
namespace tifa_libs {
template <class FP>
struct cvh : public polygon<FP> {
CEXP cvh() = default;
CEXPE cvh(u32 sz) NE : polygon<FP>(sz) {}
CEXP cvh(spn<point<FP>> vs_, bool inited = false, bool strict = true) NE : polygon<FP>(vs_) {
if (!inited) strict ? init<true>() : init<false>();
}
friend auto& operator>>(istream_c auto& is, cvh& ch) NE {
for (auto& i : ch.vs) is >> i;
return is;
}
friend auto& operator<<(ostream_c auto& os, cvh<FP> CR ch) NE {
retif_((ch.vs.empty()) [[unlikely]], os);
for (auto it = begin(ch.vs); it != end(ch.vs) - 1; ++it) os << *it << ' ';
return os << ch.vs.back();
}
template <bool strict = true>
CEXP cvh& init() NE {
this->reunique();
cu32 n = this->size();
retif_((n <= 2) [[unlikely]], *this);
vec<point<FP>> cvh(n * 2);
u32 m = 0;
for (u32 i = 0; i < n; cvh[m++] = (*this)[i++])
if CEXP (strict)
while (m > 1 && sgn_cross(cvh[m - 2], cvh[m - 1], (*this)[i]) <= 0) --m;
else
while (m > 1 && sgn_cross(cvh[m - 2], cvh[m - 1], (*this)[i]) < 0) --m;
// NOLINTNEXTLINE(misc-const-correctness)
for (u32 i = n - 2, t = m; ~i; cvh[m++] = (*this)[i--])
if CEXP (strict)
while (m > t && sgn_cross(cvh[m - 2], cvh[m - 1], (*this)[i]) <= 0) --m;
else
while (m > t && sgn_cross(cvh[m - 2], cvh[m - 1], (*this)[i]) < 0) --m;
cvh.resize(m - 1);
u32 p = 0;
flt_ (u32, i, 1, m - 1)
if (cvh[i] < cvh[p]) p = i;
rotate(cvh, begin(cvh) + p), this->vs = cvh;
return *this;
}
// @return true if @p in convex hull (include border)
CEXP bool contains(point<FP> CR p) CNE {
auto it = lower_bound(begin(this->vs) + 1, end(this->vs), p, [&](point<FP> CR l, point<FP> CR r) NE { return is_pos(cross((*this)[0], l, r)); }) - 1;
auto next_it = this->next(it);
if (auto res = sgn_cross(p, *it, *next_it); res) return ~res;
else return !res && !is_pos(dot(p, *it, *next_it));
}
template <bool get_index = false>
CEXP auto diameter() CNE {
cu32 n = this->size();
if (n <= 1) return std::conditional_t<get_index, edge_t<FP>, FP>{};
cu32 is = 0;
u32 js = 0;
flt_ (u32, k, 1, n)
if ((*this)[js] < (*this)[k]) js = k;
u32 i = is, j = js;
std::conditional_t<get_index, edge_t<FP>, FP> ret;
if CEXP (get_index) ret = {dist_PP((*this)[i], (*this)[j]), i, j};
else ret = dist_PP((*this)[i], (*this)[j]);
do {
(++((((*this)[this->next(i)] - (*this)[i]) ^ ((*this)[this->next(j)] - (*this)[j])) >= 0 ? j : i)) %= n;
if CEXP (get_index) ret = max(ret, edge_t<FP>{dist_PP((*this)[i], (*this)[j]), i, j});
else ret = max(ret, dist_PP((*this)[i], (*this)[j]));
} while (i != is || j != js);
return ret;
}
CEXP cvh& do_minkowski_sum(cvh<FP> CR r) NE {
cu32 n = this->size(), m = r.size();
retif_((!m) [[unlikely]], *this);
retif_((!n) [[unlikely]], *this = r);
vec<point<FP>> res{(*this)[0] + r[0]};
res.reserve(n + m);
u32 i = 0, j = 0;
while (i < n && j < m) {
auto dl = (*this)[this->next(i)] - (*this)[i], dr = r[r.next(j)] - r[j];
bool f = !is_neg(dl ^ dr);
res.push_back(res.back() + (f ? dl : dr)), ++(f ? i : j);
}
while (i < n) res.push_back(res.back() + ((*this)[this->next(i)] - (*this)[i])), ++i;
while (j < m) res.push_back(res.back() + (r[r.next(j)] - r[j])), ++j;
this->vs = res;
return *this;
}
CEXP cvh& do_ins_CVHhP(line<FP> CR l) NE {
cu32 n = this->size();
vec<point<FP>> cvc;
flt_ (u32, i, 0, n) {
point p1 = (*this)[i], p2 = (*this)[this->next(i)];
int d1 = l.toleft(p1), d2 = l.toleft(p2);
if (d1 >= 0) cvc.push_back(p1);
if (d1 * d2 < 0) cvc.push_back(ins_LL({p1, p2}, l));
}
this->vs = cvc;
return *this;
}
};
} // namespace tifa_libs
#line 4 "src/geo2d/rotcal/coverage_rect/lib.hpp"
namespace tifa_libs {
// clang-format off
enum class CVHRECT : u8 { min_area, min_circum };
// clang-format on
// Coverage rectangle with min circum
template <CVHRECT type, class FP>
CEXP polygon<FP> coverage_rect(cT_(cvh<FP>) ch) NE {
cu32 n = ch.size();
retif_((n == 0) [[unlikely]], ch);
if (n == 1) return {{ch[0], ch[0], ch[0], ch[0]}};
if (n == 2) return {{ch[0], ch[0], ch[1], ch[1]}};
FP ans = std::numeric_limits<FP>::max();
u32 r = 1, p = 1, q = 1, ans_i = 0, ans_r = 0, ans_p = 0, ans_q = 0;
flt_ (u32, i, 0, n) {
const auto ni = ch.next(i);
while (!is_neg(cross(ch.vs[i], ch.vs[ni], ch.vs[ch.next(r)]) -
cross(ch.vs[i], ch.vs[ni], ch.vs[r]))) r = ch.next(r);
while (!is_neg(dot(ch.vs[i], ch.vs[ni], ch.vs[ch.next(p)]) -
dot(ch.vs[i], ch.vs[ni], ch.vs[p]))) p = ch.next(p);
if (i == 0) q = p;
while (!is_pos(dot(ch.vs[i], ch.vs[ni], ch.vs[ch.next(q)]) -
dot(ch.vs[i], ch.vs[ni], ch.vs[q]))) q = ch.next(q);
FP _;
if CEXP (type == CVHRECT::min_area)
_ = cross(ch.vs[i], ch.vs[ni], ch.vs[r]) *
(dot(ch.vs[i], ch.vs[ni], ch.vs[p]) - dot(ch.vs[i], ch.vs[ni], ch.vs[q])) /
(ch.vs[i] - ch.vs[ni]).norm2();
else if CEXP (type == CVHRECT::min_circum)
_ = (cross(ch.vs[i], ch.vs[ni], ch.vs[r]) +
(dot(ch.vs[i], ch.vs[ni], ch.vs[p]) - dot(ch.vs[i], ch.vs[ni], ch.vs[q]))) /
(ch.vs[i] - ch.vs[ni]).abs();
if (ans > _) ans = _, ans_i = i, ans_r = r, ans_p = p, ans_q = q;
}
point dir = line{ch[ans_i], ch[ch.next(ans_i)]}.direction(), vdir = rot90(dir);
line li{ch[ans_i], ch[ans_i] + dir},
lp{ch[ans_p], ch[ans_p] + vdir},
lr{ch[ans_r], ch[ans_r] + dir},
lq{ch[ans_q], ch[ans_q] + vdir};
return {{ins_LL(li, lp), ins_LL(lp, lr), ins_LL(lr, lq), ins_LL(lq, li)}};
}
} // namespace tifa_libs
src/geo2d/rotcal/coverage_rect/lib.hpp