Tifa's CP Library

:heavy_check_mark: src/test_cpverifier/unit-test/geo2d/fermatp.test.cpp

Depends on

Code

#define UNITTEST
#define PROBLEM "https://judge.yosupo.jp/problem/aplusb"

#include "../../../code/geo2d/fermatp.hpp"
#include "../base.hpp"

using tifa_libs::geo::point, tifa_libs::geo::polygon;

template <class T>
void single_test(vec<point<T>> const& v) {
  check_bool(v.size() >= 3, check_param(v));

  polygon<T> poly(v);
  point<T> fp_poly = fermatp(poly);

  point<T> sum(0, 0);
  for (auto const& i : v) sum += (i - fp_poly).do_unit();
  check_bool(tifa_libs::is_lt(sum.norm(), (T)2), check_param(v), check_param(fp_poly), check_param(sum));
}

template <tifa_libs::arithm_c T>
void test(T lim) {
  tifa_libs::rand::Gen<std::conditional_t<std::is_integral_v<T>, std::uniform_int_distribution<T>, std::uniform_real_distribution<T>>> g(std::is_signed_v<T> ? -lim : 0, lim);

  vec<point<T>> v{point<T>(g(), g()), point<T>(g(), g()), point<T>(g(), g())};
  single_test(v);
  v.emplace_back(g(), g());
  single_test(v);
  while (v.size() < 10) v.emplace_back(g(), g());
  single_test(v);
  while (v.size() < 50) v.emplace_back(g(), g());
  single_test(v);
}

int main() {
  auto tcase = tifa_libs::unittest::pre_test();

  switch (tcase) {
    case tifa_libs::unittest::ts_example_00: test<f64>(1e5); break;
    case tifa_libs::unittest::ts_example_01: test<f128>(1e5); break;
    case tifa_libs::unittest::ts_random_00: test<f64>(1e9); break;
    case tifa_libs::unittest::ts_random_01: test<f128>(1e9); break;
    case tifa_libs::unittest::ts_random_02: break;
    case tifa_libs::unittest::ts_random_03: break;
    case tifa_libs::unittest::ts_random_04: break;
    case tifa_libs::unittest::ts_random_05: break;
    case tifa_libs::unittest::ts_random_06: break;
    case tifa_libs::unittest::ts_random_07: break;
    case tifa_libs::unittest::ts_random_08: break;
    case tifa_libs::unittest::ts_random_09: break;
    default: break;
  }

  tifa_libs::unittest::post_test();
}
#line 1 "src/test_cpverifier/unit-test/geo2d/fermatp.test.cpp"
#define UNITTEST
#define PROBLEM "https://judge.yosupo.jp/problem/aplusb"

#line 1 "src/code/geo2d/fermatp.hpp"



#line 1 "src/code/opt/heuristic_sa.hpp"



#line 1 "src/code/rand/gen.hpp"



#line 1 "src/code/util/util.hpp"



#include <bits/stdc++.h>

template <class T>
constexpr T abs(T x) { return x < 0 ? -x : x; }

using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
using i128 = __int128_t;
using isz = ptrdiff_t;

using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using u128 = __uint128_t;
using usz = size_t;

using f32 = float;
using f64 = double;
using f128 = long double;

template <class T>
using ptt = std::pair<T, T>;
template <class T>
using pt3 = std::tuple<T, T, T>;
template <class T>
using pt4 = std::tuple<T, T, T, T>;

template <class T, usz N>
using arr = std::array<T, N>;
template <class T>
using vec = std::vector<T>;
template <class T>
using vvec = vec<vec<T>>;
template <class T>
using v3ec = vec<vvec<T>>;
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 T>
using vecpt = vec<ptt<T>>;
template <class T>
using vvecpt = vvec<ptt<T>>;

template <class T, class C = std::less<T>>
using pq = std::priority_queue<T, vec<T>, C>;
template <class T>
using pqg = std::priority_queue<T, vec<T>, std::greater<T>>;

using strn = std::string;
using strnv = std::string_view;

using vecu = vec<u32>;
using vvecu = vvec<u32>;
using v3ecu = v3ec<u32>;
using vecu64 = vec<u64>;
using vecb = vec<bool>;
using vvecb = vvec<bool>;

#ifdef ONLINE_JUDGE
#undef assert
#define assert(x) 42
#endif

using namespace std::literals;

constexpr i8 operator""_i8(unsigned long long x) { return (i8)x; }
constexpr i16 operator""_i16(unsigned long long x) { return (i16)x; }
constexpr i32 operator""_i32(unsigned long long x) { return (i32)x; }
constexpr i64 operator""_i64(unsigned long long x) { return (i64)x; }
constexpr isz operator""_iz(unsigned long long x) { return (isz)x; }

constexpr u8 operator""_u8(unsigned long long x) { return (u8)x; }
constexpr u16 operator""_u16(unsigned long long x) { return (u16)x; }
constexpr u32 operator""_u32(unsigned long long x) { return (u32)x; }
constexpr u64 operator""_u64(unsigned long long x) { return (u64)x; }
constexpr usz operator""_uz(unsigned long long x) { return (usz)x; }

inline const auto fn_0 = [](auto&&...) {};


#line 5 "src/code/rand/gen.hpp"

namespace tifa_libs::rand {

template <class Distri>
class Gen {
  std::conditional_t<sizeof(typename Distri::result_type) <= 4, std::mt19937, std::mt19937_64> re;
  Distri dist;

 public:
  using random_engine = decltype(re);
  using distribution = Distri;
  using result_type = typename Distri::result_type;

  constexpr Gen() : re(std::random_device{}()), dist() {}
  constexpr Gen(result_type a, result_type b) : re(std::random_device{}()), dist(a, b) {}

  constexpr void set_range(result_type a, result_type b) { dist = Distri(a, b); }
  constexpr random_engine& rand_eng() { return re; }
  constexpr Distri& distrib() { return dist; }

  void reset_seed() { re.seed((result_type)std::chrono::duration_cast<std::conditional_t<sizeof(typename Distri::result_type) <= 4, std::chrono::seconds, std::chrono::nanoseconds>>(std::chrono::high_resolution_clock::now().time_since_epoch()).count()); }
  constexpr result_type operator()() { return dist(re); }
  result_type next() { return dist(re); }
};

}  // namespace tifa_libs::rand


#line 5 "src/code/opt/heuristic_sa.hpp"

namespace tifa_libs::opt {

template <class T, class Fg, class Ff, class Ft = f64, class Tt = f64>
requires requires(Ff fit, Fg gen, T const& sample, Tt t) {
  { fit(sample) } -> std::same_as<Ft>;
  { gen(sample, t) } -> std::same_as<T>;
}
class heuristic_sa {
  Fg gen;
  Ff f;
  const Tt Tmax, Tmin, dT;
  rand::Gen<std::uniform_real_distribution<Tt>> g;

 public:
  // Find minimum argument of f(x)
  explicit constexpr heuristic_sa(Fg gen, Ff f, Tt Tmax = 1e10, Tt Tmin = 1e-10, Tt dT = 1 - 1e-5) : gen(gen), f(f), Tmax(Tmax), Tmin(Tmin), dT(dT), g(0, 1) {}

  std::pair<Ft, T> operator()(T init_val) {
    T ans = init_val, now = ans;
    Ft ans_f = f(ans);
    for (Tt t = Tmax; t > Tmin; t *= dT) {
      now = gen(ans, t);
      if (Ft now_f = f(now); now_f <= ans_f || std::exp((ans_f - now_f) / t) > g.next()) {
        ans_f = now_f;
        ans = now;
      }
    }
    return {ans_f, ans};
  }
};

}  // namespace tifa_libs::opt


#line 1 "src/code/geo2d/make_p_polar.hpp"



#line 1 "src/code/geo2d/point.hpp"



#line 1 "src/code/util/fp_comp.hpp"



#line 1 "src/code/util/fp_const.hpp"



#line 5 "src/code/util/fp_const.hpp"

namespace tifa_libs {

using namespace std::numbers;

// std::sqrt(std::numeric_limits<FP>::epsilon())
template <std::floating_point FP>
constexpr inline FP eps_v = FP(1e-8L);

}  // namespace tifa_libs


#line 1 "src/code/util/traits.hpp"



#line 5 "src/code/util/traits.hpp"

namespace tifa_libs {

template <class T>
concept iterable_c = requires(T v) {
  { v.begin() } -> std::same_as<typename T::iterator>;
  { v.end() } -> std::same_as<typename T::iterator>;
};

template <class T>
concept container_c = iterable_c<T> && !std::derived_from<T, std::basic_string<typename T::value_type>>;

template <class T>
constexpr bool is_char_v = std::is_same_v<T, char> || std::is_same_v<T, signed char> || std::is_same_v<T, unsigned char>;
template <class T>
concept char_c = is_char_v<T>;

template <class T>
constexpr bool is_s128_v = std::is_same_v<T, __int128_t> || std::is_same_v<T, __int128>;
template <class T>
concept s128_c = is_s128_v<T>;

template <class T>
constexpr bool is_u128_v = std::is_same_v<T, __uint128_t> || std::is_same_v<T, unsigned __int128>;
template <class T>
concept u128_c = is_u128_v<T>;

template <class T>
constexpr bool is_i128_v = is_s128_v<T> || is_u128_v<T>;
template <class T>
concept i128_c = is_u128_v<T>;

template <class T>
constexpr bool is_int_v = std::is_integral_v<T> || is_i128_v<T>;
template <class T>
concept int_c = is_int_v<T>;

template <class T>
constexpr bool is_sint_v = is_s128_v<T> || (is_int_v<T> && std::is_signed_v<T>);
template <class T>
concept sint_c = is_sint_v<T>;

template <class T>
constexpr bool is_uint_v = is_u128_v<T> || (is_int_v<T> && std::is_unsigned_v<T>);
template <class T>
concept uint_c = is_uint_v<T>;

template <class T>
concept mint_c = requires(T x) {
  { x.mod() } -> uint_c;
  { x.val() } -> uint_c;
};

template <class T>
constexpr bool is_arithm_v = std::is_arithmetic_v<T> || is_int_v<T>;
template <class T>
concept arithm_c = is_arithm_v<T>;

template <class T>
struct to_sint : std::make_signed<T> {};
template <>
struct to_sint<u128> {
  using type = u128;
};
template <>
struct to_sint<i128> {
  using type = u128;
};
template <class T>
using to_sint_t = typename 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 = typename to_uint<T>::type;

}  // namespace tifa_libs


#line 6 "src/code/util/fp_comp.hpp"

namespace tifa_libs {

template <sint_c T>
constexpr int sgn(T x) { return (!!x) | (x >> (sizeof(T) * 8 - 1)); }
template <uint_c T>
constexpr int sgn(T x) { return !!x; }
template <std::floating_point FP>
constexpr int sgn(FP x) { return (x > eps_v<FP>)-(x < -eps_v<FP>); }

template <class FP>
constexpr bool is_neg(FP x) { return sgn(x) < 0; }
template <class FP>
constexpr bool is_zero(FP x) { return !sgn(x); }
template <class FP>
constexpr bool is_pos(FP x) { return sgn(x) > 0; }

template <int_c T>
constexpr int comp(T l, T r) { return sgn(l - r); }
template <std::floating_point FP>
constexpr int comp(FP l, FP r) { return sgn((l - r) / std::max({std::abs(l), std::abs(r), FP(1)})); }

template <class FP>
constexpr bool is_lt(FP l, FP r) { return comp(l, r) < 0; }
template <class FP>
constexpr bool is_eq(FP l, FP r) { return !comp(l, r); }
template <class FP>
constexpr bool is_gt(FP l, FP r) { return comp(l, r) > 0; }

}  // namespace tifa_libs


#line 5 "src/code/geo2d/point.hpp"

namespace tifa_libs::geo {

template <class FP>
struct point {
  FP x, y;
  explicit constexpr point(FP x = FP{}, FP y = FP{}) : x(x), y(y) {}

  friend std::istream &operator>>(std::istream &is, point &p) { return is >> p.x >> p.y; }
  friend std::ostream &operator<<(std::ostream &os, point const &p) { return os << p.x << ' ' << p.y; }

  // s * r + t * (1 - r)
  friend constexpr point lerp(point const &s, point const &t, FP r) { return s * r + t * (1 - r); }
  friend constexpr point mid_point(point const &s, point const &t) { return lerp(s, t, .5); }

  constexpr point &operator+=(FP n) {
    this->x += n;
    this->y += n;
    return *this;
  }
  constexpr point &operator-=(FP n) {
    this->x -= n;
    this->y -= n;
    return *this;
  }
  constexpr point &operator*=(FP n) {
    this->x *= n;
    this->y *= n;
    return *this;
  }
  constexpr point &operator/=(FP n) {
    this->x /= n;
    this->y /= n;
    return *this;
  }
  friend constexpr point operator+(point x, FP n) { return x += n; }
  friend constexpr point operator+(FP n, point x) { return x += n; }
  friend constexpr point operator-(point x, FP n) { return x -= n; }
  friend constexpr point operator-(FP n, point x) { return x -= n; }
  friend constexpr point operator*(point x, FP n) { return x *= n; }
  friend constexpr point operator*(FP n, point x) { return x *= n; }
  friend constexpr point operator/(point x, FP n) { return x /= n; }
  friend constexpr point operator/(FP n, point x) { return x /= n; }

  constexpr point &operator+=(point const &p) {
    this->x += p.x;
    this->y += p.y;
    return *this;
  }
  constexpr point &operator-=(point const &p) {
    this->x -= p.x;
    this->y -= p.y;
    return *this;
  }
  constexpr point operator+(point const &p) const { return point(*this) += p; }
  constexpr point operator-(point const &p) const { return point(*this) -= p; }

  constexpr point operator-() const { return point{-x, -y}; }
  constexpr auto operator<=>(point const &p) const {
    if (auto c = comp(x, p.x); c) return c;
    return comp(y, p.y);
  }
  constexpr bool operator==(point const &p) const { return is_eq(x, p.x) && is_eq(y, p.y); }

  constexpr FP operator*(point const &p) const { return x * p.x + y * p.y; }
  constexpr FP operator^(point const &p) const { return x * p.y - y * p.x; }

  constexpr auto arg() const { return std::atan2(y, x); }
  constexpr FP norm2() const { return x * x + y * y; }
  constexpr FP norm() const { return std::hypot(x, y); }
  constexpr point &do_unit() { return *this /= norm(); }

  static constexpr u32 QUAD__[9] = {6, 7, 8, 5, 0, 1, 4, 3, 2};
  // 4 3 2
  // 5 0 1
  // 6 7 8
  constexpr u32 quad() const { return QUAD__[(sgn(y) + 1) * 3 + sgn(x) + 1]; }

  constexpr point &do_rot(FP theta) {
    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;
  }
  constexpr point &do_rot90() {
    FP tmp = x;
    x = -y;
    y = tmp;
    return *this;
  }
  friend constexpr point rot90(point p) { return p.do_rot90(); }
  constexpr point &do_rot270() {
    FP tmp = y;
    y = -x;
    x = tmp;
    return *this;
  }
  friend constexpr point rot270(point p) { return p.do_rot270(); }
};

}  // namespace tifa_libs::geo


#line 5 "src/code/geo2d/make_p_polar.hpp"

namespace tifa_libs::geo {

template <class FP>
constexpr point<FP> make_P_polar(FP r, FP theta) { return point{r * std::cos(theta), r * std::sin(theta)}; }

}  // namespace tifa_libs::geo


#line 1 "src/code/geo2d/massp.hpp"



#line 1 "src/code/geo2d/polygon.hpp"



#line 1 "src/code/edh/discretization.hpp"



#line 5 "src/code/edh/discretization.hpp"

namespace tifa_libs {

template <iterable_c T = vec<int>>
constexpr T uniq(T v) {
  std::ranges::sort(v);
  auto [f, l] = std::ranges::unique(v);
  v.erase(f, l);
  return v;
}
template <iterable_c T = vec<int>>
constexpr std::pair<T, vec<u32>> gen_id(T const &v) {
  T _ = uniq(v);
  vec<u32> _1;

  for (u32 i = 0; i < v.size(); ++i) _1.push_back(u32(std::ranges::lower_bound(_, v[i]) - _.begin()));
  return {_, _1};
}

}  // namespace tifa_libs


#line 1 "src/code/geo2d/cross.hpp"



#line 5 "src/code/geo2d/cross.hpp"

namespace tifa_libs::geo {

// (a - o) ^ (b - o)
template <class FP>
constexpr FP cross(point<FP> const &o, point<FP> const &a, point<FP> const &b) { return (a.x - o.x) * (b.y - o.y) - (b.x - o.x) * (a.y - o.y); }
template <class FP>
constexpr FP cross_unit(point<FP> const &o, point<FP> const &a, point<FP> const &b) { return (a - o).do_unit() ^ (b - o).do_unit(); }
template <class FP>
constexpr int sgn_cross(point<FP> const &o, point<FP> const &a, point<FP> const &b) { return sgn(cross_unit(o, a, b)); }

}  // namespace tifa_libs::geo


#line 1 "src/code/geo2d/dist_pp.hpp"



#line 5 "src/code/geo2d/dist_pp.hpp"

namespace tifa_libs::geo {

// distance of two points (Euclidian)
template <class FP>
constexpr FP dist_PP(point<FP> const &p1, point<FP> const &p2) { return (p1 - p2).norm(); }

}  // namespace tifa_libs::geo


#line 7 "src/code/geo2d/polygon.hpp"

namespace tifa_libs::geo {

template <class FP>
struct polygon {
  vec<point<FP>> vs;

  constexpr polygon() {}
  explicit constexpr polygon(u32 sz) : vs(sz) {}
  explicit constexpr polygon(vec<point<FP>> const &vs_) : vs(vs_) {}

  friend std::istream &operator>>(std::istream &is, polygon &p) {
    for (auto &i : p.vs) is >> i;
    return is;
  }
  friend std::ostream &operator<<(std::ostream &os, polygon const &p) {
    if (p.vs.empty()) return os;
    for (auto it = p.vs.begin(); it != p.vs.end() - 1; ++it) os << *it << ' ';
    return os << p.vs.back();
  }
  constexpr point<FP> &operator[](u32 x) { return vs[x]; }
  constexpr point<FP> const &operator[](u32 x) const { return vs[x]; }

  constexpr polygon &resort() {
    std::ranges::sort(vs);
    return *this;
  }
  constexpr polygon &reunique() {
    vs = uniq(vs);
    return *this;
  }

  constexpr auto prev(typename vec<point<FP>>::const_iterator it) const { return --(it == vs.begin() ? it = vs.end() : it); }
  constexpr auto next(typename vec<point<FP>>::const_iterator it) const { return ++it == vs.end() ? vs.begin() : it; }
  constexpr u32 prev(u32 idx) const { return idx == 0 ? (u32)vs.size() - 1 : idx - 1; }
  constexpr u32 next(u32 idx) const { return idx + 1 == (u32)vs.size() ? 0 : idx + 1; }

  constexpr FP circum() const {
    FP ret = dist_PP(vs.back(), vs.front());
    for (u32 i = 0; i < (u32)vs.size() - 1; ++i) ret += dist_PP(vs[i], vs[i + 1]);
    return ret;
  }
  constexpr FP area() const {
    if (vs.size() < 3) return 0;
    FP ret = vs.back() ^ vs.front();
    for (u32 i = 0; i < (u32)vs.size() - 1; ++i) ret += vs[i] ^ vs[i + 1];
    return ret / 2;
  }
  constexpr bool is_convex() const {
    bool flag[2] = {false, false};
    u32 n = (u32)vs.size();
    if (n < 3) return true;
    for (u32 i = 0, j = next(i), k = next(j); i < n; ++i, j = next(j), k = next(k)) {
      auto sgn = sgn_cross(vs[i], vs[j], vs[k]);
      if (sgn) flag[(sgn + 1) / 2] = true;
      if (flag[0] && flag[1]) return false;
    }
    return true;
  }
};

}  // namespace tifa_libs::geo


#line 5 "src/code/geo2d/massp.hpp"

namespace tifa_libs::geo {

template <class FP>
constexpr point<FP> massp(polygon<FP> const &po) {
  point<FP> ret{};
  FP area{};
  u32 n = (u32)po.vs.size();
  if (n == 0) return ret;
  if (n == 1) return po.vs[0];
  for (u32 i = 1; i < n - 1; ++i) {
    FP tmp = cross(po.vs[0], po.vs[i], po.vs[i + 1]);
    if (is_zero(tmp)) continue;
    area += tmp;
    ret += (po.vs[0] + po.vs[i] + po.vs[i + 1]) * (tmp / 3);
  }
  if (!is_zero(area)) ret /= area;
  return ret;
}

}  // namespace tifa_libs::geo


#line 7 "src/code/geo2d/fermatp.hpp"

namespace tifa_libs::geo {

// simulated annealing
template <class FP>
point<FP> fermatp(polygon<FP> const &po, FP begin = 1e10, FP end = eps_v<FP>, FP delta = .999) {
  static rand::Gen<std::uniform_real_distribution<FP>> gen_angle(0, 2 * pi_v<FP>);
  auto gen = [](point<FP> const &pre, FP t) { return pre + make_P_polar(t, gen_angle()); };
  auto fitness = [&po](point<FP> const &p) {
    FP dis = 0;
    for (u32 i = 0; i < po.vs.size(); ++i) dis += dist_PP(po.vs[i], p);
    return dis;
  };
  opt::heuristic_sa<point<FP>, decltype(gen), decltype(fitness), FP, FP> sa(gen, fitness, begin, end, delta);
  return sa(sa(sa(massp(po)).second).second).second;
}

}  // namespace tifa_libs::geo


#line 1 "src/test_cpverifier/unit-test/base.hpp"



#line 1 "src/code/io/ios128.hpp"



#line 5 "src/code/io/ios128.hpp"

inline std::istream &operator>>(std::istream &is, i128 &n) {
  bool neg = false;
  while (!neg && !isdigit(is.peek())) {
    if (is.peek() == '-') neg = true;
    is.get();
  }
  n = 0;
  while (isdigit(is.peek())) (n *= 10) += is.get() & 15;
  if (neg) n = -n;
  return is;
}
inline std::istream &operator>>(std::istream &is, u128 &n) {
  while (!isdigit(is.peek())) is.get();
  n = 0;
  while (isdigit(is.peek())) (n *= 10) += is.get() & 15;
  return is;
}
inline std::ostream &operator<<(std::ostream &os, u128 n) {
  if (n > 9) os << n / 10;
  os << (uint_fast32_t)(n % 10);
  return os;
}
inline std::ostream &operator<<(std::ostream &os, i128 n) {
  if (n < 0) {
    os << '-';
    n = -n;
  }
  return os << (u128)n;
}


#line 1 "src/code/io/ios_container.hpp"



#line 5 "src/code/io/ios_container.hpp"

template <tifa_libs::container_c T>
std::istream &operator>>(std::istream &is, T &x) {
  for (auto &i : x) is >> i;
  return is;
}
template <tifa_libs::container_c T>
std::ostream &operator<<(std::ostream &os, T const &x) {
  if (x.begin() == x.end()) return os;
  auto it = x.begin();
  os << *it++;
  for (; it != x.end(); ++it) os << ' ' << *it;
  return os;
}


#line 1 "src/code/io/ios_pair.hpp"



#line 5 "src/code/io/ios_pair.hpp"

template <class T, class U>
std::istream &operator>>(std::istream &is, std::pair<T, U> &p) { return is >> p.first >> p.second; }
template <class T, class U>
std::ostream &operator<<(std::ostream &os, std::pair<T, U> const &p) { return os << p.first << ' ' << p.second; }


#line 1 "src/code/io/ios_tuple.hpp"



#line 5 "src/code/io/ios_tuple.hpp"

template <class... Ts>
std::istream &operator>>(std::istream &is, std::tuple<Ts...> &p) {
  std::apply([&](Ts &...targs) { ((is >> targs), ...); }, p);
  return is;
}
template <class... Ts>
std::ostream &operator<<(std::ostream &os, std::tuple<Ts...> const &p) {
  std::apply(
      [&](Ts const &...targs) {
        usz n = 0;
        ((os << targs << (++n != sizeof...(Ts) ? " " : "")), ...);
      },
      p);
  return os;
}


#line 10 "src/test_cpverifier/unit-test/base.hpp"

namespace tifa_libs::unittest {

namespace detail__ {

template <class T>
strn to_str(T const &x) {
  std::stringstream ss;
  ss << std::fixed << std::setprecision(12) << x;
  return ss.str();
}

template <class T, class... Ts>
void check_(strn const &pretty_func, strn const &got_str, T const &got, strn const &want_str, T const &want, Ts... param) {
  if constexpr (sizeof...(param) == 0) {
    if (got != want) throw std::runtime_error(pretty_func + ": got \"" + got_str + "\" = " + to_str(got) + ", want \"" + want_str + "\" = " + to_str(want));
  } else {
    if (got != want) throw std::runtime_error(pretty_func + ": got \"" + got_str + "\" = " + to_str(got) + ", want \"" + want_str + "\" = " + to_str(want) + " with" + ((" " + param.first + " = " + ::tifa_libs::unittest::detail__::to_str(param.second) + " ;") + ...));
  }
}

template <class... Ts>
void check_bool_(strn const &pretty_func, strn const &expression, bool res, Ts... param) {
  if constexpr (sizeof...(param) == 0) {
    if (!res) throw std::runtime_error(pretty_func + " :\"" + expression + "\" failed");
  } else {
    if (!res) throw std::runtime_error(pretty_func + " :\"" + expression + "\" failed with" + ((" " + param.first + " = " + ::tifa_libs::unittest::detail__::to_str(param.second) + " ;") + ...));
  }
}

}  // namespace detail__

enum TESTCASE { ts_local,
                ts_example_00,
                ts_example_01,
                ts_random_00,
                ts_random_01,
                ts_random_02,
                ts_random_03,
                ts_random_04,
                ts_random_05,
                ts_random_06,
                ts_random_07,
                ts_random_08,
                ts_random_09 };

inline const std::map<ptt<u32>, TESTCASE> testcase_id{
    {{1234, 5678}, ts_example_00},
    {{1000000000, 1000000000}, ts_example_01},
    {{192279220, 156648746}, ts_random_00},
    {{264704197, 120999146}, ts_random_01},
    {{682152023, 451794314}, ts_random_02},
    {{627477696, 504915182}, ts_random_03},
    {{729561619, 415335212}, ts_random_04},
    {{173330281, 220603612}, ts_random_05},
    {{841413509, 58432763}, ts_random_06},
    {{251229786, 256388306}, ts_random_07},
    {{118232767, 222490630}, ts_random_08},
    {{907649120, 290651129}, ts_random_09}};

inline void post_test([[maybe_unused]] ptt<u32> const &p = {0, 0}) {
#ifndef LOCAL_
  static ptt<u32> p_{0, 0};
  if (p.first || p.second) {
    p_ = p;
    return;
  }
  std::cout << p_.first + p_.second << '\n';
  exit(0);
#endif
}

inline TESTCASE pre_test() {
#ifndef LOCAL_
  ptt<u32> p;
  std::cin >> p.first >> p.second;
  post_test(p);
  return testcase_id.at(p);
#else
  return ts_local;
#endif
}

#define check(got, want, ...) ::tifa_libs::unittest::detail__::check_(__PRETTY_FUNCTION__, #got, got, #want, want __VA_OPT__(, ) __VA_ARGS__)
#define check_bool(expression, ...) ::tifa_libs::unittest::detail__::check_bool_(__PRETTY_FUNCTION__, #expression, expression __VA_OPT__(, ) __VA_ARGS__)
#define check_param(x) \
  std::pair<std::string, decltype(x)> { #x " = ", x }

}  // namespace tifa_libs::unittest


#line 6 "src/test_cpverifier/unit-test/geo2d/fermatp.test.cpp"

using tifa_libs::geo::point, tifa_libs::geo::polygon;

template <class T>
void single_test(vec<point<T>> const& v) {
  check_bool(v.size() >= 3, check_param(v));

  polygon<T> poly(v);
  point<T> fp_poly = fermatp(poly);

  point<T> sum(0, 0);
  for (auto const& i : v) sum += (i - fp_poly).do_unit();
  check_bool(tifa_libs::is_lt(sum.norm(), (T)2), check_param(v), check_param(fp_poly), check_param(sum));
}

template <tifa_libs::arithm_c T>
void test(T lim) {
  tifa_libs::rand::Gen<std::conditional_t<std::is_integral_v<T>, std::uniform_int_distribution<T>, std::uniform_real_distribution<T>>> g(std::is_signed_v<T> ? -lim : 0, lim);

  vec<point<T>> v{point<T>(g(), g()), point<T>(g(), g()), point<T>(g(), g())};
  single_test(v);
  v.emplace_back(g(), g());
  single_test(v);
  while (v.size() < 10) v.emplace_back(g(), g());
  single_test(v);
  while (v.size() < 50) v.emplace_back(g(), g());
  single_test(v);
}

int main() {
  auto tcase = tifa_libs::unittest::pre_test();

  switch (tcase) {
    case tifa_libs::unittest::ts_example_00: test<f64>(1e5); break;
    case tifa_libs::unittest::ts_example_01: test<f128>(1e5); break;
    case tifa_libs::unittest::ts_random_00: test<f64>(1e9); break;
    case tifa_libs::unittest::ts_random_01: test<f128>(1e9); break;
    case tifa_libs::unittest::ts_random_02: break;
    case tifa_libs::unittest::ts_random_03: break;
    case tifa_libs::unittest::ts_random_04: break;
    case tifa_libs::unittest::ts_random_05: break;
    case tifa_libs::unittest::ts_random_06: break;
    case tifa_libs::unittest::ts_random_07: break;
    case tifa_libs::unittest::ts_random_08: break;
    case tifa_libs::unittest::ts_random_09: break;
    default: break;
  }

  tifa_libs::unittest::post_test();
}

Test cases

Env Name Status Elapsed Memory
g++-12 example_00 :heavy_check_mark: AC 113 ms 4 MB
g++-12 example_01 :heavy_check_mark: AC 593 ms 4 MB
g++-12 random_00 :heavy_check_mark: AC 108 ms 4 MB
g++-12 random_01 :heavy_check_mark: AC 590 ms 4 MB
g++-12 random_02 :heavy_check_mark: AC 10 ms 4 MB
g++-12 random_03 :heavy_check_mark: AC 9 ms 4 MB
g++-12 random_04 :heavy_check_mark: AC 10 ms 4 MB
g++-12 random_05 :heavy_check_mark: AC 10 ms 4 MB
g++-12 random_06 :heavy_check_mark: AC 10 ms 4 MB
g++-12 random_07 :heavy_check_mark: AC 9 ms 4 MB
g++-12 random_08 :heavy_check_mark: AC 9 ms 4 MB
g++-12 random_09 :heavy_check_mark: AC 9 ms 4 MB
Back to top page