test/and_convolution.test.cpp

• View this file on GitHub
• Last update: 2022-01-28 13:07:07+09:00
• Problem: https://judge.yosupo.jp/problem/bitwise_and_convolution

Depends on

• algorithm/and_convolution.cpp
• algorithm/superset_mobius_transform.cpp
• algorithm/superset_zeta_transform.cpp
• math/rem_euclid.cpp
• math/static_modint.cpp
• math/totient.cpp
• traits/num_ring.cpp
• traits/product_monoid.cpp
• traits/sum_group.cpp
• utility/int_alias.cpp
• utility/rep.cpp

Code

#define PROBLEM "https://judge.yosupo.jp/problem/bitwise_and_convolution"
#include "../algorithm/and_convolution.cpp"
#include "../math/static_modint.cpp"
#include "../traits/num_ring.cpp"
#include <iostream>
#include <vector>

using Fp = Modint998244353;

int main() {
    int N;
    std::cin >> N;
    N = 1 << N;
    std::vector<Fp> A(N), B(N);
    for (auto& x : A) {
        u32 t;
        std::cin >> t;
        x = t;
    }
    for (auto& x : B) {
        u32 t;
        std::cin >> t;
        x = t;
    }
    const auto C = and_convolution<NumRing<Fp>>(A, B);
    for (const int i : rep(N)) {
        std::cout << C[i] << " \n"[i + 1 == N];
    }
}

#line 1 "test/and_convolution.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/bitwise_and_convolution"
#line 2 "algorithm/and_convolution.cpp"
#include <cassert>
#include <vector>
#line 2 "utility/rep.cpp"
#include <algorithm>

class Range {
    struct Iter {
        int itr;
        constexpr Iter(const int pos) noexcept : itr(pos) {}
        constexpr void operator++() noexcept { ++itr; }
        constexpr bool operator!=(const Iter& other) const noexcept { return itr != other.itr; }
        constexpr int operator*() const noexcept { return itr; }
    };
    const Iter first, last;

  public:
    explicit constexpr Range(const int first, const int last) noexcept : first(first), last(std::max(first, last)) {}
    constexpr Iter begin() const noexcept { return first; }
    constexpr Iter end() const noexcept { return last; }
};

constexpr Range rep(const int l, const int r) noexcept { return Range(l, r); }
constexpr Range rep(const int n) noexcept { return Range(0, n); }
#line 5 "algorithm/superset_mobius_transform.cpp"

template <class G> void superset_mobius_transform(std::vector<typename G::Type>& f) {
    const int n = f.size();
    assert((n & (n - 1)) == 0);
    for (int i = n; i >>= 1;)
        for (const int j : rep(n))
            if (j & i) f[j & ~i] = G::operation(f[j & ~i], G::inverse(f[j]));
}
#line 5 "algorithm/superset_zeta_transform.cpp"

template <class S> void superset_zeta_transform(std::vector<typename S::Type>& f) {
    const int n = f.size();
    assert((n & (n - 1)) == 0);
    for (int i = 1; i < n; i <<= 1)
        for (const int j : rep(n))
            if (j & i) f[j & ~i] = S::operation(f[j & ~i], f[j]);
}
#line 7 "algorithm/and_convolution.cpp"

template <class R>
std::vector<typename R::Type> and_convolution(std::vector<typename R::Type> a, std::vector<typename R::Type> b) {
    assert(a.size() == b.size());
    superset_zeta_transform<typename R::Sum>(a);
    superset_zeta_transform<typename R::Sum>(b);
    for (const int i : rep(a.size())) a[i] = R::Product::operation(a[i], b[i]);
    superset_mobius_transform<typename R::Sum>(a);
    return a;
}
#line 2 "math/static_modint.cpp"
#include <ostream>
#include <type_traits>
#line 2 "utility/int_alias.cpp"
#include <cstdint>

using i32 = std::int32_t;
using u32 = std::uint32_t;
using i64 = std::int64_t;
using u64 = std::uint64_t;
using i128 = __int128_t;
using u128 = __uint128_t;
#line 3 "math/rem_euclid.cpp"

template <class T> constexpr T rem_euclid(T value, const T& mod) {
    assert(mod > 0);
    return (value %= mod) >= 0 ? value : value + mod;
}
#line 2 "math/totient.cpp"

template <class T> constexpr T totient(T x) {
    T ret = x;
    for (T i = 2; i * i <= x; ++i) {
        if (x % i == 0) {
            ret /= i;
            ret *= i - 1;
            while (x % i == 0) x /= i;
        }
    }
    if (x > 1) {
        ret /= x;
        ret *= x - 1;
    }
    return ret;
}
#line 7 "math/static_modint.cpp"

template <u32 MOD, std::enable_if_t<((u32)1 <= MOD and MOD <= ((u32)1 << 31))>* = nullptr> class StaticModint {
    using Self = StaticModint;

    static inline constexpr u32 PHI = totient(MOD);
    u32 v;

  public:
    static constexpr u32 mod() noexcept { return MOD; }

    template <class T, std::enable_if_t<std::is_integral_v<T>>* = nullptr>
    static constexpr T normalize(const T& x) noexcept {
        return rem_euclid<std::common_type_t<T, i64>>(x, MOD);
    }

    constexpr StaticModint() noexcept : v(0) {}
    template <class T> constexpr StaticModint(const T& x) noexcept : v(normalize(x)) {}
    template <class T> static constexpr Self raw(const T& x) noexcept {
        Self ret;
        ret.v = x;
        return ret;
    }

    constexpr u32 val() const noexcept { return v; }
    constexpr Self neg() const noexcept { return raw(v == 0 ? 0 : MOD - v); }
    constexpr Self inv() const noexcept { return pow(PHI - 1); }
    constexpr Self pow(u64 exp) const noexcept {
        Self ret(1), mult(*this);
        for (; exp > 0; exp >>= 1) {
            if (exp & 1) ret *= mult;
            mult *= mult;
        }
        return ret;
    }

    constexpr Self operator-() const noexcept { return neg(); }
    constexpr Self operator~() const noexcept { return inv(); }

    constexpr Self operator+(const Self& rhs) const noexcept { return Self(*this) += rhs; }
    constexpr Self& operator+=(const Self& rhs) noexcept {
        if ((v += rhs.v) >= MOD) v -= MOD;
        return *this;
    }

    constexpr Self operator-(const Self& rhs) const noexcept { return Self(*this) -= rhs; }
    constexpr Self& operator-=(const Self& rhs) noexcept {
        if (v < rhs.v) v += MOD;
        v -= rhs.v;
        return *this;
    }

    constexpr Self operator*(const Self& rhs) const noexcept { return Self(*this) *= rhs; }
    constexpr Self& operator*=(const Self& rhs) noexcept {
        v = (u64)v * rhs.v % MOD;
        return *this;
    }

    constexpr Self operator/(const Self& rhs) const noexcept { return Self(*this) /= rhs; }
    constexpr Self& operator/=(const Self& rhs) noexcept { return *this *= rhs.inv(); }

    constexpr bool operator==(const Self& rhs) const noexcept { return v == rhs.v; }
    constexpr bool operator!=(const Self& rhs) const noexcept { return v != rhs.v; }
    friend std::ostream& operator<<(std::ostream& stream, const Self& rhs) { return stream << rhs.v; }
};

using Modint1000000007 = StaticModint<1000000007>;
using Modint998244353 = StaticModint<998244353>;
#line 2 "traits/sum_group.cpp"

template <class T> struct SumGroup {
    using Type = T;
    static constexpr T identity() { return T(0); }
    static constexpr T operation(const T& l, const T& r) { return l + r; }
    static constexpr T inverse(const T& x) { return -x; }
};
#line 2 "traits/product_monoid.cpp"

template <class T> struct ProductMonoid {
    using Type = T;
    static constexpr T identity() { return T(1); }
    static constexpr T operation(const T& l, const T& r) { return l * r; }
};
#line 4 "traits/num_ring.cpp"

template <class T> struct NumRing {
    using Type = T;
    using Sum = SumGroup<T>;
    using Product = ProductMonoid<T>;
};
#line 5 "test/and_convolution.test.cpp"
#include <iostream>
#line 7 "test/and_convolution.test.cpp"

using Fp = Modint998244353;

int main() {
    int N;
    std::cin >> N;
    N = 1 << N;
    std::vector<Fp> A(N), B(N);
    for (auto& x : A) {
        u32 t;
        std::cin >> t;
        x = t;
    }
    for (auto& x : B) {
        u32 t;
        std::cin >> t;
        x = t;
    }
    const auto C = and_convolution<NumRing<Fp>>(A, B);
    for (const int i : rep(N)) {
        std::cout << C[i] << " \n"[i + 1 == N];
    }
}

Back to top page