题目
https://www.luogu.com.cn/problem/P4717
就是给两个序列,分别求它们的 或、与、异或 卷积
学习自这里 https://www.luogu.com.cn/blog/xht37/solution-p4717
分析
FWT 分治
总体时间复杂度 O(n lgn)
具体见博客里的FWT笔记
代码
#include <bits/stdc++.h>
using namespace std;
const long long Ha=998244353;
const int MAXN=1<<18;
int n,m;
long long a[MAXN],b[MAXN];
long long A[MAXN],B[MAXN];
//要求 n 是 2 的次幂
//x=1: FWT x=-1: IFWT
void OR(long long *f, const long long x)
{
for (int o=2,k=1; o<=n; o<<=1,k<<=1)
for (int i=0; i<n; i+=o)
for (int j=0; j<k; j++) {
f[i+j+k]+=f[i+j]*x;
f[i+j+k]%=Ha;
}
}
//x=1: FWT x=-1: IFWT
void AND(long long *f, const long long x)
{
for (int o=2,k=1; o<=n; o<<=1,k<<=1)
for (int i=0; i<n; i+=o)
for (int j=0; j<k; j++) {
f[i+j]+=f[i+j+k]*x;
f[i+j]%=Ha;
}
}
//x=1: FWT x=1/2: IFWT
void XOR(long long *f, const long long x)
{
for (int o=2,k=1; o<=n; o<<=1,k<<=1)
for (int i=0; i<n; i+=o)
for (int j=0; j<k; j++) {
f[i+j]= (f[i+j]+f[i+j+k]) %Ha;
f[i+j+k]= (f[i+j]-f[i+j+k]-f[i+j+k]) %Ha;
f[i+j]= (f[i+j]*x) %Ha;
f[i+j+k]= (f[i+j+k]*x) %Ha;
}
}
int main()
{
scanf("%d",&m);
n=1<<m;
for (int i=0; i<n; i++) scanf("%lld",&a[i]);
for (int i=0; i<n; i++) scanf("%lld",&b[i]);
//OR
for (int i=0; i<n; i++) A[i]=a[i],B[i]=b[i];
OR(A,1), OR(B,1); //FWT
for (int i=0; i<n; i++) A[i]=(A[i]*B[i])%Ha;
OR(A,Ha-1); //IFWT
for (int i=0; i<n; i++) printf("%lld ",(A[i]%Ha+Ha)%Ha);
puts("");
//AND
for (int i=0; i<n; i++) A[i]=a[i],B[i]=b[i];
AND(A,1), AND(B,1);
for (int i=0; i<n; i++) A[i]=(A[i]*B[i])%Ha;
AND(A,Ha-1);
for (int i=0; i<n; i++) printf("%lld ",(A[i]%Ha+Ha)%Ha);
puts("");
//XOR
for (int i=0; i<n; i++) A[i]=a[i],B[i]=b[i];
XOR(A,1), XOR(B,1);
for (int i=0; i<n; i++) A[i]=(A[i]*B[i])%Ha;
XOR(A,(Ha+1)>>1);
for (int i=0; i<n; i++) printf("%lld ",(A[i]%Ha+Ha)%Ha);
puts("");
return 0;
}
/*
2
2 4 6 8
1 3 5 7
*/