HDU 6057：Kanade's convolution fwt子集卷积

设x=i xor j,y=ior j

 i and j=y-x

考虑枚举x,y，有限制条件x and y = x

满足y – x = k且x and y = x的(i,j)有2^bit(x)个

把a中所有的bit(i)=x的单独拿出来

把b中所有的bit(j)=y的单独拿出来
然后跑一次fwt求异或卷积
卷积后的数列中bit(k)=x+y的即是答案

fwt预处理a数组  n^2 2^n

fwt预处理b数组  n^2 2^n

枚举x,y卷积 n^2 2^n

ufwt还原答案 n^2 2^n

总复杂度 n^2 2^n

#include<cmath>
#include<ctime>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<string>
#include<bitset>
#include<queue>
#include<set>
#include<map>
using namespace std;

typedef double db;
typedef long long ll;

inline int read()
{
	int x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch<='9'&&ch>='0'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}
void print(int x)
{if(x<0)putchar('-'),x=-x;if(x>=10)print(x/10);putchar(x%10+'0');}

const int N=2000100,mod=998244353,bas=1526;

int n,m,inv;

inline int Bit(int x)
{
	int res=0;
	while(x) res+=(x&1),x>>=1;
	return res;
}

inline int qpow(int x,int y)
{
	int res=1;
	while(y)
	{
		if(y&1) res=1ll*res*x%mod;
		x=1ll*x*x%mod;
		y>>=1;
	}
	return res;
}

void fwt(int len,int *a)
{
	register int i,j,k,x,y;
	for(k=1;k<len;k<<=1)
		for(i=0;i<len;i+=(k<<1))
			for(j=0;j<k;++j)
			{
				x=a[i+j],y=a[i+j+k];
				a[i+j]=(x+y)%mod;
				a[i+j+k]=((x-y)%mod+mod)%mod;
			}
}

void ufwt(int len,int *a)
{
	register int i,j,k,x,y;
	for(k=1;k<len;k<<=1)
		for(i=0;i<len;i+=(k<<1))
			for(j=0;j<k;++j)
			{
				x=a[i+j],y=a[i+j+k];
				a[i+j]=1ll*(x+y)*inv%mod;
				a[i+j+k]=(1ll*(x-y)*inv%mod+mod)%mod;
			}
}

int a[N],b[N],c[N],bit[N];
int A[20][N],B[20][N],C[20][N];

int main()
{
	m=read();
	n=1<<m;
	register int i,j,k;
	for(i=0;i<n;++i) a[i]=read();
	for(i=0;i<n;++i) b[i]=read();
	for(i=0;i<n;++i) bit[i]=Bit(i);
	for(i=0;i<n;++i)
	{
		A[bit[i]][i]=1ll*a[i]*(1<<bit[i])%mod;
		B[bit[i]][i]=b[i];
	}
	inv=qpow(2,mod-2);
	for(i=0;i<=m;++i)
		fwt(n,A[i]),fwt(n,B[i]);
	for(i=0;i<=m;++i)
		for(j=0;j<=i;++j)
			for(k=0;k<n;++k)
				(C[j][k]+=1ll*A[i-j][k]*B[i][k]%mod)%=mod;
	for(i=0;i<=m;++i)
		ufwt(n,C[i]);
	for(i=0;i<n;++i)
		c[i]=C[bit[i]][i];
	int now=1,ans=0;
	for(i=0;i<n;++i)
		ans=(ans+1ll*c[i]*now%mod)%mod,
		now=1ll*now*bas%mod;
	cout<<ans<<endl;
	return 0;
}