#pragma once
#include "../../ds/heap/radix/lib.hpp"
namespace tifa_libs {
template <class T = u64>
class huffman {
struct TIFA {
T weight;
vecu ch;
CEXP TIFA(T weight = T{}, u32 child_cnt = 0) NE : weight(weight), ch(child_cnt) {}
};
u32 cnt_w, cnt_l{}, ch_sz;
vec<TIFA> data;
template <class Res, class Op>
CEXP vec<Res> run(Op&& operate) CNE {
vec<Res> ret(cnt_w);
std::queue<std::pair<u32, Res>> q;
q.emplace(data.size() - 1, Res{});
while (!q.empty()) {
auto [now_idx, now_code] = q.front();
auto& ch = data[now_idx].ch;
q.pop();
flt_ (u32, i, 0, ch_sz)
if (auto&& next_child = ch[i]; next_child < cnt_l) {
if (next_child < cnt_w) ret[next_child] = operate(now_code, i);
continue;
} else q.emplace(next_child, operate(now_code, i));
}
return ret;
}
public:
CEXPE huffman(vec<T> CR weights, u32 child_sz = 2_u32) NE : cnt_w((u32)weights.size()), ch_sz{child_sz}, data() {
assert(1 < child_sz && child_sz < weights.size());
for (T now : weights) data.emplace_back(now);
flt_ (u32, i, 0, ((ch_sz - 1) - ((cnt_w - 1) % (ch_sz - 1))) % (ch_sz - 1)) data.emplace_back();
cnt_l = (u32)data.size();
rheap<T, u32> q;
flt_ (u32, i, 0, (u32)data.size()) q.emplace(data[i].weight, i);
while (q.size() > 1) {
data.emplace_back(T{}, ch_sz);
flt_ (u32, i, 0, ch_sz) {
auto [now_weight, now_idx] = q.top();
data.back().weight += now_weight, data.back().ch[i] = now_idx, q.pop();
}
q.emplace(data.back().weight, u32(data.size() - 1));
}
}
ND CEXP vec<strn> encode(strnv char_set = "01") CNE {
assert(char_set.size() == ch_sz);
return run<strn>([&](strn pre_code, u32 idx) NE {
pre_code += char_set[idx];
return pre_code;
});
}
ND CEXP vecu depths() CNE {
return run<u32>([](u32 pre_depth, u32) NE { return pre_depth + 1; });
}
};
} // namespace tifa_libs
#line 2 "src/edh/huffman/lib.hpp"
#line 2 "src/ds/heap/radix/lib.hpp"
#line 2 "src/util/alias/others/lib.hpp"
#line 2 "src/util/consts/lib.hpp"
#line 2 "src/util/alias/num/lib.hpp"
#line 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/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/ds/heap/radix/lib.hpp"
namespace tifa_libs {
template <std::unsigned_integral K, class V, class C = std::less<K>>
class radix_heap {
static CEXP u32 B = sizeof(K) * 8;
static CEXP C comp{};
arr<vecp<K, V>, B + 1> vs;
arr<K, B + 1> ms;
u32 s{0};
K last{0};
public:
CEXP radix_heap() NE { fill(ms, K(-1)); }
ND CEXP u32 size() CNE { return s; }
ND CEXP bool empty() CNE { return !s; }
CEXP void emplace(K key, cT_(V) val) NE {
const K b = (K)std::bit_width(key ^ last);
++s, vs[b].emplace_back(key, val), ms[b] = min(key, ms[b], comp);
}
CEXP std::pair<K, V> top() NE {
if (!~ms[0]) {
cu32 idx = u32(find_if(ms, [](auto x) NE { return !!~x; }) - begin(ms));
for (last = ms[idx]; auto& p : vs[idx]) {
const K b = (K)std::bit_width(p.first ^ last);
vs[b].emplace_back(p), ms[b] = min(p.first, ms[b], comp);
}
vs[idx].clear(), ms[idx] = K(-1);
}
return vs[0].back();
}
CEXP void pop() NE {
if (top(), --s, vs[0].pop_back(); vs[0].empty()) ms[0] = K(-1);
}
};
template <class K, class V>
using rheap = std::conditional_t<std::unsigned_integral<K>, radix_heap<K, V>, pqg<std::pair<K, V>>>;
template <class K, class V>
using rheapg = std::conditional_t<std::unsigned_integral<K>, radix_heap<K, V, std::greater<K>>, pq<std::pair<K, V>>>;
} // namespace tifa_libs
#line 4 "src/edh/huffman/lib.hpp"
namespace tifa_libs {
template <class T = u64>
class huffman {
struct TIFA {
T weight;
vecu ch;
CEXP TIFA(T weight = T{}, u32 child_cnt = 0) NE : weight(weight), ch(child_cnt) {}
};
u32 cnt_w, cnt_l{}, ch_sz;
vec<TIFA> data;
template <class Res, class Op>
CEXP vec<Res> run(Op&& operate) CNE {
vec<Res> ret(cnt_w);
std::queue<std::pair<u32, Res>> q;
q.emplace(data.size() - 1, Res{});
while (!q.empty()) {
auto [now_idx, now_code] = q.front();
auto& ch = data[now_idx].ch;
q.pop();
flt_ (u32, i, 0, ch_sz)
if (auto&& next_child = ch[i]; next_child < cnt_l) {
if (next_child < cnt_w) ret[next_child] = operate(now_code, i);
continue;
} else q.emplace(next_child, operate(now_code, i));
}
return ret;
}
public:
CEXPE huffman(vec<T> CR weights, u32 child_sz = 2_u32) NE : cnt_w((u32)weights.size()), ch_sz{child_sz}, data() {
assert(1 < child_sz && child_sz < weights.size());
for (T now : weights) data.emplace_back(now);
flt_ (u32, i, 0, ((ch_sz - 1) - ((cnt_w - 1) % (ch_sz - 1))) % (ch_sz - 1)) data.emplace_back();
cnt_l = (u32)data.size();
rheap<T, u32> q;
flt_ (u32, i, 0, (u32)data.size()) q.emplace(data[i].weight, i);
while (q.size() > 1) {
data.emplace_back(T{}, ch_sz);
flt_ (u32, i, 0, ch_sz) {
auto [now_weight, now_idx] = q.top();
data.back().weight += now_weight, data.back().ch[i] = now_idx, q.pop();
}
q.emplace(data.back().weight, u32(data.size() - 1));
}
}
ND CEXP vec<strn> encode(strnv char_set = "01") CNE {
assert(char_set.size() == ch_sz);
return run<strn>([&](strn pre_code, u32 idx) NE {
pre_code += char_set[idx];
return pre_code;
});
}
ND CEXP vecu depths() CNE {
return run<u32>([](u32 pre_depth, u32) NE { return pre_depth + 1; });
}
};
} // namespace tifa_libs
src/edh/huffman/lib.hpp