FWT （快速沃尔什变换）

前言

自己学懂就行了，博客以后看心情补吧。

想学的可以看大佬博客。

Code：

LL t[MAXN], A[MAXN], B[MAXN], c[MAXN];

void DWT_Or(LL l,LL r)
{
	if (l == r)
		return ;
	LL Mid = (l + r) / 2;
	for (Int i = l; i <= Mid; ++ i)
		t[i - l + Mid + 1] = (t[i] + t[i - l + Mid + 1]) % Mod;
	DWT_Or(l, Mid);
	DWT_Or(Mid + 1, r); 
}
void IDWT_Or(LL l,LL r)
{
	if (l == r)
		return ;
	LL Mid = (l + r) / 2;
	IDWT_Or(l, Mid);
	IDWT_Or(Mid + 1, r);
	for (Int i = l; i <= Mid; ++ i)
		t[i - l + Mid + 1] = (t[i - l + Mid + 1] - t[i] + Mod) % Mod;
}

void DWT_And(LL l,LL r)
{
	if (l == r)
		return ;
	LL Mid = (l + r) / 2;
	for (Int i = l; i <= Mid; ++ i)
		t[i] = (t[i] + t[i - l + Mid + 1]) % Mod;
	DWT_And(l, Mid);
	DWT_And(Mid + 1, r); 
}
void IDWT_And(LL l,LL r)
{
	if (l == r)
		return ;
	LL Mid = (l + r) / 2;
	IDWT_And(l, Mid);
	IDWT_And(Mid + 1, r);
	for (Int i = l; i <= Mid; ++ i)
		t[i] = (t[i] - t[i - l + Mid + 1] + Mod) % Mod;
}

void DWT_Xor(LL l,LL r)
{
	if (l == r)
		return ;
	LL Mid = (l + r) / 2;
	for (Int i = l; i <= Mid; ++ i)
		t[i] = (t[i] + t[i - l + Mid + 1]) % Mod,
		t[i - l + Mid + 1] = (t[i] - t[i - l + Mid + 1] - t[i - l + Mid + 1] + Mod + Mod) % Mod;
	DWT_Xor(l, Mid);
	DWT_Xor(Mid + 1, r);
}
void IDWT_Xor(LL l,LL r)
{
	if (l == r)
		return ;
	LL Mid = (l + r) / 2;
	IDWT_Xor(l, Mid);
	IDWT_Xor(Mid + 1, r);
	LL t0, t1;
	for (Int i = l; i <= Mid; ++ i)
	{
		t0 = t[i], t1 = t[i - l + Mid + 1];
		t[i] = ((t0 + t1) * Inv) % Mod;
		t[i - l + Mid + 1] = ((t0 - t1 + Mod) * Inv) % Mod;
	}
}
LL n, m;

void Prin()
{
	for (Int i = 0; i < n; ++ i)
		printf("%lld ", t[i]);
	putchar('\n');
}
int main()
{
	read( m );
	n = (1ll << m);
	for (Int i = 0; i < n; ++ i)
		read( A[i] ), t[i] = A[i];
	for (Int i = 0; i < n; ++ i)
		read( B[i] );
	DWT_Or(0, n - 1);
	for (Int i = 0; i < n; ++ i)
		c[i] = t[i], t[i] = B[i];
	DWT_Or(0, n - 1);
	for (Int i = 0; i < n; ++ i)
		t[i] = (t[i] * c[i]) % Mod;
	IDWT_Or(0, n - 1);
	Prin();
	
	for (Int i = 0; i < n; ++ i)
		t[i] = A[i];
	DWT_And(0, n - 1);
	for (Int i = 0; i < n; ++ i)
		c[i] = t[i], t[i] = B[i];
	DWT_And(0, n - 1);
	for (Int i = 0; i < n; ++ i)
		t[i] = (t[i] * c[i]) % Mod;
	IDWT_And(0, n - 1);
	Prin();
	
	for (Int i = 0; i < n; ++ i)
		t[i] = A[i];
	DWT_Xor(0, n - 1);
	for (Int i = 0; i < n; ++ i)
		c[i] = t[i], t[i] = B[i];
	DWT_Xor(0, n - 1);
	for (Int i = 0; i < n; ++ i)
		t[i] = (t[i] * c[i]) % Mod;
	IDWT_Xor(0, n - 1);
	Prin();