verify/yosupo/convolution/or-convolution/bitwise_and_convolution.test.cpp
Depends on
Code
#define PROBLEM "https://judge.yosupo.jp/problem/bitwise_and_convolution"
#include "template.hpp"
#include "modular-arithmetic/modint.hpp"
#include "convolution/or-convolution.hpp"
using mint = mint998;
int main(){
cin.tie(nullptr)->sync_with_stdio(false);
int n;
cin >> n;
n=1<<n;
vector<mint> a(n),b(n);
for(auto &x:a)cin >> x;
for(auto &x:b)cin >> x;
reverse(a.begin(),a.end());
reverse(b.begin(),b.end());
auto c=or_convolution(a,b);
reverse(c.begin(),c.end());
for(auto x:c)cout << x << " ";
}
#line 1 "verify/yosupo/convolution/or-convolution/bitwise_and_convolution.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/bitwise_and_convolution"
#line 2 "template.hpp"
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using db = long double;
using i128 = __int128_t;
using u32 = uint32_t;
using u64 = uint64_t;
template<class T>
using PQ = priority_queue<T,vector<T>,greater<T>>;
const int INF=INT_MAX/2;
const ll LINF=LLONG_MAX/4;
const db DINF=numeric_limits<db>::infinity();
const db EPS=1e-9;
const db PI=acos(db(-1));
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define SZ(a) (int)(a.size())
#define SORT(a) sort(ALL(a))
#define RSORT(a) sort(RALL(a))
#define REV(a) reverse(ALL(a))
#define UNI(a) a.erase(unique(ALL(a)),a.end())
#define LB(a,x) (int)(lower_bound(ALL(a),x)-a.begin())
#define UB(a,x) (int)(upper_bound(ALL(a),x)-a.begin())
#define FIND(a,x) (int)(find(ALL(a),x)-a.begin())
#define COUNT(a,x) (int)count(ALL(a),x)
#define MIN(a) *min_element(ALL(a))
#define MAX(a) *max_element(ALL(a))
template<class T,class U>
bool chmin(T &a,U b){return b<a?a=b,1:0;}
template<class T,class U>
bool chmax(T &a,U b){return a<b?a=b,1:0;}
template<class T>
T floor(T a,T b){return a/b-((a^b)<0&&a%b);}
template<class T>
T ceil(T a,T b){return a/b+((a^b)>=0&&a%b);}
int popcnt(ll x){return __builtin_popcountll(x);}
int topbit(ll x){return x==0?-1:63-__builtin_clzll(x);}
int lowbit(ll x){return x==0?-1:__builtin_ctzll(x);}
template<class T,class U>
T SUM(const U &a){return accumulate(ALL(a),T{});}
template<class T>
vector<int> argsort(const vector<T> &a){
vector<int> p(SZ(a));
iota(ALL(p),0);
stable_sort(ALL(p),[&](int i,int j){return a[i]<a[j];});
return p;
}
template<class T,size_t D=0>
struct VecBuilder{
array<size_t,D> d;
VecBuilder<T,D+1> operator[](size_t n)const{
VecBuilder<T,D+1> res{};
for(size_t i=0;i<D;i++)res.d[i]=d[i];
res.d[D]=n;
return res;
}
template<size_t I=0>
auto build(const T &x)const{
if constexpr(I+1==D)return vector<T>(d[I],x);
else return vector<decltype(build<I+1>(x))>(d[I],build<I+1>(x));
}
auto operator()(const T &x=T())const{
static_assert(D>0);
return build(x);
}
};
template<class T>
inline constexpr VecBuilder<T> VEC{};
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::steady_clock::now().time_since_epoch().count());
#line 2 "modular-arithmetic/modint.hpp"
/**
* Author: Teetat T.
* Date: 2026-04-15
* Description: modular arithmetic operations
*/
template<int mod,int root=0>
struct ModInt{
using mint = ModInt;
static_assert(mod>0,"mod must be positive");
int x;
constexpr ModInt():x(0){}
constexpr ModInt(ll x):x((x%=mod)<0?x+mod:x){}
constexpr explicit operator int()const{return x;}
constexpr int val()const{return x;}
constexpr static int get_mod(){return mod;}
constexpr static mint get_root(){return mint(root);}
constexpr mint operator-()const{
mint res;
res.x=x?mod-x:0;
return res;
}
constexpr mint operator+()const{return *this;}
constexpr mint inv()const{
int a=x,b=mod,u=1,v=0,q=0;
while(b>0){
q=a/b;
swap(a-=q*b,b);
swap(u-=q*v,v);
}
return mint(u);
}
constexpr mint pow(ll n)const{
mint res=1,a=*this;
for(;n>0;a*=a,n>>=1)if(n&1)res*=a;
return res;
}
constexpr mint &operator+=(const mint &o){
if((x+=o.x)>=mod)x-=mod;
return *this;
}
constexpr mint &operator-=(const mint &o){
if((x-=o.x)<0)x+=mod;
return *this;
}
constexpr mint &operator*=(const mint &o){
x=(ll(x)*o.x)%mod;
return *this;
}
constexpr mint &operator/=(const mint &o){
return *this*=o.inv();
}
constexpr mint operator+(const mint &o)const{return mint(*this)+=o;}
constexpr mint operator-(const mint &o)const{return mint(*this)-=o;}
constexpr mint operator*(const mint &o)const{return mint(*this)*=o;}
constexpr mint operator/(const mint &o)const{return mint(*this)/=o;}
constexpr mint &operator++(){return *this+=mint(1);}
constexpr mint &operator--(){return *this-=mint(1);}
constexpr mint operator++(int){mint res=*this;*this+=mint(1);return res;}
constexpr mint operator--(int){mint res=*this;*this-=mint(1);return res;}
constexpr bool operator==(const mint &o)const{return x==o.x;}
constexpr bool operator!=(const mint &o)const{return x!=o.x;}
constexpr bool operator<(const mint &o)const{return x<o.x;}
friend istream &operator>>(istream &is,mint &o){ll x{};is>>x;o=mint(x);return is;}
friend ostream &operator<<(ostream &os,const mint &o){return os<<o.x;}
};
using mint998 = ModInt<998244353,3>;
using mint107 = ModInt<1000000007>;
#line 2 "convolution/or-convolution.hpp"
/**
* Author: Teetat T.
* Date: 2024-07-29
* Description: Bitwise OR Convolution.
* Subset Zeta Transform: $A^\prime[S]=\sum_{T\subseteq S}A[T]$.
* Subset Mobius Transform: $A[T]=\sum_{S\subseteq T}(-1)^{|T-S|}A^\prime[S]$.
* Time: $O(N\log N)$.
*/
template<class T>
void subset_zeta(vector<T> &a){
int n=(int)a.size();
assert(n==(n&-n));
for(int i=1;i<n;i<<=1){
for(int j=0;j<n;j++){
if(j&i){
a[j]+=a[j^i];
}
}
}
}
template<class T>
void subset_mobius(vector<T> &a){
int n=(int)a.size();
assert(n==(n&-n));
for(int i=n;i>>=1;){
for(int j=0;j<n;j++){
if(j&i){
a[j]-=a[j^i];
}
}
}
}
template<class T>
vector<T> or_convolution(vector<T> a,vector<T> b){
subset_zeta(a);
subset_zeta(b);
for(int i=0;i<(int)a.size();i++)a[i]*=b[i];
subset_mobius(a);
return a;
}
#line 5 "verify/yosupo/convolution/or-convolution/bitwise_and_convolution.test.cpp"
using mint = mint998;
int main(){
cin.tie(nullptr)->sync_with_stdio(false);
int n;
cin >> n;
n=1<<n;
vector<mint> a(n),b(n);
for(auto &x:a)cin >> x;
for(auto &x:b)cin >> x;
reverse(a.begin(),a.end());
reverse(b.begin(),b.end());
auto c=or_convolution(a,b);
reverse(c.begin(),c.end());
for(auto x:c)cout << x << " ";
}
Back to top page