sotanishy's code snippets for competitive programming
View the Project on GitHub sotanishy/cp-library-cpp
#define PROBLEM "https://judge.yosupo.jp/problem/bitwise_and_convolution" #include <bits/stdc++.h> #include "../../math/modint.hpp" #include "../../math/set/and_or_convolution.hpp" using namespace std; using ll = long long; using mint = Modint<998244353>; int main() { int N; cin >> N; vector<mint> a(1 << N), b(1 << N); for (auto& x : a) cin >> x; for (auto& x : b) cin >> x; auto c = and_convolution(a, b); for (int i = 0; i < (1 << N); ++i) cout << c[i] << (i < (1 << N) - 1 ? " " : "\n"); }
#line 1 "test/yosupo/bitwise_and_convolution.test.cpp" #define PROBLEM "https://judge.yosupo.jp/problem/bitwise_and_convolution" #include <bits/stdc++.h> #line 4 "math/modint.hpp" /** * @brief Mod int */ template <int m> class Modint { using mint = Modint; static_assert(m > 0, "Modulus must be positive"); public: static constexpr int mod() { return m; } constexpr Modint(long long y = 0) : x(y >= 0 ? y % m : (y % m + m) % m) {} constexpr int val() const { return x; } constexpr mint& operator+=(const mint& r) { if ((x += r.x) >= m) x -= m; return *this; } constexpr mint& operator-=(const mint& r) { if ((x += m - r.x) >= m) x -= m; return *this; } constexpr mint& operator*=(const mint& r) { x = static_cast<int>(1LL * x * r.x % m); return *this; } constexpr mint& operator/=(const mint& r) { return *this *= r.inv(); } constexpr bool operator==(const mint& r) const { return x == r.x; } constexpr mint operator+() const { return *this; } constexpr mint operator-() const { return mint(-x); } constexpr friend mint operator+(const mint& l, const mint& r) { return mint(l) += r; } constexpr friend mint operator-(const mint& l, const mint& r) { return mint(l) -= r; } constexpr friend mint operator*(const mint& l, const mint& r) { return mint(l) *= r; } constexpr friend mint operator/(const mint& l, const mint& r) { return mint(l) /= r; } constexpr mint inv() const { int a = x, b = m, u = 1, v = 0; while (b > 0) { int t = a / b; std::swap(a -= t * b, b); std::swap(u -= t * v, v); } return mint(u); } constexpr mint pow(long long n) const { mint ret(1), mul(x); while (n > 0) { if (n & 1) ret *= mul; mul *= mul; n >>= 1; } return ret; } friend std::ostream& operator<<(std::ostream& os, const mint& r) { return os << r.x; } friend std::istream& operator>>(std::istream& is, mint& r) { long long t; is >> t; r = mint(t); return is; } private: int x; }; #line 2 "math/set/and_or_convolution.hpp" #include <bit> #line 4 "math/set/and_or_convolution.hpp" #line 5 "math/set/zeta_moebius_transform.hpp" template <typename T> void superset_fzt(std::vector<T>& a) { assert(std::has_single_bit(a.size())); const int n = a.size(); for (int i = 1; i < n; i <<= 1) { for (int j = 0; j < n; ++j) { if (!(j & i)) a[j] += a[j | i]; } } } template <typename T> void superset_fmt(std::vector<T>& a) { assert(std::has_single_bit(a.size())); const int n = a.size(); for (int i = 1; i < n; i <<= 1) { for (int j = 0; j < n; ++j) { if (!(j & i)) a[j] -= a[j | i]; } } } template <typename T> void subset_fzt(std::vector<T>& a) { assert(std::has_single_bit(a.size())); const int n = a.size(); for (int i = 1; i < n; i <<= 1) { for (int j = 0; j < n; ++j) { if (!(j & i)) a[j | i] += a[j]; } } } template <typename T> void subset_fmt(std::vector<T>& a) { assert(std::has_single_bit(a.size())); const int n = a.size(); for (int i = 1; i < n; i <<= 1) { for (int j = 0; j < n; ++j) { if (!(j & i)) a[j | i] -= a[j]; } } } #line 6 "math/set/and_or_convolution.hpp" /** * @brief Bitwise AND/OR Convolution */ template <typename T> std::vector<T> and_convolution(std::vector<T> a, std::vector<T> b) { const int n = std::bit_ceil(std::max(a.size(), b.size())); a.resize(n); b.resize(n); superset_fzt(a); superset_fzt(b); for (int i = 0; i < n; ++i) a[i] *= b[i]; superset_fmt(a); return a; } template <typename T> std::vector<T> or_convolution(std::vector<T> a, std::vector<T> b) { const int n = std::bit_ceil(std::max(a.size(), b.size())); a.resize(n); b.resize(n); subset_fzt(a); subset_fzt(b); for (int i = 0; i < n; ++i) a[i] *= b[i]; subset_fmt(a); return a; } #line 7 "test/yosupo/bitwise_and_convolution.test.cpp" using namespace std; using ll = long long; using mint = Modint<998244353>; int main() { int N; cin >> N; vector<mint> a(1 << N), b(1 << N); for (auto& x : a) cin >> x; for (auto& x : b) cin >> x; auto c = and_convolution(a, b); for (int i = 0; i < (1 << N); ++i) cout << c[i] << (i < (1 << N) - 1 ? " " : "\n"); }