This documentation is automatically generated by online-judge-tools/verification-helper
View the Project on GitHub suisen-cp/cp-library-cpp
#include "library/transform/kronecker_power.hpp"
シグネチャ
template <typename T, std::size_t D, auto unit_transform> void kronecker_power_transform(std::vector<T> &x) // (1) template <typename T, typename UnitTransform> void kronecker_power_transform(std::vector<T> &x, const std::size_t D, UnitTransform unit_transform) // (2) template <typename T, auto e = default_operator::zero<T>, auto add = default_operator::add<T>, auto mul = default_operator::mul<T>> void kronecker_power_transform(std::vector<T> &x, const std::vector<std::vector<T>> &A) // (3)
概要
$D \times D$ 行列 $A$ のクロネッカー積における $N$ 乗 $A ^ {\otimes N}$ と $D ^ N$ 次元ベクトル $x$ の積を inplace に $\Theta ( N \cdot D ^ N )$ 時間で計算する。
ゼータ変換・メビウス変換・アダマール変換らはこの具体例であり、以下のように対応付けられる。
上位集合版のゼータ変換
$D=2,A=\begin{pmatrix} 1 & 1 \\ 0 & 1 \end{pmatrix}$
上位集合版のメビウス変換
$D=2,A=\begin{pmatrix} 1 & -1 \\ 0 & 1 \end{pmatrix}$
下位集合版のゼータ変換
$D=2,A=\begin{pmatrix} 1 & 0 \\ 1 & 1 \end{pmatrix}$
下位集合版のメビウス変換
$D=2,A=\begin{pmatrix} 1 & 0 \\ -1 & 1 \end{pmatrix}$
アダマール変換
$D=2,A=\begin{pmatrix} 1 & 1 \\ 1 & -1 \end{pmatrix}$
これらは全て $D=2$ の例であるが、例えば $3$ 進ゼータ変換は $D=3,A=\begin{pmatrix} 1 & 0 & 0 \\ 1 & 1 & 0 \\ 1 & 1 & 1 \end{pmatrix}$、メビウス変換は $D=3,A=\begin{pmatrix} 1 & 0 & 0 \\ -1 & 1 & 0 \\ 0 & -1 & 1 \end{pmatrix}$ となる (はず)。
使い方
unit_transform
T &x1, ..., T &xD
D
vector<T> &
operator+
operator*
T{0}
返り値
1, 2, 3 ともに無し。変換は inplace に行われる。
制約
x
時間計算量
$\Theta(N\cdot D ^ N)$
#ifndef SUISEN_KRONECKER_POWER #define SUISEN_KRONECKER_POWER #include <cassert> #include <utility> #include <vector> #include "library/util/default_operator.hpp" namespace suisen { namespace kronecker_power_transform { namespace internal { template <typename UnitTransform, typename ReferenceGetter, std::size_t... Seq> void unit_transform(UnitTransform transform, ReferenceGetter ref_getter, std::index_sequence<Seq...>) { transform(ref_getter(Seq)...); } } template <typename T, std::size_t D, auto unit_transform> void kronecker_power_transform(std::vector<T> &x) { const std::size_t n = x.size(); for (std::size_t block = 1; block < n; block *= D) { for (std::size_t l = 0; l < n; l += D * block) { for (std::size_t offset = l; offset < l + block; ++offset) { const auto ref_getter = [&](std::size_t i) -> T& { return x[offset + i * block]; }; internal::unit_transform(unit_transform, ref_getter, std::make_index_sequence<D>()); } } } } template <typename T, typename UnitTransform> void kronecker_power_transform(std::vector<T> &x, const std::size_t D, UnitTransform unit_transform) { const std::size_t n = x.size(); std::vector<T> work(D); for (std::size_t block = 1; block < n; block *= D) { for (std::size_t l = 0; l < n; l += D * block) { for (std::size_t offset = l; offset < l + block; ++offset) { for (std::size_t i = 0; i < D; ++i) work[i] = x[offset + i * block]; unit_transform(work); for (std::size_t i = 0; i < D; ++i) x[offset + i * block] = work[i]; } } } } template <typename T, auto e = default_operator::zero<T>, auto add = default_operator::add<T>, auto mul = default_operator::mul<T>> auto kronecker_power_transform(std::vector<T> &x, const std::vector<std::vector<T>> &A) -> decltype(e(), add(std::declval<T>(), std::declval<T>()), mul(std::declval<T>(), std::declval<T>()), void()) { const std::size_t D = A.size(); assert(D == A[0].size()); auto unit_transform = [&](std::vector<T> &x) { std::vector<T> y(D, e()); for (std::size_t i = 0; i < D; ++i) for (std::size_t j = 0; j < D; ++j) { y[i] = add(y[i], mul(A[i][j], x[j])); } x.swap(y); }; kronecker_power_transform<T>(x, D, unit_transform); } } } // namespace suisen #endif // SUISEN_KRONECKER_POWER
#line 1 "library/transform/kronecker_power.hpp" #include <cassert> #include <utility> #include <vector> #line 1 "library/util/default_operator.hpp" namespace suisen { namespace default_operator { template <typename T> auto zero() -> decltype(T { 0 }) { return T { 0 }; } template <typename T> auto one() -> decltype(T { 1 }) { return T { 1 }; } template <typename T> auto add(const T &x, const T &y) -> decltype(x + y) { return x + y; } template <typename T> auto sub(const T &x, const T &y) -> decltype(x - y) { return x - y; } template <typename T> auto mul(const T &x, const T &y) -> decltype(x * y) { return x * y; } template <typename T> auto div(const T &x, const T &y) -> decltype(x / y) { return x / y; } template <typename T> auto mod(const T &x, const T &y) -> decltype(x % y) { return x % y; } template <typename T> auto neg(const T &x) -> decltype(-x) { return -x; } template <typename T> auto inv(const T &x) -> decltype(one<T>() / x) { return one<T>() / x; } } // default_operator namespace default_operator_noref { template <typename T> auto zero() -> decltype(T { 0 }) { return T { 0 }; } template <typename T> auto one() -> decltype(T { 1 }) { return T { 1 }; } template <typename T> auto add(T x, T y) -> decltype(x + y) { return x + y; } template <typename T> auto sub(T x, T y) -> decltype(x - y) { return x - y; } template <typename T> auto mul(T x, T y) -> decltype(x * y) { return x * y; } template <typename T> auto div(T x, T y) -> decltype(x / y) { return x / y; } template <typename T> auto mod(T x, T y) -> decltype(x % y) { return x % y; } template <typename T> auto neg(T x) -> decltype(-x) { return -x; } template <typename T> auto inv(T x) -> decltype(one<T>() / x) { return one<T>() / x; } } // default_operator } // namespace suisen #line 9 "library/transform/kronecker_power.hpp" namespace suisen { namespace kronecker_power_transform { namespace internal { template <typename UnitTransform, typename ReferenceGetter, std::size_t... Seq> void unit_transform(UnitTransform transform, ReferenceGetter ref_getter, std::index_sequence<Seq...>) { transform(ref_getter(Seq)...); } } template <typename T, std::size_t D, auto unit_transform> void kronecker_power_transform(std::vector<T> &x) { const std::size_t n = x.size(); for (std::size_t block = 1; block < n; block *= D) { for (std::size_t l = 0; l < n; l += D * block) { for (std::size_t offset = l; offset < l + block; ++offset) { const auto ref_getter = [&](std::size_t i) -> T& { return x[offset + i * block]; }; internal::unit_transform(unit_transform, ref_getter, std::make_index_sequence<D>()); } } } } template <typename T, typename UnitTransform> void kronecker_power_transform(std::vector<T> &x, const std::size_t D, UnitTransform unit_transform) { const std::size_t n = x.size(); std::vector<T> work(D); for (std::size_t block = 1; block < n; block *= D) { for (std::size_t l = 0; l < n; l += D * block) { for (std::size_t offset = l; offset < l + block; ++offset) { for (std::size_t i = 0; i < D; ++i) work[i] = x[offset + i * block]; unit_transform(work); for (std::size_t i = 0; i < D; ++i) x[offset + i * block] = work[i]; } } } } template <typename T, auto e = default_operator::zero<T>, auto add = default_operator::add<T>, auto mul = default_operator::mul<T>> auto kronecker_power_transform(std::vector<T> &x, const std::vector<std::vector<T>> &A) -> decltype(e(), add(std::declval<T>(), std::declval<T>()), mul(std::declval<T>(), std::declval<T>()), void()) { const std::size_t D = A.size(); assert(D == A[0].size()); auto unit_transform = [&](std::vector<T> &x) { std::vector<T> y(D, e()); for (std::size_t i = 0; i < D; ++i) for (std::size_t j = 0; j < D; ++j) { y[i] = add(y[i], mul(A[i][j], x[j])); } x.swap(y); }; kronecker_power_transform<T>(x, D, unit_transform); } } } // namespace suisen