結果
| 問題 | No.2764 Warp Drive Spacecraft |
| コンテスト | |
| ユーザー |
miscalc
|
| 提出日時 | 2026-11-20 02:54:00 |
| 言語 | C++23 (gcc 15.3.0 + boost 1.92.0 + ACL) |
| 結果 |
AC
不安定
|
| 実行時間 | 118 ms / 3,000 ms |
| + 675µs | |
| コード長 | 83,385 bytes |
| 記録 | |
| コンパイル時間 | 4,113 ms |
| コンパイル使用メモリ | 421,568 KB |
| 実行使用メモリ | 29,932 KB |
| 最終ジャッジ日時 | 2026-11-20 02:54:14 |
| 合計ジャッジ時間 | 11,322 ms |
|
ジャッジサーバーID (参考情報) |
judge4_0 / judge5_0 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 39 |
ソースコード
// https://github.com/miscalculation53/library
#define SINGLE_TESTCASE
// #define MULTI_TESTCASE
// #define AOJ_TESTCASE
#define FAST_IO
// #define FAST_CIO
// #define INTERACTIVE
#define INF 4'000'000'000'000'000'037LL
#define EPS 1e-11
#line 30
#include <bits/stdc++.h>
using namespace std;
#if __cplusplus > 202002L && defined(__STDCPP_FLOAT128_T__)
#include <stdfloat>
using f128 = std::float128_t;
#elif defined(__SIZEOF_FLOAT128__)
using f128 = __float128;
#else
#error "f128 requires a compiler with IEEE binary128 support, such as GCC on x86_64."
#endif
#define LIBRARY_HAS_FLOAT128 1
#include <cassert>
using namespace std;
using ld = decltype(EPS);
using ll = long long;
using uint = unsigned int;
using ull = unsigned long long;
using pll = pair<ll, ll>;
using tlll = tuple<ll, ll, ll>;
using tllll = tuple<ll, ll, ll, ll>;
#define vc vector
template <class T>
using vvc = vc<vc<T>>;
template <class T>
using vvvc = vc<vc<vc<T>>>;
using vb = vc<bool>;
using vl = vc<ll>;
using vpll = vc<pll>;
using vtlll = vc<tlll>;
using vtllll = vc<tllll>;
using vstr = vc<string>;
using vvb = vvc<bool>;
using vvl = vvc<ll>;
template <class T>
using pql = priority_queue<T, vc<T>, greater<T>>;
template <class T>
using pqg = priority_queue<T>;
using i128 = __int128_t;
using u128 = __uint128_t;
#define cauto const auto
#line 103
//! https://gcc.gnu.org/onlinedocs/libquadmath/Math-Library-Routines.html
#line 289
i128 stoi128(const string &s)
{
const bool neg = s.front() == '-';
u128 res = 0;
for (size_t i = size_t(neg); i < s.size(); i++)
res = 10 * res + unsigned(s[i] - '0');
if (neg)
return -i128(res - 1) - 1;
return i128(res);
}
inline string u128tos(u128 x)
{
string res;
do
{
res += char('0' + x % 10);
x /= 10;
} while (x > 0);
reverse(res.begin(), res.end());
return res;
}
string i128tos(i128 x)
{
return x < 0 ? "-" + u128tos(u128(-(x + 1)) + 1) : u128tos(u128(x));
}
istream &operator>>(istream &is, i128 &a)
{
string s;
if (!(is >> s)) return is;
a = stoi128(s);
return is;
}
ostream &operator<<(ostream &os, const i128 &a)
{
os << i128tos(a);
return os;
}
#line 337
#define overload4(_1, _2, _3, _4, name, ...) name
#define LIBRARY_REPEAT_LOOP(T, i, l, r, d) \
for (auto [i, library_repeat_end, library_repeat_step] = array<T, 3>{T(l), T(r), T(d)}; \
library_repeat_step > 0 ? i < library_repeat_end : i > library_repeat_end; \
i += library_repeat_step)
#define rep1(i, n) LIBRARY_REPEAT_LOOP(ll, i, 0, n, 1)
#define rep2(i, l, r) LIBRARY_REPEAT_LOOP(ll, i, l, r, 1)
#define rep3(i, l, r, d) LIBRARY_REPEAT_LOOP(ll, i, l, r, d)
#define rep(...) overload4(__VA_ARGS__, rep3, rep2, rep1)(__VA_ARGS__)
#define repi1(i, n) LIBRARY_REPEAT_LOOP(int, i, 0, n, 1)
#define repi2(i, l, r) LIBRARY_REPEAT_LOOP(int, i, l, r, 1)
#define repi3(i, l, r, d) LIBRARY_REPEAT_LOOP(int, i, l, r, d)
#define repi(...) overload4(__VA_ARGS__, repi3, repi2, repi1)(__VA_ARGS__)
#define fe(...) for (auto __VA_ARGS__)
#define fec(...) for (cauto &__VA_ARGS__)
#define fem(...) for (auto &__VA_ARGS__)
#line 408
template <class T, class U, class P>
constexpr pair<T, U> &operator+=(pair<T, U> &a, const P &b)
{
a.first += b.first;
a.second += b.second;
return a;
}
template <class T, class U, class P>
constexpr pair<T, U> operator+(pair<T, U> a, const P &b) { return a += b; }
template <class T, class U, class P>
constexpr pair<T, U> &operator-=(pair<T, U> &a, const P &b)
;
template <class T, class U, class P>
constexpr pair<T, U> operator-(pair<T, U> a, const P &b) { return a -= b; }
template <class T, class U>
constexpr pair<T, U> operator-(pair<T, U> a)
{
a.first = -a.first;
a.second = -a.second;
return a;
}
template <class T, size_t n, class A>
constexpr array<T, n> &operator+=(array<T, n> &a, const A &b)
{
for (size_t i = 0; i < n; i++)
a[i] += b[i];
return a;
}
template <class T, size_t n, class A>
constexpr array<T, n> operator+(array<T, n> a, const A &b) { return a += b; }
template <class T, size_t n, class A>
constexpr array<T, n> &operator-=(array<T, n> &a, const A &b)
;
template <class T, size_t n, class A>
constexpr array<T, n> operator-(array<T, n> a, const A &b) { return a -= b; }
template <class T, size_t n>
constexpr array<T, n> operator-(array<T, n> a)
{
for (auto &ai : a)
ai = -ai;
return a;
}
namespace internal
{
template <size_t... I, class A, class B>
constexpr auto &tuple_add_impl(A &a, const B &b, const index_sequence<I...>)
{
((get<I>(a) += get<I>(b)), ...);
return a;
}
template <size_t... I, class A, class B>
constexpr auto &tuple_sub_impl(A &a, const B &b, const index_sequence<I...>)
;
template <size_t... I, class A>
constexpr auto &tuple_neg_impl(A &a, const index_sequence<I...>)
;
};
template <class... Ts, class Tp>
constexpr tuple<Ts...> &operator+=(tuple<Ts...> &a, const Tp &b)
{ return internal::tuple_add_impl(a, b, make_index_sequence<tuple_size_v<tuple<Ts...>>>{}); }
template <class... Ts, class Tp>
constexpr tuple<Ts...> operator+(tuple<Ts...> a, const Tp &b) { return a += b; }
template <class... Ts, class Tp>
constexpr tuple<Ts...> &operator-=(tuple<Ts...> &a, const Tp &b)
;
template <class... Ts, class Tp>
constexpr tuple<Ts...> operator-(tuple<Ts...> a, const Tp &b) { return a -= b; }
template <class... Ts>
constexpr tuple<Ts...> operator-(tuple<Ts...> a)
{
internal::tuple_neg_impl(a, make_index_sequence<sizeof...(Ts)>{});
return a;
}
#line 512
template <class T>
constexpr bool is_integral_ext = is_integral_v<T> || is_same_v<T, i128> || is_same_v<T, u128>;
template <class T>
constexpr bool is_signed_ext = is_signed_v<T> || is_same_v<T, i128>;
template <class T>
constexpr bool is_unsigned_ext = is_unsigned_v<T> || is_same_v<T, u128>;
#line 531
template <class T>
struct make_unsigned_ext
{
using type = make_unsigned_t<T>;
};
template <>
struct make_unsigned_ext<i128>
{
using type = u128;
};
template <>
struct make_unsigned_ext<u128>
{
using type = u128;
};
template <class T>
using make_unsigned_ext_t = typename make_unsigned_ext<T>::type;
template <class T>
struct make_signed_ext
{
using type = make_signed_t<T>;
};
template <>
struct make_signed_ext<u128>
{
using type = i128;
};
template <class T>
using make_signed_ext_t = typename make_signed_ext<T>::type;
template <class T>
constexpr bool is_negative(T x)
{
static_assert(is_integral_ext<T>);
if constexpr (is_signed_ext<T>) return x < 0;
return false;
}
template <class T>
constexpr make_unsigned_ext_t<T> unsigned_abs(T x)
;
template <class T, bool = is_integral_ext<T>>
struct unsigned_arithmetic { using type = T; };
template <class T>
struct unsigned_arithmetic<T, true>
{
static_assert(!is_same_v<T, bool>);
using type = common_type_t<unsigned int, make_unsigned_ext_t<T>>;
};
template <class T>
using unsigned_arithmetic_t = typename unsigned_arithmetic<T>::type;
template <class R, class T>
constexpr R wrapping_cast(T x)
;
#line 625
template <class T>
constexpr decltype(auto) default_infty();
namespace default_infty_detail
{
template <class T>
struct is_product : false_type {};
template <class T, class U>
struct is_product<pair<T, U>> : true_type {};
template <class... Ts>
struct is_product<tuple<Ts...>> : true_type {};
template <class T, size_t n>
struct is_product<array<T, n>> : true_type {};
template <class T, size_t... I>
constexpr T product_value(index_sequence<I...>)
;
template <class T, class = void>
struct has_infty : false_type {};
template <class T>
struct has_infty<T, void_t<decltype(T::infty())>> : true_type {};
template <class T>
const T &custom_value()
;
template <class T>
inline constexpr bool unsupported = false;
}
template <class T>
constexpr decltype(auto) default_infty()
{
if constexpr (default_infty_detail::has_infty<T>::value)
return default_infty_detail::custom_value<T>();
else if constexpr (default_infty_detail::is_product<remove_cv_t<T>>::value)
return default_infty_detail::product_value<remove_cv_t<T>>(
make_index_sequence<tuple_size_v<remove_cv_t<T>>>{});
else if constexpr (is_same_v<T, i128> || is_same_v<T, u128>)
return T(INF) * T(INF);
else if constexpr (is_integral_ext<T> && !is_same_v<T, bool>)
{
if constexpr (sizeof(T) >= sizeof(ll))
return T(INF);
else if constexpr (numeric_limits<T>::digits >= 31)
return (T(1) << 30) - 1;
else
return T(numeric_limits<T>::max() / 2);
}
else if constexpr (numeric_limits<T>::has_infinity)
return numeric_limits<T>::infinity();
else
static_assert(default_infty_detail::unsupported<T>, "No default infinity for this type; specify infty explicitly or define T::infty().");
}
template <class T, class U>
inline bool chmin(T &a, U b) { return a > b ? a = b, true : false; }
template <class T, class U>
inline bool chmax(T &a, U b) { return a < b ? a = b, true : false; }
template <class T, enable_if_t<is_same_v<T, i128> || is_same_v<T, u128>, int> = 0>
inline constexpr T abs(T x) ;
namespace template_math_detail
{
template <class T, class U>
constexpr common_type_t<T, U> gcd(T a, U b)
;
#line 720
template <class T, class U>
constexpr common_type_t<T, U> lcm(T a, U b)
;
}
template <class T, enable_if_t<is_integral_ext<T> && !is_same_v<T, bool>, int> = 0>
constexpr common_type_t<i128, T> gcd(i128 a, T b) ;
template <class T, enable_if_t<is_integral_ext<T> && !is_same_v<T, bool> && !is_same_v<T, i128> && !is_same_v<T, u128>, int> = 0>
constexpr common_type_t<T, i128> gcd(T a, i128 b) ;
template <class T, enable_if_t<is_integral_ext<T> && !is_same_v<T, bool>, int> = 0>
constexpr common_type_t<u128, T> gcd(u128 a, T b) ;
template <class T, enable_if_t<is_integral_ext<T> && !is_same_v<T, bool> && !is_same_v<T, i128> && !is_same_v<T, u128>, int> = 0>
constexpr common_type_t<T, u128> gcd(T a, u128 b) ;
template <class T, enable_if_t<is_integral_ext<T> && !is_same_v<T, bool>, int> = 0>
constexpr common_type_t<i128, T> lcm(i128 a, T b) ;
template <class T, enable_if_t<is_integral_ext<T> && !is_same_v<T, bool> && !is_same_v<T, i128> && !is_same_v<T, u128>, int> = 0>
constexpr common_type_t<T, i128> lcm(T a, i128 b) ;
template <class T, enable_if_t<is_integral_ext<T> && !is_same_v<T, bool>, int> = 0>
constexpr common_type_t<u128, T> lcm(u128 a, T b) ;
template <class T, enable_if_t<is_integral_ext<T> && !is_same_v<T, bool> && !is_same_v<T, i128> && !is_same_v<T, u128>, int> = 0>
constexpr common_type_t<T, u128> lcm(T a, u128 b) ;
template <class T = ll, class U, class V, typename = enable_if_t<is_integral_ext<U> && is_integral_ext<V>>>
inline constexpr T divfloor(U a, V b) { return T(a) / T(b) - (T(a) % T(b) && (T(a) ^ T(b)) < 0); }
template <class T = ll, class U, class V, typename = enable_if_t<is_integral_ext<U> && is_integral_ext<V>>>
inline constexpr T divceil(U a, V b) ;
template <class T = ll, class U, class V, typename = enable_if_t<is_integral_ext<U> && is_integral_ext<V>>>
inline constexpr T safemod(U a, V b)
{
const T x = T(a), y = T(b);
if constexpr (is_signed_ext<T>)
if (y == T(-1)) return T(0);
const T r = x % y;
return r != T(0) && is_negative(x) != is_negative(y) ? T(r + y) : r;
}
template <class T = ll, class U, class V>
constexpr T ipow(U a, V b)
;
#line 791
template <class T = ll, class A, class B, class M>
T mul_limited(A a, B b, M m)
;
template <class T = ll, class A, class B>
T mul_limited(A a, B b) ;
template <class T = ll, class A, class B, class M>
T pow_limited(A a, B b, M m)
;
#line 826
template <class T = ll, class A, class B>
T pow_limited(A a, B b) ;
template <class T = ll, class A, class K>
constexpr T iroot(A a, K k)
;
#line 885
template <class T = ll, class A, class K>
constexpr T iroot_ceil(A a, K k)
;
//! https://misawa.github.io/others/avoid_errors/techniques_to_avoid_errors.html
template <class D = decltype(EPS), class A>
int SGN(A a, D eps = EPS) ;
template <class T = ll, class U, class V>
vc<T> base_repr(U val, V base)
;
#line 915
template <class T = ll, class U, class V>
vc<T> base_repr(U val, V base, int n)
;
#line 930
template <const bool use_upper = true, class U>
string base_repr_str(U val, int base)
;
template <const bool use_upper = true, class U>
string base_repr_str(U val, int base, int n)
;
#line 963
#define ALL(a) (a).begin(), (a).end()
template <class T = ll, class V>
inline T SZ(const V &x) { return x.size(); }
#define eb emplace_back
#define LMD(x, fx) ([&](const auto &x) { return fx; })
template <class F>
auto gen_vec(int n, const F &f)
;
#define GEN_VEC(n, i, fi) (gen_vec(n, LMD(i, fi)))
namespace template_vector_detail
{
template <class T, size_t depth>
struct nested_vector
{
using type = vc<typename nested_vector<T, depth - 1>::type>;
};
template <class T>
struct nested_vector<T, 0>
{
using type = T;
};
template <class T, size_t depth, class V>
void populate_dimensions(typename nested_vector<T, depth>::type &result, const V *sizes, const T &init)
;
#line 1008
template <class T, size_t depth, class V>
typename nested_vector<T, depth>::type build_dimensions(const V *sizes, const T &init)
;
}
template <class T, size_t d, size_t i = 0, class V>
auto dvec(const V (&sz)[d], const T &init)
;
template <class T, size_t d, size_t i = 0>
auto dvec(const ll (&sz)[d], const T &init)
;
template <class V, class T>
void fill(V &v, const T &value)
{
if constexpr (is_assignable_v<decltype(*std::begin(v)), const T &>)
std::fill(std::begin(v), std::end(v), value);
else
for (auto &row : v) fill(row, value);
}
template <class T = ll>
optional<T> ctol(const char &c, const string &s)
;
template <class T = ll>
vc<T> stov(const string &s, char first)
;
template <class T = ll>
optional<vc<T>> stov(const string &s, const string &t)
;
template <class T>
string vtos(const vc<T> &v, char first)
;
template <class T>
string vtos(const vc<T> &v, const string &t)
;
template <class T>
vc<T> concat(const vvc<T> &vs)
;
template <class T>
vc<T> concat(const vc<T> &v) ;
template <class T, class... Ts>
vc<T> concat(vc<T> v, const vc<Ts> &...vs)
;
template <class T>
vc<T> merged(const vc<T> &a, const vc<T> &b)
;
template <class T, class I>
T vecget(const vc<T> &v, I i, const T &dflt_negative = -default_infty<T>(), const T &dflt_positive = default_infty<T>())
;
#line 1134
template <class T, auto x, enable_if_t<!is_invocable_v<decltype(x)>, int> = 0>
constexpr T resolved_value()
;
template <class T, auto x, enable_if_t<is_invocable_v<decltype(x)>, long> = 0>
const T &resolved_value()
;
template <class T, auto x = nullptr>
constexpr decltype(auto) resolved_infty()
{
if constexpr (is_same_v<decltype(x), nullptr_t>)
return default_infty<T>();
else
return resolved_value<T, x>();
}
namespace internal
{
template <class M, class I, class = void>
struct HasMonoidPow : false_type {};
template <class M, class I>
struct HasMonoidPow<M, I, void_t<decltype(M::pow(declval<const typename M::S &>(), declval<I>()))>> : true_type {};
}
namespace internal_monoid_power
{
template <class I>
constexpr void check_exponent(I k)
;
template <class M, class I>
constexpr typename M::S binary_inplace(typename M::S &x, I k)
;
template <class M, class I>
constexpr typename M::S binary(typename M::S x, I k)
;
}
template <class M, class I>
constexpr typename M::S pow_monoid(typename M::S x, I k)
;
template <class G, class I>
constexpr typename G::S pow_group(typename G::S x, I k)
;
#line 1238
template <class V>
auto SUM(const V &v)
;
template <class T, class V>
T SUM(const V &v)
;
template <class V>
auto MAX(const V &v) ;
template <class V>
auto MIN(const V &v) ;
template <class I = ll, class V>
optional<I> ARGMAX(const V &v)
;
template <class I = ll, class V>
optional<I> ARGMIN(const V &v)
;
template<class T = ll, class V>
T mex(const V &a)
;
template <class I>
bool is_permutation(const vc<I> &p)
;
#line 1295
template <class T = ll>
vc<T> permid(const int &n, const int &base_index = 0)
;
template <class T>
vc<T> perminv(const vc<T> &p)
;
template <class T, class U>
vc<T> permuted(const vc<T> &a, const vc<U> &p)
;
template <class T, class U, class... Ts>
vc<T> permuted(const vc<T> &p, const vc<U> &q, const vc<Ts> &...rs)
;
template <class V>
V reversed(const V &v) ;
template <class V, class... Args>
V sorted(V v, Args&&... args)
;
template <class V, class Equal = equal_to<>>
void unique(V &v, Equal equal = {}) { v.erase(std::unique(ALL(v), equal), v.end()); }
template <class V, class Equal = equal_to<>>
V uniqued(V v, Equal equal = {}) ;
template <class V, class Compare = less<>, class Equal = equal_to<>>
void sortunique(V &v, Compare comp = {}, Equal equal = {})
;
template <class V, class Compare = less<>, class Equal = equal_to<>>
V sortuniqued(V v, Compare comp = {}, Equal equal = {})
;
template <class V, class U>
void rotate(V &v, U k)
;
template <class V, class U>
V rotated(V v, U k) ;
template <class T>
vvc<T> top(const vvc<T> &a)
{
if (a.empty())
return {};
const int n = a.size(), m = a[0].size();
vvc<T> b(m, vc<T>(n));
repi(i, n)
{
assert(SZ<int>(a[i]) == m);
repi(j, m) b[j][i] = a[i][j];
}
return b;
}
vstr top(const vstr &a)
{
vvc<char> a_(a.size());
repi(i, SZ<int>(a)) a_[i] = {ALL(a[i])};
vvc<char> b_ = top(a_);
vstr b(b_.size());
repi(i, SZ<int>(b)) b[i] = {ALL(b_[i])};
return b;
}
template <class T, class = void>
struct has_e0 : false_type {};
template <class T>
struct has_e0<T, void_t<decltype(T::e0())>> : true_type {};
template <class T>
inline constexpr bool has_e0_v = has_e0<T>::value;
template <class T>
struct MonoidAdd
{
using S = T;
static constexpr S op(S a, S b) ;
static constexpr S e()
;
template <class I, class = decltype(declval<S>() * declval<I>())>
static constexpr S pow(const S &a, I k) { return a * k; }
};
template <class T, auto infty = nullptr>
struct MonoidMin
{
using S = T;
static constexpr S op(S a, S b) ;
static constexpr decltype(auto) e() ;
template <class I>
static constexpr S pow(const S &a, I k) { return k == 0 ? e() : a; }
};
template <class T, auto infty = nullptr>
struct MonoidMax
{
using S = T;
static constexpr S op(S a, S b) ;
static constexpr S e() ;
template <class I>
static constexpr S pow(const S &a, I k) { return k == 0 ? e() : a; }
};
template <class M>
vc<typename M::S> cuml(const vc<typename M::S> &v, int left_index = 0)
;
template <class M>
vc<typename M::S> cumr(const vc<typename M::S> &v, int right_index = 0)
;
template <class T>
vc<T> cumlsum(const vc<T> &v, int left_index = 0)
;
template <class T>
vc<T> cumrsum(const vc<T> &v, int right_index = 0)
;
template <class T>
vc<T> cumlmin(const vc<T> &v, int left_index = 0)
;
template <class T>
vc<T> cumrmin(const vc<T> &v, int right_index = 0)
;
template <class T>
vc<T> cumlmax(const vc<T> &v, int left_index = 0)
;
template <class T>
vc<T> cumrmax(const vc<T> &v, int right_index = 0)
;
template <class T>
vc<T> adjd(const vc<T> &v, int left_index = 0, int right_index = 0)
;
#line 1504
constexpr array<pll, 4> DRULgrid = {{{1, 0}, {0, 1}, {-1, 0}, {0, -1}}};
constexpr array<pll, 4> DRULplane = {{{0, -1}, {1, 0}, {0, 1}, {-1, 0}}};
template <class T>
struct is_random_access_iterator
{
static constexpr bool value = is_same_v<
typename iterator_traits<T>::iterator_category,
random_access_iterator_tag
>;
};
template <class T>
constexpr bool is_random_access_iterator_v = is_random_access_iterator<T>::value;
#line 1569
template <class T = ll, class V, class Value, class Comp = ranges::less, class Proj = identity>
inline T LB(const V &v, const Value &val, Comp comp = {}, Proj proj = {})
;
template <class T = ll, class V, class Value, class Comp = ranges::less, class Proj = identity>
inline T UB(const V &v, const Value &val, Comp comp = {}, Proj proj = {})
;
#define DEFAULT_COMP ranges::less
template <class T = ll, class V, class Value, class Comp = DEFAULT_COMP, class Proj = identity>
inline auto lt_max(const V &v, const Value &val, Comp comp = {}, Proj proj = {})
-> enable_if_t<is_random_access_iterator_v<typename V::iterator>, T>
;
template <class T = ll, class V, class Value, class Comp = DEFAULT_COMP, class Proj = identity>
inline auto leq_max(const V &v, const Value &val, Comp comp = {}, Proj proj = {})
-> enable_if_t<is_random_access_iterator_v<typename V::iterator>, T>
;
template <class T = ll, class V, class Value, class Comp = DEFAULT_COMP, class Proj = identity>
inline auto gt_min(const V &v, const Value &val, Comp comp = {}, Proj proj = {})
-> enable_if_t<is_random_access_iterator_v<typename V::iterator>, T>
;
template <class T = ll, class V, class Value, class Comp = DEFAULT_COMP, class Proj = identity>
inline auto geq_min(const V &v, const Value &val, Comp comp = {}, Proj proj = {})
-> enable_if_t<is_random_access_iterator_v<typename V::iterator>, T>
;
template <class T = ll, class V, class Value, class Comp = DEFAULT_COMP, class Proj = identity>
inline auto lt_cnt(const V &v, const Value &val, Comp comp = {}, Proj proj = {})
-> enable_if_t<is_random_access_iterator_v<typename V::iterator>, T>
;
template <class T = ll, class V, class Value, class Comp = DEFAULT_COMP, class Proj = identity>
inline auto leq_cnt(const V &v, const Value &val, Comp comp = {}, Proj proj = {})
-> enable_if_t<is_random_access_iterator_v<typename V::iterator>, T>
;
template <class T = ll, class V, class Value, class Comp = DEFAULT_COMP, class Proj = identity>
inline auto gt_cnt(const V &v, const Value &val, Comp comp = {}, Proj proj = {})
-> enable_if_t<is_random_access_iterator_v<typename V::iterator>, T>
;
template <class T = ll, class V, class Value, class Comp = DEFAULT_COMP, class Proj = identity>
inline auto geq_cnt(const V &v, const Value &val, Comp comp = {}, Proj proj = {})
-> enable_if_t<is_random_access_iterator_v<typename V::iterator>, T>
;
template <class T = ll, class V, class L, class R, class Comp = DEFAULT_COMP, class Proj = identity>
inline auto in_cnt(const V &v, L l, R r, Comp comp = {}, Proj proj = {})
-> enable_if_t<is_random_access_iterator_v<typename V::iterator>, T>
;
template <class V, class Value>
inline auto lt_max(const V &v, const Value &val)
-> enable_if_t<!is_random_access_iterator_v<typename V::iterator>, optional<typename V::const_iterator>>
;
template <class V, class Value>
inline auto leq_max(const V &v, const Value &val)
-> enable_if_t<!is_random_access_iterator_v<typename V::iterator>, optional<typename V::const_iterator>>
;
template <class V, class Value>
inline auto gt_min(const V &v, const Value &val)
-> enable_if_t<!is_random_access_iterator_v<typename V::iterator>, optional<typename V::const_iterator>>
;
template <class V, class Value>
inline auto geq_min(const V &v, const Value &val)
-> enable_if_t<!is_random_access_iterator_v<typename V::iterator>, optional<typename V::const_iterator>>
;
namespace internal
{
template <class T>
bool binsearch_adjacent(T a, T b)
;
};
template <class T = ll, class Judge, class InitOk, class InitNg>
pair<T, T> binsearch(const Judge &judge, InitOk init_ok, InitNg init_ng, bool check_ok = true, bool check_ng = true)
;
#line 1707
template <class T = ld, class Judge, class InitOk, class InitNg>
T binsearch_real(const Judge &judge, InitOk init_ok, InitNg init_ng, int iteration_count = 100, bool check_ok = true, bool check_ng = true)
;
#line 1723
template <class T = ll, class Judge, class InitVal>
pair<T, T> expsearch(const Judge &judge, InitVal init_val, bool positive = true)
;
#line 1769
template <class T>
inline constexpr ull pow2(T k) ;
template <class T>
inline constexpr ull MASK(T k) { return (1ULL << k) - 1ULL; }
#line 1787
inline constexpr ll bit_width(ll x) { return std::bit_width((ull)x); }
inline constexpr ll bit_floor(ll x) { return std::bit_floor((ull)x); }
inline constexpr ll bit_ceil(ll x) { return std::bit_ceil((ull)x); }
inline constexpr ll countr_zero(ll x) { assert(x != 0); return std::countr_zero((ull)x); }
inline constexpr ll popcount(ll x) { return std::popcount((ull)x); }
inline constexpr bool has_single_bit(ll x) { return std::has_single_bit((ull)x); }
inline constexpr ull lsb_pos(ull x) { assert(x != 0); return countr_zero(x); }
inline constexpr ull msb_pos(ull x) { assert(x != 0); return bit_width(x) - 1; }
inline constexpr ull lsb_mask(ull x) { assert(x != 0); return x & -x; }
inline constexpr ull msb_mask(ull x) { assert(x != 0); return bit_floor(x); }
inline constexpr bool btest(ull x, uint k) { return (x >> k) & 1; }
template <class T>
inline void bset(T &x, uint k, bool b = 1) ;
template <class T>
inline void bflip(T &x, uint k) ;
inline constexpr bool bsubset(ull x, ull y) { return (x & y) == x; }
inline constexpr bool bsupset(ull x, ull y) { return (x & y) == y; }
inline constexpr ull bsetminus(ull x, ull y) { return x & ~y; }
#line 1912
#define CPP_DUMP_DEFINE_DATA(...)
#define dump(...) ((void)0)
#define local(...)
#define oj(...) __VA_ARGS__
#define local_oj(a, b) (b)
template <class T, class Sequence>
vc<T> content(queue<T, Sequence> que)
{
vc<T> res;
while (!que.empty())
{
res.eb(que.front());
que.pop();
}
return res;
}
template <class T, class Sequence, class Compare>
vc<T> content(priority_queue<T, Sequence, Compare> pque)
{
vc<T> res;
while (!pque.empty())
{
res.eb(pque.top());
pque.pop();
}
return res;
}
template <class T>
auto content(const T &obj) { return obj.content(); }
#line 1977
namespace fastio
{
constexpr uint32_t SIZ = 1 << 17;
inline char ibuf[SIZ + 1], obuf[SIZ];
inline uint32_t pil = 0, pir = 0, por = 0;
__attribute__((noinline)) inline void load()
{
const uint32_t remaining = pir - pil;
if (remaining && pil) memmove(ibuf, ibuf + pil, remaining);
pil = 0;
pir = remaining + uint32_t(fread(ibuf + remaining, 1, SIZ - remaining, stdin));
ibuf[pir] = '\x7f';
}
inline bool ascii_space(unsigned char c)
{
return c == ' ' || unsigned(c - '\t') < 5;
}
inline void find_token()
{
for (;;)
{
const char *p = ibuf + pil;
const char *end = ibuf + pir;
while (ascii_space(*p)) ++p;
pil = uint32_t(p - ibuf);
if (p != end) return;
load();
if (!pir) abort();
}
}
__attribute__((noinline)) inline void flush()
{
size_t written = 0;
while (written < por)
{
const size_t n = fwrite(obuf + written, 1, por - written, stdout);
if (!n) abort();
written += n;
}
por = 0;
}
inline void append_bytes(const char *data, size_t size)
{
while (size)
{
const size_t n = min(size, size_t(SIZ - por));
memcpy(obuf + por, data, n);
por += uint32_t(n);
data += n;
size -= n;
if (por == SIZ) flush();
}
}
inline void append_char(char c)
{
if (por == SIZ) flush();
obuf[por++] = c;
}
template <class T>
using integer_magnitude = conditional_t<(sizeof(T) > sizeof(ull)), u128,
conditional_t<(sizeof(T) > sizeof(uint)), ull, uint>>;
inline uint decode_eight(uint64_t columns)
{
columns &= 0x0f0f0f0f0f0f0f0fULL;
const uint64_t pairs = (columns & 0x00ff00ff00ff00ffULL) * 10
+ ((columns >> 8) & 0x00ff00ff00ff00ffULL);
const uint64_t quads = (pairs & 0x0000ffff0000ffffULL) * 100
+ ((pairs >> 16) & 0x0000ffff0000ffffULL);
return uint(quads) * 10000 + uint(quads >> 32);
}
inline constexpr uint powers_of_ten[8] = {1, 10, 100, 1000, 10000, 100000, 1000000, 10000000};
template <class U>
__attribute__((always_inline)) inline void read_wide_integer_tail(
U &value, const char *&p, uint64_t columns, uint64_t stop)
;
#line 2078
template <class T>
__attribute__((always_inline)) inline void rd1_integer(T &x)
{
using U = integer_magnitude<T>;
const char *p = ibuf + pil;
for (;;)
{
while (ascii_space(*p)) ++p;
if (p != ibuf + pir) break;
pil = pir;
load();
if (!pir) abort();
p = ibuf;
}
bool negative = false;
if (*p == '+') ++p;
else if constexpr (numeric_limits<T>::is_signed)
{
if (*p == '-') negative = true, ++p;
}
U value = 0;
for (;;)
{
while (size_t(ibuf + pir - p) >= 8)
{
uint64_t columns;
memcpy(&columns, p, 8);
const uint64_t stop = ((columns + 0x4646464646464646ULL) |
(columns - 0x3030303030303030ULL)) & 0x8080808080808080ULL;
if (stop)
{
if constexpr (sizeof(U) > sizeof(ull))
{
read_wide_integer_tail(value, p, columns, stop);
goto integer_complete;
}
else
{
if (stop & 0x80808080ULL)
{
if (!(stop & 0x808080ULL))
{
value = value * 1000 + uint(columns & 15) * 100
+ uint(columns >> 8 & 15) * 10 + uint(columns >> 16 & 15);
p += 3;
}
else if (!(stop & 0x8080ULL))
{
value = value * 100 + uint(columns & 15) * 10 + uint(columns >> 8 & 15);
p += 2;
}
else if (!(stop & 0x80ULL))
{
value = value * 10 + uint(columns & 15);
++p;
}
goto integer_complete;
}
break;
}
}
columns &= 0x0f0f0f0f0f0f0f0fULL;
const uint64_t pairs = (columns & 0x00ff00ff00ff00ffULL) * 10
+ ((columns >> 8) & 0x00ff00ff00ff00ffULL);
const uint64_t quads = (pairs & 0x0000ffff0000ffffULL) * 100
+ ((pairs >> 16) & 0x0000ffff0000ffffULL);
value = value * 100000000 + uint(quads) * 10000 + uint(quads >> 32);
p += 8;
}
while (unsigned(*p - '0') < 10)
{
value = value * 10 + unsigned(*p - '0');
++p;
}
pil = uint32_t(p - ibuf);
if (pil != pir) break;
load();
p = ibuf;
if (!pir) break;
}
integer_complete:
pil = uint32_t(p - ibuf);
if constexpr (numeric_limits<T>::is_signed)
{
if (negative && value) x = T(-T(value - 1) - 1);
else x = T(value);
}
else x = T(value);
}
template <class T, enable_if_t<numeric_limits<T>::is_integer, int> = 0>
__attribute__((always_inline)) inline void rd1(T &x) { rd1_integer(x); }
inline void rd1(char &x)
;
inline void rd1(string &x)
;
#line 2197
template <class T>
void rd1_real(T &x)
{
string token;
rd1(token);
const char *first = token.data();
const char *last = first + token.size();
if (first != last && *first == '+') ++first;
auto result = from_chars(first, last, x, chars_format::general);
if (result.ec != errc{} || result.ptr != last)
{
char *end;
if constexpr (is_same_v<T, float>) x = strtof(token.c_str(), &end);
else if constexpr (is_same_v<T, double>) x = strtod(token.c_str(), &end);
else x = strtold(token.c_str(), &end);
if (end != token.data() + token.size()) abort();
}
}
inline void rd1(float &x) ;
inline void rd1(double &x) ;
inline void rd1(long double &x) ;
template <class A, class B> void rd1(pair<A, B> &x);
template <class... T> void rd1(tuple<T...> &x);
template <class T, size_t N> void rd1(array<T, N> &x);
template <class T> void rd1(vc<T> &x);
template <class A, class B>
void rd1(pair<A, B> &x) ;
template <class... T>
void rd1(tuple<T...> &x)
{
apply([](auto &...element) { (rd1(element), ...); }, x);
}
template <class T, size_t N>
void rd1(array<T, N> &x)
;
template <class T>
void rd1(vc<T> &x)
{
if constexpr (is_same_v<T, bool>)
for (size_t i = 0; i < x.size(); ++i) { bool value; rd1(value); x[i] = value; }
else
for (auto &element : x) rd1(element);
}
inline constexpr auto decimal_triplets = []
{
array<array<char, 3>, 1000> result{};
for (unsigned i = 0; i < 1000; ++i)
{
result[i][0] = char('0' + i / 100);
result[i][1] = char('0' + i / 10 % 10);
result[i][2] = char('0' + i % 10);
}
return result;
}();
inline void store_nine(char *out, uint x)
{
const uint q = x / 1000, r = q / 1000;
memcpy(out, decimal_triplets[r].data(), 3);
memcpy(out + 3, decimal_triplets[q - r * 1000].data(), 3);
memcpy(out + 6, decimal_triplets[x - q * 1000].data(), 3);
}
inline char *prepend_small(char *end, uint x)
{
while (x >= 1000)
{
const uint q = x / 1000;
end -= 3;
memcpy(end, decimal_triplets[x - q * 1000].data(), 3);
x = q;
}
const unsigned digits = 1 + unsigned(x >= 10) + unsigned(x >= 100);
end -= digits;
memcpy(end, decimal_triplets[x].data() + 3 - digits, digits);
return end;
}
inline char *prepend_wide(char *end, ull x)
{
while (x >= 1000000000ULL)
{
const ull q = x / 1000000000ULL;
end -= 9;
store_nine(end, uint(x - q * 1000000000ULL));
x = q;
}
return prepend_small(end, uint(x));
}
inline char *store_leading_triplet(char *out, uint x)
{
if (x >= 100)
{
memcpy(out, decimal_triplets[x].data(), 3);
return out + 3;
}
if (x >= 10)
{
memcpy(out, decimal_triplets[x].data() + 1, 2);
return out + 2;
}
*out = char('0' + x);
return out + 1;
}
inline char *store_short(char *out, uint x)
{
if (x >= 1000000)
{
const uint q = x / 1000000;
const uint r = x - q * 1000000;
out = store_leading_triplet(out, q);
memcpy(out, decimal_triplets[r / 1000].data(), 3);
memcpy(out + 3, decimal_triplets[r % 1000].data(), 3);
return out + 6;
}
if (x >= 1000)
{
const uint q = x / 1000;
out = store_leading_triplet(out, q);
memcpy(out, decimal_triplets[x - q * 1000].data(), 3);
return out + 3;
}
return store_leading_triplet(out, x);
}
template <class U>
inline char *store_ordinary(char *out, U x)
{
if constexpr (sizeof(U) > sizeof(uint))
{
if (x >= 1000000000000000000ULL)
{
const uint hi = uint(x / 1000000000000000000ULL);
const ull tail = x - ull(hi) * 1000000000000000000ULL;
const uint middle = uint(tail / 1000000000ULL);
out = store_leading_triplet(out, hi);
store_nine(out, middle);
store_nine(out + 9, uint(tail - ull(middle) * 1000000000ULL));
return out + 18;
}
}
if (x >= 1000000000)
{
const uint hi = uint(x / 1000000000);
out = store_short(out, hi);
store_nine(out, uint(x - U(hi) * 1000000000));
return out + 9;
}
return store_short(out, uint(x));
}
template <class U, bool newline>
__attribute__((always_inline)) inline void write_wide_integer(U magnitude, bool negative)
;
#line 2386
template <class T, bool newline = false>
__attribute__((always_inline)) inline void wt1_integer(T x)
{
using U = integer_magnitude<T>;
U magnitude = U(x);
bool negative = false;
if constexpr (numeric_limits<T>::is_signed)
{
negative = x < 0;
const U sign_mask = U(0) - U(negative);
magnitude = (magnitude ^ sign_mask) + U(negative);
}
if constexpr (sizeof(U) <= sizeof(ull))
{
if (por > SIZ - 40) flush();
char *out = obuf + por;
*out = '-';
out += negative;
out = store_ordinary(out, magnitude);
if constexpr (newline) *out++ = '\n';
por = uint32_t(out - obuf);
return;
}
else write_wide_integer<U, newline>(magnitude, negative);
}
template <class T, enable_if_t<numeric_limits<T>::is_integer, int> = 0>
__attribute__((always_inline)) inline void wt1(T x) ;
inline void wt1(char x) ;
inline void wt1(const char *x) ;
inline void wt1(string_view x) ;
inline void wt1(const string &x) ;
template <class T>
void wt1_real(T x)
{
char text[numeric_limits<T>::max_exponent10 + 64];
auto result = to_chars(text, text + sizeof(text), x, chars_format::fixed, 15);
if (result.ec != errc{}) abort();
append_bytes(text, size_t(result.ptr - text));
}
inline void wt1(float x) ;
inline void wt1(double x) ;
inline void wt1(long double x) ;
template <class A, class B> void wt1(const pair<A, B> &x);
template <class... T> void wt1(const tuple<T...> &x);
template <class T, size_t N> void wt1(const array<T, N> &x);
template <class T> void wt1(const vc<T> &x);
template <class A, class B>
void wt1(const pair<A, B> &x) ;
template <class... T>
void wt1(const tuple<T...> &x)
;
template <class T, size_t N>
void wt1(const array<T, N> &x)
;
template <class T>
void wt1(const vc<T> &x)
;
template <class... T>
void read(T &...x) { (rd1(x), ...); }
template <class... T>
void write(T &&...x) { (wt1(forward<T>(x)), ...); }
template <class... T>
void print(T &&...x)
{
if constexpr (sizeof...(T) == 1 &&
((is_integral_v<decay_t<T>> && !is_same_v<decay_t<T>, char>) && ...))
(wt1_integer<decay_t<T>, true>(forward<T>(x)), ...);
else
{
size_t index = 0;
((index++ ? void(append_char(' ')) : void(), wt1(forward<T>(x))), ...);
append_char('\n');
}
}
}
struct Dummy {
Dummy() { atexit(fastio::flush); }
} dummy;
//! https://trap.jp/post/1224/
#line 2532
namespace internal
{
template <class... Ts>
void READnodump(Ts &...a) { fastio::read(a...); }
template <class... T>
void READVECnodump(int n, vc<T> &...v)
{
(v.resize(size_t(n)), ...);
READnodump(v...);
}
template <class... T>
void READVEC2nodump(int n, int m, vvc<T> &...v)
;
template <class... T>
void READJAGnodump(int n, vvc<T> &...vs)
;
#line 2579
};
#define READ(...) internal::READnodump(__VA_ARGS__); dump(__VA_ARGS__)
#define LIBRARY_INOUT_TYPE(...) LIBRARY_INOUT_TYPE_IMPL(__VA_ARGS__)(__VA_ARGS__)
#define LIBRARY_INOUT_TYPE_IMPL(T, ...) LIBRARY_INOUT_TYPE_SELECT(LIBRARY_INOUT_TYPE_PROBE T, LIBRARY_INOUT_TYPE_KEEP)
#define LIBRARY_INOUT_TYPE_PROBE(...) _, LIBRARY_INOUT_TYPE_REMOVE
#define LIBRARY_INOUT_TYPE_SELECT(...) LIBRARY_INOUT_TYPE_SECOND(__VA_ARGS__)
#define LIBRARY_INOUT_TYPE_SECOND(_0, _1, ...) _1
#define LIBRARY_INOUT_TYPE_KEEP(...) __VA_ARGS__
#define LIBRARY_INOUT_TYPE_REMOVE(T) LIBRARY_INOUT_TYPE_KEEP T
#define IN(T, ...) LIBRARY_INOUT_TYPE(T) __VA_ARGS__; READ(__VA_ARGS__)
#define CHAR(...) IN(char, __VA_ARGS__)
#define INT(...) IN(int, __VA_ARGS__)
#define LL(...) IN(ll, __VA_ARGS__)
#define STR(...) IN(string, __VA_ARGS__)
#define ARR(T, n, ...) array<LIBRARY_INOUT_TYPE(T), n> __VA_ARGS__; READ(__VA_ARGS__)
#define READVEC(...) internal::READVECnodump(__VA_ARGS__); dump(__VA_ARGS__)
#define READVEC2(...) internal::READVEC2nodump(__VA_ARGS__); dump(__VA_ARGS__)
#define VEC(T, n, ...) vc<LIBRARY_INOUT_TYPE(T)> __VA_ARGS__; READVEC(n, __VA_ARGS__)
#define VEC2(T, n, m, ...) vvc<LIBRARY_INOUT_TYPE(T)> __VA_ARGS__; READVEC2(n, m, __VA_ARGS__)
#define READJAG(...) internal::READJAGnodump(__VA_ARGS__); dump(__VA_ARGS__)
#define JAG(T, n, ...) vvc<LIBRARY_INOUT_TYPE(T)> __VA_ARGS__; READJAG(n, __VA_ARGS__)
#define ENDL '\n'
#line 2688
#define WRITE fastio::write
#define PRINT fastio::print
#define PRINTEXIT(...) do { PRINT(__VA_ARGS__); exit(0); } while (false)
#define PRINTRETURN(...) do { PRINT(__VA_ARGS__); return; } while (false)
template <class T>
void PRINTV(const vc<T> &v) ;
#define PRINTVEXIT(...) do { PRINTV(__VA_ARGS__); exit(0); } while (false)
#define PRINTVRETURN(...) do { PRINTV(__VA_ARGS__); return; } while (false)
template <class T, class Add>
void offset(vc<T> &v, const Add &add) { for (auto &vi : v) vi += add; }
template <class T, class Add>
void offset(vvc<T> &v, const Add &add) ;
template <class T, const size_t m>
array<vc<T>, m> unzip(const vc<array<T, m>> &vt)
;
template <class T, const size_t m>
vc<array<T, m>> zip(const array<vc<T>, m> &tv)
;
#line 2737
template <class T, class U>
pair<vc<T>, vc<U>> unzip(const vc<pair<T, U>> &vt)
;
template <class T, class U>
vc<pair<T, U>> zip(const pair<vc<T>, vc<U>> &tv)
;
namespace internal
{
template <size_t... I, class V, class Tp>
auto vt_to_tv_impl(V &tv, const Tp &t, index_sequence<I...>, size_t index)
;
template <size_t... I, class Tp>
auto tv_to_vt_impl(const Tp &tv, index_sequence<I...>, size_t index)
;
};
template <class... Ts>
auto unzip(const vc<tuple<Ts...>> &vt)
;
template <class... Ts>
auto zip(const tuple<vc<Ts>...> &tv)
;
namespace internal
{
template <class... Ts>
auto zip_vectors(const vc<Ts> &...v)
;
};
#define UNZIP(vt, ...) auto [__VA_ARGS__] = unzip(vt)
#define ZIP(vt, ...) auto vt = internal::zip_vectors(__VA_ARGS__)
mt19937_64 mt;
template <class T = ll, class U1, class U2>
T randint(U1 l, U2 r)
;
template <class T = ll, class U1, class U2>
T randrange(U1 l, U2 r)
;
template <class T = double, class U1, class U2>
T randreal(U1 l, U2 r)
;
bool randbool(double p)
{
assert(0 <= p && p <= 1);
return bernoulli_distribution(p)(mt);
}
namespace internal
{
template <bool does_sort, class V, class T>
void random_sample_range(V &res, T l, T r)
;
#line 2888
};
template <int k, bool does_sort, class T = ll, class U1, class U2>
array<T, k> random_sample_range_array(U1 l, U2 r)
;
template <bool does_sort, class T = ll, class U1, class U2>
vc<T> random_sample_range_vector(U1 l, U2 r, int k)
;
#line 2917
/*!
* Portions corresponding to AtCoder Library (CC0-1.0): modular arithmetic operators.
* Upstream: atcoder/modint.hpp
* https://github.com/atcoder/ac-library/tree/864245a00b00dd008d1abfdc239618fdb7d139da
* License: https://github.com/atcoder/ac-library/blob/864245a00b00dd008d1abfdc239618fdb7d139da/LICENSE
*/
#line 2936
namespace larger_int_detail
{
template <class T>
[[deprecated("larger_int: 128-bit integer is not widened; intermediate arithmetic may overflow")]]
constexpr bool warn_no_wider_integer()
{
return true;
}
}
template <class T>
struct larger_int
{
private:
static constexpr bool check()
;
static_assert(check());
public:
using type = T;
};
#define LARGER_INT(T, U) \
template <> \
struct larger_int<T> \
{ \
using type = U; \
};
LARGER_INT(signed char, short)
LARGER_INT(short, int)
LARGER_INT(int, long long)
LARGER_INT(long, __int128_t)
LARGER_INT(long long, __int128_t)
LARGER_INT(unsigned char, unsigned short)
LARGER_INT(unsigned short, unsigned int)
LARGER_INT(unsigned int, unsigned long long)
LARGER_INT(unsigned long, __uint128_t)
LARGER_INT(unsigned long long, __uint128_t)
#undef LARGER_INT
template <class T>
struct Rational;
template <class T>
struct larger_int<Rational<T>>
{
using type = Rational<typename larger_int<T>::type>;
};
template <class T>
using larger_int_t = typename larger_int<T>::type;
/*!
* Portions corresponding to AtCoder Library (CC0-1.0): primality testing.
* Upstream: atcoder/internal_math.hpp
* https://github.com/atcoder/ac-library/tree/864245a00b00dd008d1abfdc239618fdb7d139da
* License: https://github.com/atcoder/ac-library/blob/864245a00b00dd008d1abfdc239618fdb7d139da/LICENSE
*/
namespace internal
{
template <class T>
constexpr ll powmod_constexpr(ll x, ll n, T m)
{
if (m == 1)
return 0;
using U = make_unsigned_t<T>;
using L = larger_int_t<U>;
U r = 1, y = safemod(x, m);
while (n)
{
if (n & 1)
r = L(r) * y % m;
y = L(y) * y % m;
n >>= 1;
}
return r;
}
template <class T>
constexpr bool isprime_constexpr(T n)
;
#line 3079
template <auto n>
constexpr bool isprime = isprime_constexpr(n);
};
namespace internal
{
template <auto M>
struct policy_static
{
using mod_type = decltype(M);
using value_type = make_unsigned_t<mod_type>;
using calc_type = conditional_t<(M <= UINT_MAX), ull, larger_int_t<value_type>>;
static constexpr bool is_prime = isprime_constexpr(M);
static constexpr mod_type mod() ;
static constexpr value_type umod() { return M; }
static constexpr value_type init(value_type v) { return v; }
static constexpr mod_type val(value_type v) ;
static constexpr value_type mul(value_type a, value_type b)
{
const calc_type product = calc_type(a) * b;
if constexpr (M == (1LL << 61) - 1)
{
const value_type reduced = (value_type(product) & umod()) + value_type(product >> 61);
return reduced >= umod() ? reduced - umod() : reduced;
}
else
return value_type(product % M);
}
};
};
/*!
* Portions corresponding to AtCoder Library (CC0-1.0): Barrett reduction.
* Upstream: atcoder/internal_math.hpp
* https://github.com/atcoder/ac-library/tree/864245a00b00dd008d1abfdc239618fdb7d139da
* License: https://github.com/atcoder/ac-library/blob/864245a00b00dd008d1abfdc239618fdb7d139da/LICENSE
*/
namespace internal
{
struct barrett32
{
uint m = 0;
ull im = 0;
barrett32() = default;
explicit barrett32(uint m) : m(m), im((ull)(-1) / m + 1) {}
uint umod() const ;
uint mul(uint a, uint b) const
;
};
template <int id>
struct policy_barrett32
{
using value_type = uint;
using calc_type = ull;
using mod_type = int;
static constexpr bool is_prime = false;
static inline barrett32 reducer{};
static void set_mod(mod_type m)
;
static mod_type mod() ;
static value_type umod() ;
static value_type init(value_type v) { return v; }
static mod_type val(value_type v) ;
static value_type mul(value_type a, value_type b) ;
};
};
namespace internal
{
inline constexpr ull inv64(ull a)
{
ull x = a;
while (a * x != 1) x *= 2 - a * x;
return x;
}
struct montgomery64odd
{
ull m = 0, im = 0, sq = 0;
montgomery64odd() = default;
explicit montgomery64odd(ull m) : m(m), im(inv64(m)), sq(-u128(m) % m) {}
ull umod() const ;
ull reduce(u128 x) const
;
ull inv_reduce(i128 v) const ;
};
//! https://www.mathenachia.blog/even-mod-montgomery-impl/
struct montgomery64
{
ull m = 0, mx = 0, imx = 0, d = 0, q = 0;
uint b = 0;
montgomery64() = default;
explicit montgomery64(ull m) : m(m)
{
b = countr_zero(m), mx = m >> b;
imx = inv64(mx);
d = powmod_constexpr((mx + 1) / 2, b, mx);
u128 sq = -u128(mx) % mx;
q = (1 + (((sq - 1) * d) << b)) % m;
}
ull umod() const ;
ull reduce(u128 x) const
;
#line 3229
ull inv_reduce(i128 v) const ;
};
template <int id>
struct policy_montgomery64_odd
{
using value_type = ull;
using calc_type = u128;
using mod_type = ll;
static constexpr bool is_prime = false;
static inline montgomery64odd reducer{};
static void set_mod(mod_type m)
;
static mod_type mod() ;
static value_type umod() ;
static value_type init(value_type v) { return reducer.inv_reduce(v); }
static mod_type val(value_type v) ;
static value_type mul(value_type a, value_type b) ;
};
template <int id>
struct policy_montgomery64
{
using value_type = ull;
using calc_type = u128;
using mod_type = ll;
static constexpr bool is_prime = false;
static inline montgomery64 reducer{};
static void set_mod(mod_type m)
;
static mod_type mod() ;
static value_type umod() ;
static value_type init(value_type v) { return reducer.inv_reduce(v); }
static mod_type val(value_type v) ;
static value_type mul(value_type a, value_type b) ;
};
};
template <class T = ll>
constexpr tuple<T, T, T> extgcd(T a, T b)
;
#line 3311
namespace internal
{
template <class Policy, class PowInv = void>
struct modint_impl
{
using V = typename Policy::value_type;
using M = typename Policy::mod_type;
using mint = modint_impl;
private:
V _v;
public:
static constexpr M mod()
;
template <class T = Policy>
static auto set_mod(M m) -> decltype(T::set_mod(m)) ;
static void precompute()
;
static mint raw(V v)
;
modint_impl() : _v(0) { (void)mod(); }
template <class T, typename = enable_if_t<is_integral_ext<T>>>
modint_impl(T v)
{
const V m = mod();
V rem;
if constexpr (is_signed_ext<T>)
{
using S = make_signed_t<V>;
S x = v % S(m);
if (x < 0)
x += m;
rem = x;
}
else
rem = V(v % m);
_v = Policy::init(rem);
};
M val() const ;
mint &operator+=(const mint &rhs)
;
mint &operator-=(const mint &rhs)
;
mint &operator*=(const mint &rhs)
;
mint &operator/=(const mint &rhs)
;
mint &operator++()
;
mint &operator--()
;
mint operator++(int)
;
mint operator--(int)
;
mint operator+() const ;
mint operator-() const ;
template <class T>
mint pow(T n) const
;
#line 3439
mint inv() const
;
#line 3457
friend mint operator+(const mint &lhs, const mint &rhs) { return mint(lhs) += rhs; }
friend mint operator-(const mint &lhs, const mint &rhs) { return mint(lhs) -= rhs; }
friend mint operator*(const mint &lhs, const mint &rhs) { return mint(lhs) *= rhs; }
friend mint operator/(const mint &lhs, const mint &rhs) { return mint(lhs) /= rhs; }
friend bool operator==(const mint &lhs, const mint &rhs) { return lhs._v == rhs._v; }
friend bool operator!=(const mint &lhs, const mint &rhs) { return lhs._v != rhs._v; }
friend M safe_hash_key(const mint &x) { return x.val(); }
#line 3479
friend void rd1(mint &x)
{
long long a;
fastio::rd1(a);
x = a;
}
friend void wt1(const mint &x)
{
fastio::wt1(x.val());
}
};
};
template <int mod>
using static_modint32 = internal::modint_impl<internal::policy_static<mod>>;
template <int id>
using dynamic_modint32 = internal::modint_impl<internal::policy_barrett32<id>>;
template <ll mod>
using static_modint64 = internal::modint_impl<internal::policy_static<mod>>;
template <int id>
using dynamic_modint64_odd = internal::modint_impl<internal::policy_montgomery64_odd<id>>;
template <int id>
using dynamic_modint64 = internal::modint_impl<internal::policy_montgomery64<id>>;
using modint998244353 = static_modint32<998244353>;
using modint1000000007 = static_modint32<1000000007>;
using modint = dynamic_modint32<-1>;
using modint61 = static_modint64<(1LL << 61) - 1>;
using modint64 = dynamic_modint64<-1>;
template <class T>
struct is_modint : std::false_type
{
};
template <class Policy, class PowInv>
struct is_modint<internal::modint_impl<Policy, PowInv>> : std::true_type
{
};
template <class T>
inline constexpr bool is_modint_v = is_modint<T>::value;
template <class T>
struct is_static_modint : false_type {};
template <int m, class PowInv>
struct is_static_modint<internal::modint_impl<internal::policy_static<m>, PowInv>> : true_type {};
template <ll m, class PowInv>
struct is_static_modint<internal::modint_impl<internal::policy_static<m>, PowInv>> : true_type {};
template <class T>
inline constexpr bool is_static_modint_v = is_static_modint<T>::value;
template <class T>
struct is_dynamic_modint : false_type {};
template <int id>
struct is_dynamic_modint<dynamic_modint32<id>> : true_type {};
template <int id>
struct is_dynamic_modint<dynamic_modint64_odd<id>> : true_type {};
template <int id>
struct is_dynamic_modint<dynamic_modint64<id>> : true_type {};
template <class T>
inline constexpr bool is_dynamic_modint_v = is_dynamic_modint<T>::value;
template <typename, typename = void>
struct has_mod : std::false_type
{
};
template <typename T>
struct has_mod<T, std::void_t<decltype(T::mod())>> : std::true_type
{
};
template <class mint>
struct modint_less
{
bool operator()(const mint &a, const mint &b) const
;
};
template <class mint>
struct modint_hash
{
auto operator()(const mint &x) const
;
};
template <class mint>
struct PowerTable
{
private:
decltype(mint::mod()) mod{};
mint base{};
vc<mint> pw;
public:
CPP_DUMP_DEFINE_DATA(mod, base, pw);
PowerTable() {}
PowerTable(const mint &base) : mod(mint::mod()), base(base), pw(1, 1) {}
void reserve(int n)
;
#line 3612
mint pow(int n)
;
};
template <class T>
struct Binomial
{
private:
inline static decltype(T::mod()) mod;
public:
inline static vc<T> fac_, finv_, inv_;
static void reserve(int n)
;
#line 3664
static T fac(int n)
;
static T finv(int n)
;
static T inv(int n)
;
static T P(int n, int k)
;
static T C(int n, int k)
;
static T H(int n, int k)
;
};
template <class mint>
mint stom(string s)
;
#line 3757
template <class T = ll, class U = larger_int_t<T>>
pair<T, T> svp2d(const pair<T, T> &a, const pair<T, T> &b)
;
#line 3795
template <class mint>
pair<decltype(mint(0).val()), decltype(mint(0).val())>
mint_to_rat(const mint &x)
{
auto [p, q] = svp2d({x.val(), 1}, {mint::mod(), 0});
if (q < 0)
p = -p, q = -q;
return {p, q};
}
namespace cpp_dump
{
template <class T>
struct rat_value
{
T p, q;
friend ostream &operator<<(ostream &os, const rat_value &x)
{
os << x.p;
if (x.q != 1)
os << '/' << x.q;
return os;
}
};
struct mint_to_rat_fn
{
template <class T>
requires requires(const T &x)
{
{ T::mod() } -> std::convertible_to<ll>;
{ x.val() } -> std::convertible_to<ll>;
}
constexpr auto operator()(const T &x) const
-> rat_value<typename decltype(mint_to_rat(x))::first_type>
{
auto [p, q] = mint_to_rat(x);
return {p, q};
}
};
template <class T>
struct rat_object
{
T value;
};
template <class T>
inline constexpr bool rat_is_map = false;
template <class... Args>
inline constexpr bool rat_is_map<std::map<Args...>> = true;
template <class... Args>
inline constexpr bool rat_is_map<std::multimap<Args...>> = true;
template <class... Args>
inline constexpr bool rat_is_map<std::unordered_map<Args...>> = true;
template <class... Args>
inline constexpr bool rat_is_map<std::unordered_multimap<Args...>> = true;
struct rat_closure : std::ranges::range_adaptor_closure<rat_closure>
{
template <class T>
static constexpr bool can_convert()
;
#line 3887
template <typename T>
requires(!requires { std::views::all | std::declval<T>(); })
constexpr decltype(auto) operator()(T &&t) const
{
if constexpr (!std::ranges::range<T> && std::invocable<mint_to_rat_fn, T>)
{
return mint_to_rat_fn{}(std::forward<T>(t));
}
else if constexpr (can_convert<T>())
{
if constexpr (!std::ranges::range<T> || rat_is_map<std::remove_cvref_t<T>>)
return rat_object<T>{std::forward<T>(t)};
else
return std::forward<T>(t) | std::views::transform(*this);
}
else
{
return std::forward<T>(t);
}
}
};
#line 3958
template <typename T>
requires(!requires { std::views::all | std::declval<T>(); })
constexpr decltype(auto) operator|(T &&t, rat_closure c)
{
return c(std::forward<T>(t));
}
constexpr rat_closure rat()
{
return rat_closure{};
}
}
using mint = modint998244353;
// using mint = modint1000000007;
// using mint = static_modint<1000000000>;
// using mint = modint;
using bi = Binomial<mint>;
void init()
{
oj(mt.seed(random_device()()));
}
#line 3998
template <class T, bool is_erasable = false>
struct CSR
{
protected:
int n, m;
vc<int> start;
vc<T> elist;
vc<int> len;
inline int get_last(int i) const
{
if constexpr (is_erasable)
return start[i] + len[i];
else
return start[i + 1];
}
template <class Iter>
struct RowBase
{
using iterator = Iter;
using reference = typename iterator_traits<iterator>::reference;
private:
iterator begi, endi;
public:
RowBase(const iterator &begi, const iterator &endi) : begi(begi), endi(endi) {}
inline iterator begin() const ;
inline iterator end() const ;
template <class I = ll>
inline I size() const { return endi - begi; }
inline bool empty() const ;
inline reference operator[](int i) const { return *(begi + i); }
inline reference at(int i) const
;
inline reference front() const
;
inline reference back() const
;
vc<T> to_v() const ;
vc<T> content() const ;
};
using Row = RowBase<typename vc<T>::iterator>;
using ConstRow = RowBase<typename vc<T>::const_iterator>;
public:
CSR() : n(0), m(0), start{0} {}
template <class I = int>
CSR(const vc<I> &row_sizes)
: n(row_sizes.size())
{
static_assert(is_integral_ext<I>);
start.resize(n + 1);
for (int i = 0; i < n; i++)
{
if constexpr (is_signed_ext<I>) assert(row_sizes[i] >= 0);
start[i + 1] = start[i] + int(row_sizes[i]);
}
m = start.back();
elist.resize(m);
if constexpr (is_erasable)
len.assign(ALL(row_sizes));
}
template <class I>
CSR(int n, const vc<pair<I, T>> &ies) : n(n), m(ies.size()), start(n, 0), elist(m)
{
if constexpr (is_erasable)
len.resize(n);
fec([ i, e ] : ies)
{
assert(0 <= i && i < n);
start[i]++;
}
start = cumlsum(start);
if constexpr (is_erasable)
repi(i, n) len[i] = start[i + 1] - start[i];
auto cnt = start;
repi(j, m)
{
cauto & [ i, e ] = ies[j];
int &k = cnt[i];
elist[k] = e;
k++;
}
}
template <class U = T>
CSR(const vvc<U> &vv) : n(vv.size()), start(n + 1, 0)
{
m = 0;
fec(row : vv) m += row.size();
elist.resize(m);
if constexpr (is_erasable)
len.resize(n);
for (int i = 0, j = 0; i < n; i++)
{
start[i] = j;
if constexpr (is_erasable)
len[i] = vv[i].size();
fec(e : vv[i])
{
elist[j] = e;
j++;
}
}
start.back() = m;
}
template <class U, bool erasable>
explicit CSR(const CSR<U, erasable> &other)
: CSR(gen_vec(other.template size<int>(), [&](int i) { return other[i].template size<int>(); }))
{
for (int i = 0; i < n; i++) copy(ALL(other[i]), elist.begin() + start[i]);
}
Row operator[](int i) { return Row(elist.begin() + start[i], elist.begin() + get_last(i)); }
ConstRow operator[](int i) const
{ return ConstRow(elist.begin() + start[i], elist.begin() + get_last(i)); }
Row at(int i)
;
ConstRow at(int i) const
;
void pop_back(int i)
;
int offset(int i) const
{
assert(0 <= i && i <= n);
return start[i];
}
void sortunique()
;
#line 4182
template <class I = ll>
I size() const ;
vvc<T> to_vv() const
;
vvc<T> content() const ;
vc<T> &get_elist() ;
const vc<T> &get_elist() const { return elist; }
};
template <class T>
CSR(const vvc<T> &) -> CSR<T>;
template <class Cost = void>
struct Edge
{
int from, to;
Cost cost;
int index;
CPP_DUMP_DEFINE_DATA(from, to, cost, index);
Edge() : from(-1), to(-1), cost{}, index(-1) {}
Edge(int s, int t, Cost c, int i = -1) : from(s), to(t), cost(c), index(i) {}
operator int() const { return to; }
bool operator<(const Edge &rhs) const ;
Edge rev() const ;
};
template <>
struct Edge<void>
{
int from, to, index;
static constexpr ll cost = 1;
CPP_DUMP_DEFINE_DATA(from, to, cost, index);
Edge() : from(-1), to(-1), index(-1) {}
Edge(int s, int t, int i = -1) : from(s), to(t), index(i) {}
operator int() const { return to; }
bool operator<(const Edge &) const ;
Edge rev() const ;
};
template <class Cost>
vc<Edge<Cost>> rev_path(const vc<Edge<Cost>> &path)
;
template <bool is_directed, class Cost = void, bool is_erasable = false>
struct Graph
{
using E = Edge<Cost>;
protected:
template <class C, bool unweighted = is_void_v<C>>
struct InternalEdge
{
int to, index;
C cost;
};
template <class C>
struct InternalEdge<C, true>
{
int to, index;
static constexpr ll cost = 1;
};
using GE = conditional_t<is_erasable, E, InternalEdge<Cost>>;
using Weight = decay_t<decltype(E::cost)>;
int n = 0, m = 0, era = 0;
CSR<GE, is_erasable> g;
vc<int> eid_to_elist_id;
static E make_edge(int from, int to, const Weight &cost, int index)
{
if constexpr (is_void_v<Cost>)
return E(from, to, index);
else
return E(from, to, cost, index);
}
struct OutEdgeRow;
struct OutEdgeIter
{
using iterator_category = input_iterator_tag;
using value_type = E;
using difference_type = ptrdiff_t;
using pointer = const E *;
using reference = const E &;
private:
friend struct OutEdgeRow;
int from = -1;
typename vc<GE>::const_iterator it;
mutable E e;
OutEdgeIter(int from, typename vc<GE>::const_iterator it) : from(from), it(it) {}
public:
OutEdgeIter() = default;
reference operator*() const
{
if constexpr (is_erasable)
return *it;
else
{
e = make_edge(from, it->to, it->cost, it->index);
return e;
}
}
pointer operator->() const { return &**this; }
OutEdgeIter &operator++()
{
++it;
return *this;
}
OutEdgeIter operator++(int)
;
bool operator==(const OutEdgeIter &rhs) const { return it == rhs.it; }
bool operator!=(const OutEdgeIter &rhs) const { return !(*this == rhs); }
};
struct OutEdgeRow
{
private:
const Graph *g;
int from, l, r;
OutEdgeIter iter(int pos) const
{
return {from, g->g.get_elist().begin() + pos};
}
public:
OutEdgeRow(const Graph *g, int from)
: g(g), from(from), l(g->g.offset(from)), r(l + g->g[from].size()) {}
OutEdgeIter begin() const { return iter(l); }
OutEdgeIter end() const { return iter(r); }
template <class I = ll>
I size() const ;
bool empty() const ;
E operator[](int i) const
;
E at(int i) const
;
E front() const
;
E back() const
;
vc<E> to_v() const ;
};
E get_edge(int from, int pos) const
;
template <class F>
void build(F input_edge)
{
vc<int> row_sizes(n);
repi(i, m)
{
auto [u, v, w] = input_edge(i);
assert(0 <= u && u < n && 0 <= v && v < n);
row_sizes[u]++;
if constexpr (!is_directed)
if (u != v) row_sizes[v]++;
}
g = CSR<GE, is_erasable>(row_sizes);
if constexpr (is_erasable)
eid_to_elist_id.assign((is_directed ? 1 : 2) * m, -1);
vc<int> cnt(n);
repi(i, m)
{
auto [u, v, w] = input_edge(i);
int j = cnt[u]++;
int k = g.offset(u) + j;
if constexpr (is_erasable)
g[u][j] = make_edge(u, v, w, i);
else if constexpr (is_void_v<Cost>)
g[u][j] = GE{int(v), i};
else
g[u][j] = GE{int(v), i, w};
if constexpr (is_erasable)
{
int id = is_directed ? i : 2 * i + (u <= v);
eid_to_elist_id[id] = k;
}
if constexpr (!is_directed)
{
if (u != v)
{
j = cnt[v]++;
k = g.offset(v) + j;
if constexpr (is_erasable)
g[v][j] = make_edge(v, u, w, i);
else if constexpr (is_void_v<Cost>)
g[v][j] = GE{int(u), i};
else
g[v][j] = GE{int(u), i, w};
if constexpr (is_erasable)
eid_to_elist_id[2 * i + (v <= u)] = k;
}
}
}
}
public:
local(auto content() const { return pair{n, edges()}; })
Graph() {}
template <class I>
Graph(int n, const vc<pair<I, I>> &es) : n(n), m(es.size()), era(0)
{
build(LMD(i, (tuple{es[i].first, es[i].second, Weight(1)})));
}
template <class I, class C = Cost, enable_if_t<!is_void_v<C>, int> = 0>
Graph(int n, const vc<pair<I, I>> &es, const Weight &dflt_cost) : n(n), m(es.size()), era(0)
{
build(LMD(i, (tuple{es[i].first, es[i].second, dflt_cost})));
}
template <class I, class C, enable_if_t<is_same_v<C, Cost> && !is_void_v<C>, int> = 0>
Graph(int n, const vc<tuple<I, I, C>> &es) : n(n), m(es.size()), era(0)
{
build(LMD(i, es[i]));
}
Graph(int n, const vc<E> &es) : n(n), m(es.size()), era(0)
{
build(LMD(i, (tuple{es[i].from, es[i].to, es[i].cost})));
}
template <class I = ll>
I size() const { return n; }
template <class I = ll>
I num_of_edges() const { return m - era; }
auto out_edges(int v) const
{
return OutEdgeRow(this, v);
}
template <class I = ll>
vc<I> out_vertices(int v) const
;
vc<E> edges() const
;
#line 4502
vvc<E> adj_list() const
;
template <class I = ll>
vvc<I> adj_matrix_ecnt() const
;
template <class I = ll>
vc<I> indegs() const
;
template <class I = ll>
vc<I> outdegs() const
;
void erase_edge(int eid)
;
#line 4559
private:
void internal_erase(int elist_id)
;
#line 4585
};
template <bool is_directed, bool is_erasable = false, class I>
Graph(int, const vc<pair<I, I>> &) -> Graph<is_directed, void, is_erasable>;
template <bool is_directed, bool is_erasable = false, class I, class Cost>
Graph(int, const vc<tuple<I, I, Cost>> &) -> Graph<is_directed, Cost, is_erasable>;
template <bool is_directed, bool is_erasable = false, class I, class Cost>
Graph(int, const vc<pair<I, I>> &, const Cost &) -> Graph<is_directed, Cost, is_erasable>;
template <bool is_directed, bool is_erasable = false, class Cost>
Graph(int, const vc<Edge<Cost>> &) -> Graph<is_directed, Cost, is_erasable>;
template <class Cost = void, bool is_erasable = false>
using GraphDirected = Graph<true, Cost, is_erasable>;
template <class Cost = void, bool is_erasable = false>
using GraphUndirected = Graph<false, Cost, is_erasable>;
template <class Cost>
GraphDirected<Cost> rev_graph(const GraphDirected<Cost> &g)
;
#line 4626
template <class T>
struct MyDeque
{
private:
vc<T> d;
int l = 0, sz = 0;
int index(int i) const
;
void extend(int cap)
;
void prepare_push()
;
public:
void reserve(int n)
;
template <class I = ll>
I size() const ;
bool empty() const ;
void push_front(const T &x)
;
void push_back(const T &x)
;
const T &front() const
;
T &front()
;
const T &back() const
;
T &back()
;
void pop_front()
;
void pop_back()
;
void clear() ;
const T &operator[](int i) const ;
T &operator[](int i) ;
const T &at(int i) const
;
T &at(int i)
;
vc<T> content() const
;
};
namespace internal
{
template <bool stop_on_negative_cycle, bool directed, class Cost, class Dist, class Update>
bool spfa_relax(const Graph<directed, Cost> &g, vc<Dist> &dists, const vc<int> &sources,
const Dist &infty, const Update &update)
;
#line 4795
}
template <class T>
struct MyQueue
{
private:
vc<T> d;
int pos = 0;
public:
void reserve(int n) ;
template <class I = ll>
I size() const ;
bool empty() const { return pos == SZ<int>(d); }
void push(const T &t) { d.eb(t); }
T front() const ;
T &front() { return d[pos]; }
void clear()
;
void pop() { pos++; }
T operator[](int i) const ;
T &operator[](int i) ;
T at(int i) const
;
T &at(int i)
;
vc<T> content() ;
vc<T> content() const ;
};
template <class Key, class Compare = less<Key>>
class FibonacciHeap
{
struct Node
{
Key key{};
int parent = -1, child = -1, prev = -1, next = -1, degree = 0;
bool marked = false, present = false;
CPP_DUMP_DEFINE_DATA(key, parent, child, prev, next, degree, marked, present);
};
vc<Node> nodes;
vc<int> roots, degrees;
Compare comp;
int minimum = -1, count = 0;
void detach(int v)
;
void insert_after(int u, int v)
;
void add_root(int v)
;
void cut(int v, int p)
;
public:
CPP_DUMP_DEFINE_DATA(minimum, count, nodes);
explicit FibonacciHeap(int n = 0, Compare comp = Compare{}) : nodes(n), comp(std::move(comp)) {}
int size() const ;
bool empty() const ;
bool contains(int id) const
;
const Key &key(int id) const ;
pair<Key, int> top() const
;
void push(int id, const Key &key)
;
void decrease_key(int id, const Key &key)
;
#line 4943
void push_or_decrease(int id, const Key &key)
;
void pop()
;
#line 4995
void clear()
;
};
//! 参考: https://hitonanode.github.io/cplib-cpp/graph/shortest_path.hpp
template <bool is_directed, class Cost, auto infty = nullptr>
struct ShortestPath
{
using Dist = decay_t<decltype(Edge<Cost>::cost)>;
private:
const Graph<is_directed, Cost> &g;
static constexpr decltype(auto) inf() { return resolved_infty<Dist, infty>(); }
vc<Dist> dists;
vc<Edge<Cost>> prv;
vc<int> sources;
bool solved_all = false;
template <class Starts>
void init_solve(const Starts &starts, int t)
{
const int n = g.size();
solved_all = (t == -1);
dists.assign(n, inf());
prv.assign(n, {});
sources.clear();
for (auto s : starts)
{
assert(0 <= s && u128(s) < u128(n));
if (dists[s] == inf())
{
dists[s] = 0;
sources.eb(int(s));
}
}
}
public:
CPP_DUMP_DEFINE_DATA(sources, dists, prv, solved_all);
explicit ShortestPath(const Graph<is_directed, Cost> &g) : g(g) {}
ShortestPath(const Graph<is_directed, Cost> &&) = delete;
vc<Dist> bfs(int s, int t = -1) ;
template <class Starts, class = decltype(begin(declval<const Starts &>()))>
vc<Dist> bfs(const Starts &s, int t = -1)
{
init_solve(s, t);
MyQueue<int> que;
for (int v : sources) que.push(v);
while (!que.empty())
{
auto v = que.front();
que.pop();
if (v == t)
break;
fe(e : g.out_edges(v))
{
if (chmin(dists[e.to], dists[v] + e.cost))
{
prv[e.to] = e;
que.push(e.to);
}
}
}
return dists;
}
vc<Dist> bfs01(int s, int t = -1) ;
template <class Starts, class = decltype(begin(declval<const Starts &>()))>
vc<Dist> bfs01(const Starts &s, int t = -1)
{
const int n = g.size();
init_solve(s, t);
vc<int> cur = sources, nxt;
vc<unsigned char> used(n, false);
while (!cur.empty() || !nxt.empty())
{
if (cur.empty()) cur.swap(nxt);
int v = cur.back();
cur.pop_back();
if (used[v])
continue;
used[v] = true;
if (v == t)
break;
fe(e : g.out_edges(v))
{
if (chmin(dists[e.to], dists[v] + e.cost))
{
prv[e.to] = e;
if (e.cost == 0)
cur.eb(e.to);
else
nxt.eb(e.to);
}
}
}
return dists;
}
vc<Dist> dial(int s, int max_cost, int t = -1) ;
template <class Starts, class = decltype(begin(declval<const Starts &>()))>
vc<Dist> dial(const Starts &s, int max_cost, int t = -1)
{
static_assert(is_integral_ext<Dist>);
const int n = g.size();
assert(0 <= max_cost);
init_solve(s, t);
const int bcnt = max_cost + 1;
vc<int> head(bcnt, -1), nxt(n, -2), pre(n, -2);
int que_size = 0;
auto erase = [&](int v, int b)
{
const int p = pre[v], q = nxt[v];
if (p == -1)
head[b] = q;
else
nxt[p] = q;
if (q != -1)
pre[q] = p;
nxt[v] = pre[v] = -2;
que_size--;
};
auto push = [&](int v, int b)
{
nxt[v] = head[b], pre[v] = -1;
if (head[b] != -1)
pre[head[b]] = v;
head[b] = v, que_size++;
};
Dist cur = 0;
for (int v : sources) push(v, 0);
while (que_size)
{
int b = int(cur % bcnt);
while (head[b] == -1)
{
cur++;
if (++b == bcnt)
b = 0;
}
const int v = head[b];
erase(v, b);
assert(dists[v] == cur);
if (v == t)
break;
fec(e : g.out_edges(v))
{
Dist nd = dists[v] + e.cost;
if (nd < dists[e.to])
{
if (pre[e.to] != -2)
erase(e.to, int(dists[e.to] % bcnt));
dists[e.to] = nd, prv[e.to] = e;
push(e.to, int(nd % bcnt));
}
}
}
return dists;
}
vc<Dist> dijkstra(int s, int t = -1) ;
template <class Starts, class = decltype(begin(declval<const Starts &>()))>
vc<Dist> dijkstra(const Starts &s, int t = -1)
{
init_solve(s, t);
pql<pair<Dist, int>> pque;
for (int v : sources) pque.push({0, v});
while (!pque.empty())
{
auto [d, v] = pque.top();
pque.pop();
if (v == t)
break;
if (dists[v] != d)
continue;
fec(e : g.out_edges(v))
{
Dist nd = dists[v] + e.cost;
if (chmin(dists[e.to], nd))
{
prv[e.to] = e;
pque.push({nd, e.to});
}
}
}
return dists;
}
vc<Dist> dijkstra_dense(int s, int t = -1) ;
template <class Starts, class = decltype(begin(declval<const Starts &>()))>
vc<Dist> dijkstra_dense(const Starts &s, int t = -1)
{
const int n = g.size();
init_solve(s, t);
vc<bool> ok(n, false);
repi(_, n)
{
Dist mn = inf();
int v = -1;
repi(u, n) if (!ok[u] && chmin(mn, dists[u])) v = u;
if (v == -1)
break;
if (v == t)
break;
ok[v] = true;
fec(e : g.out_edges(v))
{
if (chmin(dists[e.to], dists[v] + e.cost))
prv[e.to] = e;
}
}
return dists;
}
vc<Dist> dijkstra_fibonacci(int s, int t = -1) ;
template <class Starts, class = decltype(begin(declval<const Starts &>()))>
vc<Dist> dijkstra_fibonacci(const Starts &s, int t = -1)
;
#line 5263
vc<Dist> bellman_ford(int s) ;
template <class Starts, class = decltype(begin(declval<const Starts &>()))>
vc<Dist> bellman_ford(const Starts &s)
{
const int n = g.size();
init_solve(s, -1);
repi(t, 2 * n)
{
bool changed = false;
repi(v, n)
{
if (dists[v] == inf())
continue;
fec(e : g.out_edges(v))
{
Dist nd = dists[v] == -inf() ? -inf() : dists[v] + e.cost;
if (dists[e.to] > nd)
{
changed = true;
prv[e.to] = e;
if (t == n - 1)
dists[e.to] = -inf();
else
dists[e.to] = nd;
}
}
}
if (!changed) break;
}
repi(v, n) if (dists[v] == -inf()) prv[v] = {};
return dists;
}
vc<Dist> spfa(int s) ;
template <class Starts, class = decltype(begin(declval<const Starts &>()))>
vc<Dist> spfa(const Starts &s)
;
vc<Dist> solve(int s, int t = -1) { return solve(array<int, 1>{s}, t); }
template <class Starts, class = decltype(begin(declval<const Starts &>()))>
vc<Dist> solve(const Starts &s, int t = -1)
{
if constexpr (is_void_v<Cost>)
return bfs(s, t);
else
{
bool neg = false;
int zcnt = 0;
Dist wplus1 = -inf();
Dist max_cost = 0;
bool wpluscnt_geq2 = false;
repi(v, g.size()) fec(e : g.out_edges(v))
{
if (e.cost < 0)
{
neg = true;
break;
}
chmax(max_cost, e.cost);
}
repi(v, g.size()) fec(e : g.out_edges(v))
{
if (e.cost == 0)
zcnt++;
if (e.cost > 0)
{
if (wplus1 < 0)
wplus1 = e.cost;
else if (wplus1 != e.cost)
{
wpluscnt_geq2 = true;
break;
}
}
}
if (neg)
return bellman_ford(s);
else if (wpluscnt_geq2)
{
const ll n = g.size(), m = g.num_of_edges();
if (n * n < (m << 4))
return dijkstra_dense(s, t);
else
{
if constexpr (is_integral_ext<Dist>)
{
const u128 c = u128(max_cost);
const ull lg = max<ull>(1, bit_width(ull(n)) - 1);
if (c <= u128(m) * lg / u128(n))
return dial(s, int(c), t);
}
return dijkstra(s, t);
}
}
else
{
if (zcnt == 0)
return bfs(s, t);
else
return bfs01(s, t);
}
}
}
vc<Edge<Cost>> prev_edges() const
;
optional<vc<Edge<Cost>>> path_edge(int t) const
;
#line 5410
optional<vc<int>> path_vertex(int t) const
;
#line 5428
template <class mint>
vc<mint> count_paths() const
;
#line 5474
};
/*!
* Line insertion core; author: Simon Lindholm. File license: CC0.
* https://github.com/kth-competitive-programming/kactl/blob/b3548e973f8772010c1ef84e6d427c749733fd2c/content/data-structures/LineContainer.h
*/
template <class T>
struct ConvexHullTrickLine
{
T a, b;
int id = -1;
CPP_DUMP_DEFINE_DATA(a, b, id);
friend bool operator==(const ConvexHullTrickLine &x, const ConvexHullTrickLine &y)
{
return x.a == y.a && x.b == y.b && x.id == y.id;
}
};
template <class T>
struct ConvexHullTrickSegment
{
ConvexHullTrickLine<T> line;
T left, right;
CPP_DUMP_DEFINE_DATA(line, left, right);
};
template <class T, class U = larger_int_t<T>, class Compare = less<>,
auto inftyT = nullptr, auto inftyU = nullptr>
struct ConvexHullTrick
{
static_assert(!is_integral_ext<T> || is_signed_ext<T>);
static_assert(!is_integral_ext<U> || is_signed_ext<U>);
static_assert(is_same_v<Compare, less<>> || is_same_v<Compare, less<T>> ||
is_same_v<Compare, greater<>> || is_same_v<Compare, greater<T>>);
using Line = ConvexHullTrickLine<T>;
using Segment = ConvexHullTrickSegment<T>;
private:
static constexpr int sgn = is_same_v<Compare, less<>> || is_same_v<Compare, less<T>> ? -1 : 1;
static constexpr decltype(auto) infT() { return resolved_infty<T, inftyT>(); }
struct Node
{
T a, b;
mutable T r;
int id;
bool operator<(const Node &o) const { return a < o.a; }
bool operator<(const T &x) const { return r < x; }
friend bool operator<(const T &x, const Node &p) { return x < p.r; }
};
using It = typename multiset<Node, less<>>::iterator;
multiset<Node, less<>> st;
optional<It> qit;
optional<T> last_x;
int add_cnt = 0, qdir = 0;
static Line line(const Node &p) { return {sgn * p.a, sgn * p.b, p.id}; }
static U eval(const Line &p, const T &x) { return U(p.a) * U(x) + U(p.b); }
static T border(const Node &x, const Node &y)
{
assert(x.a < y.a);
if constexpr (is_integral_ext<T>)
return divfloor<T>(x.b - y.b, y.a - x.a);
else
return (x.b - y.b) / (y.a - x.a);
}
bool set_r(It x, It y)
{
if (y == st.end())
{
x->r = infT();
return false;
}
if (x->a == y->a)
x->r = x->b > y->b ? infT() : -infT();
else
x->r = border(*x, *y);
return x->r >= y->r;
}
public:
void add_line(T a, T b) { add_line(a, b, add_cnt); }
void add_line(T a, T b, int id)
{
add_cnt++;
reset_monotone_query();
Node p{sgn * a, sgn * b, infT(), id};
auto same = st.lower_bound(p);
if (same != st.end() && same->a == p.a)
{
if (same->b >= p.b) return;
auto prv = same == st.begin() ? st.end() : prev(same);
auto nxt = next(same);
st.erase(same);
if (prv != st.end()) set_r(prv, nxt);
}
auto z = st.insert(p), y = z++, x = y;
while (set_r(y, z)) z = st.erase(z);
if (x != st.begin() && set_r(--x, y)) set_r(x, y = st.erase(y));
while ((y = x) != st.begin() && (--x)->r >= y->r) set_r(x, st.erase(y));
}
optional<pair<U, Line>> query(const T &x) const
{
if (st.empty()) return nullopt;
auto it = st.lower_bound(x);
if (it == st.end()) --it;
Line p = line(*it);
return pair<U, Line>{eval(p, x), p};
}
optional<pair<U, Line>> query_monotone(const T &x)
;
#line 5640
void reset_monotone_query()
{
qit.reset();
last_x.reset();
qdir = 0;
}
local(auto content() const { return segments(); })
vc<Segment> segments() const
{
vc<Segment> res;
res.reserve(st.size());
T l = -infT();
for (auto it = st.begin(); it != st.end(); ++it)
{
auto nxt = next(it);
T r = nxt == st.end() ? infT() : it->r;
res.eb(Segment{line(*it), l, r});
l = r;
}
return res;
}
void clear()
;
};
template <class T, class U = larger_int_t<T>, class Compare = less<>,
auto inftyT = nullptr, auto inftyU = nullptr>
struct ConvexHullTrickMonotoneSlope
{
static_assert(!is_integral_ext<T> || is_signed_ext<T>);
static_assert(!is_integral_ext<U> || is_signed_ext<U>);
static_assert(is_same_v<Compare, less<>> || is_same_v<Compare, less<T>> ||
is_same_v<Compare, greater<>> || is_same_v<Compare, greater<T>>);
using Line = ConvexHullTrickLine<T>;
using Segment = ConvexHullTrickSegment<T>;
private:
static constexpr int sgn = is_same_v<Compare, less<>> || is_same_v<Compare, less<T>> ? -1 : 1;
static constexpr decltype(auto) infT() { return resolved_infty<T, inftyT>(); }
struct Node
{
T a, b;
T r;
int id;
};
deque<Node> dq;
optional<T> last_a;
optional<T> last_x;
int add_cnt = 0, adir = 0, qpos = -1, qdir = 0;
static Line line(const Node &p) ;
static U eval(const Line &p, const T &x) ;
static T border(const Node &x, const Node &y)
;
void push_back(Node p)
;
#line 5737
void push_front(Node p)
;
#line 5754
public:
void add_line(T a, T b) ;
void add_line(T a, T b, int id)
;
#line 5786
optional<pair<U, Line>> query(const T &x) const
;
optional<pair<U, Line>> query_monotone(const T &x)
;
#line 5825
void reset_monotone_query()
;
local(auto content() const { return segments(); })
vc<Segment> segments() const
{
vc<Segment> res;
res.reserve(dq.size());
T l = -infT();
repi(i, dq.size())
{
T r = i + 1 == SZ(dq) ? infT() : dq[i].r;
res.eb(Segment{line(dq[i]), l, r});
l = r;
}
return res;
}
void clear()
;
};
void main2()
{
LL(N, M);
VEC(ll, N, W);
VEC(tlll, M, UVT);
offset(UVT, tlll{-1, -1, 0});
GraphUndirected G(N, UVT);
ShortestPath sssp(G);
auto A = sssp.solve(0), B = sssp.solve(N - 1);
ll ans = A[N - 1];
ConvexHullTrick<ll, ll> cht;
rep(j, N) cht.add_line(W[j], B[j]);
rep(i, N)
{
ll tmp = A[i] + cht.query(W[i]).value().first;
dump(i, tmp);
chmin(ans, tmp);
}
PRINT(ans);
}
void test()
{
}
template <auto init, auto main2, auto test>
struct Main
{
Main()
{
cauto CERR = [](string val, string color)
{
string s = "\033[" + color + "m" + val + "\033[m";
};
CERR("\n[FAST_IO]\n\n", "32");
cout << fixed << setprecision(20);
init();
#line 5932
CERR("\n[SINGLE_TESTCASE]\n\n", "36");
main2();
#line 5947
}
};
Main<init, main2, test> main_dummy;
int main() {}
// submit-code: hash=54c3f0cb52b0 source=54c3f0cb52b06a8cf06e3a53e586089871f5122eb4175f2345c2f3d2f2c04935 input=f863d5dbbd08b429e3f78564184ed40829872f257d080ecd539c0da15e119430 body=3878874479986481d9b57add4987afd9376fe9ecb12fb125659d66617189e3b1
miscalc