// competitive-verifier: PROBLEM https://onlinejudge.u-aizu.ac.jp/courses/lesson/1/ALDS1/all/ALDS1_9_B
#include "../../../src/ds/heap/d_ary/lib.hpp"
#include "../../../src/io/container/lib.hpp"
using namespace tifa_libs;
int main() {
std::cin.tie(nullptr)->std::ios::sync_with_stdio(false);
u32 n;
std::cin >> n;
veci v(n);
std::cin >> v;
make_dary_heap<2>(begin(v), end(v));
std::cout << ' ' << v << '\n';
return 0;
}
#line 1 "test/cpv/aizu-alds1/alds1_9_b.cpp"
// competitive-verifier: PROBLEM https://onlinejudge.u-aizu.ac.jp/courses/lesson/1/ALDS1/all/ALDS1_9_B
#line 2 "src/ds/heap/d_ary/lib.hpp"
#line 2 "src/util/alias/num/lib.hpp"
#line 2 "src/util/util/lib.hpp"
// https://github.com/Tiphereth-A/CP-lib
#include <bits/extc++.h>
// clang-format off
namespace tifa_libs {
#define CEXP constexpr
#define CEXPE constexpr explicit
#define CR const&
#define CP const*
#define PC *const
#define CPC const*const
#define TPN typename
#define NE noexcept
#define CNE const noexcept
#define ND [[nodiscard]]
#define cT_(...) std::conditional_t<sizeof(__VA_ARGS__) <= sizeof(size_t) * 2, __VA_ARGS__, __VA_ARGS__ CR>
// NOLINTNEXTLINE(misc-const-correctness)
#define flt_(T, i, l, r, ...) for (T i = (l), i##e = (r)__VA_OPT__(, ) __VA_ARGS__; i < i##e; ++i)
#define retif_(cond, if_true, ...) if cond return if_true __VA_OPT__(; else return __VA_ARGS__)
#ifdef ONLINE_JUDGE
#undef assert
#define assert(x) 42
#endif
using namespace std::ranges;
using namespace std::literals;
template <class T>
CEXP T abs(T x) NE { retif_((x < 0), -x, x); }
} // namespace tifa_libs
// clang-format on
#line 4 "src/util/alias/num/lib.hpp"
// clang-format off
namespace tifa_libs {
#define mk0_(w, t) using w = t; using c##w = const t
#define mk_(w, t) mk0_(w, t); CEXP w operator""_##w(unsigned long long x) NE { return (w)x; }
mk_(i8, int8_t) mk_(u8, uint8_t) mk_(i16, int16_t) mk_(u16, uint16_t) mk_(i32, int32_t) mk_(u32, uint32_t) mk_(i64, int64_t) mk_(u64, uint64_t) mk_(isz, ssize_t) mk_(usz, size_t) mk_(chr, char) mk_(schr, signed char) mk_(uchr, unsigned char) mk_(sint, signed) mk_(uint, unsigned);
mk0_(i128, __int128_t); mk0_(u128, __uint128_t); mk0_(f32, float); mk0_(f64, double); mk0_(f128, long double);
#undef mk0_
#undef mk_
} // namespace tifa_libs
// clang-format on
#line 4 "src/ds/heap/d_ary/lib.hpp"
namespace tifa_libs {
// Copyright Malte Skarupke 2020.
// Distributed under the Boost Software License, Version 1.0.
// (See http://www.boost.org/LICENSE_1_0.txt)
namespace d_ary_heap_impl_ {
template <int D>
CEXP u32 ch1idx_(u32 i) NE { return i * D + 1; }
template <int D>
CEXP u32 chls_idx_(u32 i) NE { return i * D + D; }
template <int D>
CEXP u32 gchls_idx_(u32 i) NE { return i * (D * D) + (D * D + D); }
template <int D>
CEXP u32 pidx_(u32 i) NE { return (i - 1) / D; }
template <int D>
CEXP u32 gpidx_(u32 i) NE { return (i - (D + 1)) / (D * D); }
template <int D>
CEXP u32 idx_ngch_(u32 l) NE { return gpidx_<D>(l - 1) + 1; }
template <int D, class I, class C>
CEXP I l_ch_(I it_ch1, C&& c) NE {
if CEXP (D == 1) return it_ch1;
else if CEXP (D == 2) return it_ch1 + !!c(it_ch1[0], it_ch1[1]);
else {
I hl1 = l_ch_<D / 2>(it_ch1, c), hl2 = l_ch_<D - D / 2>(it_ch1 + D / 2, c);
retif_((c(*hl1, *hl2)), hl2, hl1);
}
}
template <int D, class I, class C>
CEXP I l_ch_(I it_ch1, int num_ch, C&& c) NE {
if CEXP (D == 2) return it_ch1;
else if CEXP (D == 3) {
if (num_ch == 1) return it_ch1;
return it_ch1 + !!c(it_ch1[0], it_ch1[1]);
} else if CEXP (D == 4) {
switch (num_ch) {
case 1: return it_ch1;
case 2: return it_ch1 + !!c(it_ch1[0], it_ch1[1]);
default:
I largest = it_ch1 + !!c(it_ch1[0], it_ch1[1]);
retif_((c(*largest, it_ch1[2])), it_ch1 + 2, largest);
}
} else {
switch (num_ch) {
case 1: return it_ch1;
case 2: return it_ch1 + !!c(it_ch1[0], it_ch1[1]);
case 3: {
I l = it_ch1 + !!c(it_ch1[0], it_ch1[1]);
retif_((c(*l, it_ch1[2])), it_ch1 + 2, l);
}
case 4: {
I hl1 = it_ch1 + !!c(it_ch1[0], it_ch1[1]),
hl2 = it_ch1 + 2 + !!c(it_ch1[2], it_ch1[3]);
retif_((c(*hl1, *hl2)), hl2, hl1);
}
default:
int h = num_ch / 2;
I hl1 = l_ch_<D>(it_ch1, h, c), hl2 = l_ch_<D>(it_ch1 + h, num_ch - h, c);
retif_((c(*hl1, *hl2)), hl2, hl1);
}
}
}
} // namespace d_ary_heap_impl_
template <int D, class I, class C = std::less<>>
CEXP void make_dary_heap(I begin, I end, C&& comp = C{}) NE {
u32 len = u32(end - begin);
if (len <= 1) return;
u32 idx = (len - 2) / D;
if (int num_ch_end = (len - 1) % D; num_ch_end) {
I chl = d_ary_heap_impl_::l_ch_<D>(begin + d_ary_heap_impl_::ch1idx_<D>(idx), num_ch_end, comp);
if (comp(begin[idx], *chl)) swap(begin[idx], *chl);
if (idx == 0) return;
--idx;
}
if (idx > 0)
for (u32 lidx_ngcd = d_ary_heap_impl_::idx_ngch_<D>(len);;) {
I ch = d_ary_heap_impl_::l_ch_<D>(begin + d_ary_heap_impl_::ch1idx_<D>(idx), comp);
if (comp(begin[idx], *ch)) swap(begin[idx], *ch);
if (idx-- == lidx_ngcd) break;
}
for (;; --idx) {
TPN std::iterator_traits<I>::value_type value = std::move(begin[idx]);
u32 mdidx = idx;
for (;;) {
u32 idx_ch = d_ary_heap_impl_::chls_idx_<D>(mdidx), idx_ch1 = idx_ch - (D - 1);
I ch = begin;
if (idx_ch < len) ch = d_ary_heap_impl_::l_ch_<D>(begin + idx_ch1, comp);
else if (idx_ch1 >= len) break;
else ch = d_ary_heap_impl_::l_ch_<D>(begin + idx_ch1, int(len - idx_ch1), comp);
if (!comp(value, *ch)) break;
begin[mdidx] = std::move(*ch), mdidx = u32(ch - begin);
}
if (begin[mdidx] = std::move(value); idx == 0) break;
}
}
template <int D, common_range R, class C = std::less<>>
CEXP void make_dary_heap(R CR r, C&& comp = C{}) NE { return make_dary_heap<D>(begin(r), end(r), std::forward<C>(comp)); }
template <int D, class I, class C = std::less<>>
CEXP bool is_dary_heap(I begin, I end, C&& comp = C{}) NE {
flt_ (u32, i, 1, u32(end - begin))
if (u32 p = d_ary_heap_impl_::pidx_<D>(i); comp(begin[p], begin[i])) return false;
return true;
}
template <int D, common_range R, class C = std::less<>>
CEXP void is_dary_heap(R CR r, C&& comp = C{}) NE { return is_dary_heap<D>(begin(r), end(r), std::forward<C>(comp)); }
template <int D, class I, class C = std::less<>>
CEXP void push_dary_heap(I begin, I end, C&& comp = C{}) NE {
TPN std::iterator_traits<I>::value_type val = std::move(end[-1]);
u32 idx = u32(end - begin) - 1;
while (idx > 0) {
u32 p = d_ary_heap_impl_::pidx_<D>(idx);
if (!comp(begin[p], val)) break;
begin[idx] = std::move(begin[p]), idx = p;
}
begin[idx] = std::move(val);
}
template <int D, common_range R, class C = std::less<>>
CEXP void push_dary_heap(R CR r, C&& comp = C{}) NE { return push_dary_heap<D>(begin(r), end(r), std::forward<C>(comp)); }
template <int D, class I, class C = std::less<>>
CEXP void pop_dary_heap(I begin, I end, C&& comp = C{}) NE {
u32 len = u32(end - begin) - 1;
TPN std::iterator_traits<I>::value_type val = std::move(end[-1]);
u32 idx = 0;
for (end[-1] = std::move(begin[0]);;) {
if (u32 chls = d_ary_heap_impl_::chls_idx_<D>(idx), ch1 = chls - (D - 1); chls < len) {
I ch = d_ary_heap_impl_::l_ch_<D>(begin + ch1, comp);
if (!comp(val, *ch)) break;
begin[idx] = std::move(*ch), idx = u32(ch - begin);
} else if (ch1 < len) {
I ch = d_ary_heap_impl_::l_ch_<D>(begin + ch1, int(len - ch1), comp);
if (comp(val, *ch)) begin[idx] = std::move(*ch), idx = u32(ch - begin);
break;
} else break;
}
begin[idx] = std::move(val);
}
template <int D, common_range R, class C = std::less<>>
CEXP void pop_dary_heap(R CR r, C&& comp = C{}) NE { return pop_dary_heap<D>(begin(r), end(r), std::forward<C>(comp)); }
} // namespace tifa_libs
#line 2 "src/io/container/lib.hpp"
#line 2 "src/util/traits/others/lib.hpp"
// clang-format off
#line 2 "src/util/alias/others/lib.hpp"
#line 2 "src/util/consts/lib.hpp"
#line 4 "src/util/consts/lib.hpp"
// clang-format off
namespace tifa_libs {
using std::numbers::pi_v;
template <std::floating_point FP>
inline FP eps_v = std::sqrt(std::numeric_limits<FP>::epsilon());
template <std::floating_point FP>
CEXP void set_eps(FP v) NE { eps_v<FP> = v; }
CEXP u32 TIME = ((__TIME__[0] & 15) << 20) | ((__TIME__[1] & 15) << 16) | ((__TIME__[3] & 15) << 12) | ((__TIME__[4] & 15) << 8) | ((__TIME__[6] & 15) << 4) | (__TIME__[7] & 15);
CEXP auto STR2U16 = [] { std::array<u32, 65536> table{}; table.fill(-1_u32); flt_ (u32, i, 48, 58) flt_ (u32, j, 48, 58) table[i << 8 | j] = (j & 15) * 10 + (i & 15); return table; }();
inline const auto fn_0 = [](auto&&...) NE {};
inline const auto fn_is0 = [](auto x) NE { return x == 0; };
} // namespace tifa_libs
// clang-format on
#line 4 "src/util/alias/others/lib.hpp"
namespace tifa_libs {
template <class T>
struct chash {
CEXP static u64 C = u64(pi_v<f128> * 2e18) | 71;
CEXP u64 operator()(T x) CNE { return __builtin_bswap64(((u64)x ^ TIME) * C); }
};
// clang-format off
#define mk_(w, t) using w = t; using c##w = const t;
mk_(strn, std::string) mk_(strnv, std::string_view)
#undef mk_
template <class T> struct edge_t { T w; u32 u, v; CEXP auto operator<=>(edge_t CR) const = default; }; template <class T> using cedge_t = const edge_t<T>;
template <class T> struct pt3 { T _0, _1, _2; CEXP auto operator<=>(pt3 CR) const = default; }; template <class T> using cpt3 = const pt3<T>;
template <class T> struct pt4 { T _0, _1, _2, _3; CEXP auto operator<=>(pt4 CR) const = default; }; template <class T> using cpt4 = const pt4<T>;
#define mkT_(w, t, ...) template <class T> using w = t __VA_OPT__(, ) __VA_ARGS__; template <class T> using c##w = const t __VA_OPT__(, ) __VA_ARGS__;
mkT_(ptt, std::pair<T, T>) mkT_(alc, std::pmr::polymorphic_allocator<T>) mkT_(vec, std::vector<T>) mkT_(vvec, vec<vec<T>>) mkT_(v3ec, vvec<vec<T>>) mkT_(vecpt, vec<ptt<T>>) mkT_(vvecpt, vvec<ptt<T>>) mkT_(ptvec, ptt<vec<T>>) mkT_(ptvvec, ptt<vvec<T>>)
#undef mkT_
template <class T> using itl = std ::initializer_list<T>;
template <class T, usz ext = std::dynamic_extent> using spn = std::span<T const, ext>;
template <class T, usz N> using arr = std::array<T, N>; template <class T, usz N> using carr = std::array<const T, N>;
template <class U, class T> using vecp = vec<std::pair<U, T>>; template <class U, class T> using vvecp = vvec<std::pair<U, T>>;
template <class U, class T> using vvecp = vvec<std::pair<U, T>>; template <class U, class T> using vvvecp = vvec<vvec<std::pair<U, T>>>;
#ifdef PB_DS_ASSOC_CNTNR_HPP
template <class T, class C = std::less<T>> using set = __gnu_pbds::tree<T, __gnu_pbds::null_type, C>;
template <class K, class V, class C = std::less<K>> using map = __gnu_pbds::tree<K, V, C>;
// hset<u64> s({}, {}, {}, {}, {1<<16});
template <class T, class HF = chash<T>> using hset = __gnu_pbds::gp_hash_table<T, __gnu_pbds::null_type, HF>;
// hmap<u64, int> s({}, {}, {}, {}, {1<<16});
template <class K, class V, class HF = chash<K>> using hmap = __gnu_pbds::gp_hash_table<K, V, HF>;
#else
using std::set, std::map;
template <class T, class HF = chash<T>> using hset = std::unordered_set<T, HF>;
template <class K, class V, class HF = chash<K>> using hmap = std::unordered_map<K, V, HF>;
#endif
#ifdef PB_DS_PRIORITY_QUEUE_HPP
template <class T, class C = std::less<T>> using pq = __gnu_pbds::priority_queue<T, C>;
#else
template <class T, class C = std::less<T>> using pq = std::priority_queue<T, vec<T>, C>;
#endif
template <class T> using pqg = pq<T, std::greater<T>>;
// clang-format on
#define mk1_(V, A, T) using V##A = V<T>;
#define mk_(V, A, T) mk1_(V, A, T) mk1_(c##V, A, T)
#define mk(A, T) mk_(edge_t, A, T) mk_(ptt, A, T) mk_(pt3, A, T) mk_(pt4, A, T) mk_(vec, A, T) mk_(vvec, A, T) mk_(v3ec, A, T) mk_(vecpt, A, T) mk_(vvecpt, A, T) mk_(ptvec, A, T) mk_(ptvvec, A, T) mk1_(spn, A, T) mk1_(itl, A, T)
mk(b, bool) mk(c, chr) mk(i, i32) mk(u, u32) mk(ii, i64) mk(uu, u64) mk(t, isz) mk(z, usz) mk(f, f32) mk(d, f64) mk(s, strn);
#undef mk
#undef mk_
#undef mk1_
} // namespace tifa_libs
#line 4 "src/util/traits/others/lib.hpp"
namespace tifa_libs {
//! only for template without non-type argument
template <class, template <class...> class> CEXP bool specialized_from_v = false;
template <template <class...> class T, class... Args> CEXP bool specialized_from_v<T<Args...>, T> = true;
static_assert(specialized_from_v<vecu, std::vector>);
template <class T> concept container_c = common_range<T> && !std::is_array_v<std::remove_cvref_t<T>> && !std::same_as<std::remove_cvref_t<T>, strn> && !std::same_as<std::remove_cvref_t<T>, strnv>;
template <class T> concept istream_c = std::derived_from<T, std::istream> || std::derived_from<T, std::wistream> || requires(T is) { is.peek(); };
template <class T> concept ostream_c = std::derived_from<T, std::ostream> || std::derived_from<T, std::wostream> || requires(T os) { os.flush(); };
} // namespace tifa_libs
// clang-format on
#line 4 "src/io/container/lib.hpp"
namespace tifa_libs {
auto& operator>>(tifa_libs::istream_c auto& is, tifa_libs::container_c auto& x) NE {
for (auto& i : x) is >> i;
return is;
}
auto& operator<<(tifa_libs::ostream_c auto& os, tifa_libs::container_c auto CR x) NE {
if (begin(x) == end(x)) [[unlikely]]
return os;
auto it = begin(x);
for (os << *it++; it != end(x); ++it) os << ' ' << *it;
return os;
}
} // namespace tifa_libs
#line 4 "test/cpv/aizu-alds1/alds1_9_b.cpp"
using namespace tifa_libs;
int main() {
std::cin.tie(nullptr)->std::ios::sync_with_stdio(false);
u32 n;
std::cin >> n;
veci v(n);
std::cin >> v;
make_dary_heap<2>(begin(v), end(v));
std::cout << ' ' << v << '\n';
return 0;
}
test/cpv/aizu-alds1/alds1_9_b.cpp