This documentation is automatically generated by online-judge-tools/verification-helper
View the Project on GitHub ebi-fly13/Library
#define PROBLEM "https://judge.yosupo.jp/problem/bitwise_and_convolution" #include <iostream> #include <vector> #include "../../convolution/and_convolution.hpp" #include "../../modint/modint.hpp" using mint = ebi::modint998244353; int main() { int n; std::cin >> n; std::vector<mint> a(1 << n), b(1 << n); for (int i = 0; i < (1 << n); i++) { int x; std::cin >> x; a[i] = x; } for (int i = 0; i < (1 << n); i++) { int x; std::cin >> x; b[i] = x; } auto c = ebi::and_convolution(a, b); for (int i = 0; i < (1 << n); i++) { std::cout << c[i].val() << " \n"[i == (1 << n) - 1]; } }
#line 1 "test/convolution/Bitwise_And_Convolution.test.cpp" #define PROBLEM "https://judge.yosupo.jp/problem/bitwise_and_convolution" #include <iostream> #include <vector> #line 2 "convolution/and_convolution.hpp" #line 4 "convolution/and_convolution.hpp" #line 2 "set_function/superset_transform.hpp" #include <bit> #include <cassert> #line 6 "set_function/superset_transform.hpp" namespace ebi { template <class T> std::vector<T> superset_zeta(const std::vector<T> &a) { int n = std::bit_width(a.size()) - 1; assert((1 << n) == (int)a.size()); std::vector<T> ra = a; for (int i = 0; i < n; i++) { int w = 1 << i; for (int p = 0; p < (1 << n); p += 2 * w) { for (int s = p; s < p + w; s++) { int t = s | w; ra[s] += ra[t]; } } } return ra; } template <class T> std::vector<T> superset_mobius(const std::vector<T> &ra) { int n = std::bit_width(ra.size()) - 1; assert((1 << n) == (int)ra.size()); std::vector<T> a = ra; for (int i = 0; i < n; i++) { int w = 1 << i; for (int p = 0; p < (1 << n); p += 2 * w) { for (int s = p; s < p + w; s++) { int t = s | w; a[s] -= a[t]; } } } return a; } } // namespace ebi #line 6 "convolution/and_convolution.hpp" namespace ebi { template <class T> std::vector<T> and_convolution(const std::vector<T> &a, const std::vector<T> &b) { int n = a.size(); auto ra = superset_zeta(a); auto rb = superset_zeta(b); for (int i = 0; i < n; i++) { ra[i] *= rb[i]; } return superset_mobius(ra); } } // namespace ebi #line 2 "modint/modint.hpp" #line 5 "modint/modint.hpp" #line 2 "modint/base.hpp" #include <concepts> #line 5 "modint/base.hpp" #include <utility> namespace ebi { template <class T> concept Modint = requires(T a, T b) { a + b; a - b; a * b; a / b; a.inv(); a.val(); a.pow(std::declval<long long>()); T::mod(); }; template <Modint mint> std::istream &operator>>(std::istream &os, mint &a) { long long x; os >> x; a = x; return os; } template <Modint mint> std::ostream &operator<<(std::ostream &os, const mint &a) { return os << a.val(); } } // namespace ebi #line 7 "modint/modint.hpp" namespace ebi { template <int m> struct static_modint { private: using modint = static_modint; public: static constexpr int mod() { return m; } static constexpr modint raw(int v) { modint x; x._v = v; return x; } constexpr static_modint() : _v(0) {} constexpr static_modint(long long v) { v %= (long long)umod(); if (v < 0) v += (long long)umod(); _v = (unsigned int)v; } constexpr unsigned int val() const { return _v; } constexpr unsigned int value() const { return val(); } constexpr modint &operator++() { _v++; if (_v == umod()) _v = 0; return *this; } constexpr modint &operator--() { if (_v == 0) _v = umod(); _v--; return *this; } constexpr modint operator++(int) { modint res = *this; ++*this; return res; } constexpr modint operator--(int) { modint res = *this; --*this; return res; } constexpr modint &operator+=(const modint &rhs) { _v += rhs._v; if (_v >= umod()) _v -= umod(); return *this; } constexpr modint &operator-=(const modint &rhs) { _v -= rhs._v; if (_v >= umod()) _v += umod(); return *this; } constexpr modint &operator*=(const modint &rhs) { unsigned long long x = _v; x *= rhs._v; _v = (unsigned int)(x % (unsigned long long)umod()); return *this; } constexpr modint &operator/=(const modint &rhs) { return *this = *this * rhs.inv(); } constexpr modint operator+() const { return *this; } constexpr modint operator-() const { return modint() - *this; } constexpr modint pow(long long n) const { assert(0 <= n); modint x = *this, res = 1; while (n) { if (n & 1) res *= x; x *= x; n >>= 1; } return res; } constexpr modint inv() const { assert(_v); return pow(umod() - 2); } friend modint operator+(const modint &lhs, const modint &rhs) { return modint(lhs) += rhs; } friend modint operator-(const modint &lhs, const modint &rhs) { return modint(lhs) -= rhs; } friend modint operator*(const modint &lhs, const modint &rhs) { return modint(lhs) *= rhs; } friend modint operator/(const modint &lhs, const modint &rhs) { return modint(lhs) /= rhs; } friend bool operator==(const modint &lhs, const modint &rhs) { return lhs.val() == rhs.val(); } friend bool operator!=(const modint &lhs, const modint &rhs) { return !(lhs == rhs); } private: unsigned int _v = 0; static constexpr unsigned int umod() { return m; } }; using modint998244353 = static_modint<998244353>; using modint1000000007 = static_modint<1000000007>; } // namespace ebi #line 8 "test/convolution/Bitwise_And_Convolution.test.cpp" using mint = ebi::modint998244353; int main() { int n; std::cin >> n; std::vector<mint> a(1 << n), b(1 << n); for (int i = 0; i < (1 << n); i++) { int x; std::cin >> x; a[i] = x; } for (int i = 0; i < (1 << n); i++) { int x; std::cin >> x; b[i] = x; } auto c = ebi::and_convolution(a, b); for (int i = 0; i < (1 << n); i++) { std::cout << c[i].val() << " \n"[i == (1 << n) - 1]; } }