牛客多校九-A题(fwt)

链接：https://www.nowcoder.com/acm/contest/147/A
来源：牛客网
 

Niuniu has recently learned how to use Gaussian elimination to solve systems of linear equations.

Given n and a[i], where n is a power of 2, let's consider an n x n matrix A.

The index of A[i][j] and a[i] are numbered from 0.
The element A[i][j] satisfies A[i][j] = a[i xor j],
https://en.wikipedia.org/wiki/Bitwise_operation#XOR

 

Let p = 1000000007.

Consider the equation 
A x = b (mod p)
where A is an n x n matrix, and x and b are both n x 1 row vector.

Given n, a[i], b[i], you need to solve the x.
For example, when n = 4, the equations look like
A[0][0]*x[0] + A[0][1]*x[1] + A[0][2]*x[2] + A[0][3]*x[3] = b[0] (mod p)
A[1][0]*x[0] + A[1][1]*x[1] + A[1][2]*x[2] + A[1][3]*x[3] = b[1] (mod p)
A[2][0]*x[0] + A[2][1]*x[1] + A[2][2]*x[2] + A[2][3]*x[3] = b[2] (mod p)
A[3][0]*x[0] + A[3][1]*x[1] + A[3][2]*x[2] + A[3][3]*x[3] = b[3] (mod p)
and the matrix A can be decided by the array a.

It is guaranteed that there is a unique solution x for these equations.

输入描述:

The first line contains an integer, which is n.
The second line contains n integers, which are the array a.
The third line contains n integers, which are the array b.

1 <= n <= 262144
p = 1000000007
0 <= a[i] < p
0 <= b[i] < p

输出描述:

The output should contains n lines.
The i-th(index from 0) line should contain x[i].
x[i] is an integer, and should satisfy 0 <= x[i] < p.

 

示例1

输入

复制

4
1 10 100 1000
1234 2143 3412 4321

输出

复制

4
3
2
1

思路：观察给出的方程我们可以化为

根据异或的性质，i^j=k ->  i^k=j,那么方程可化为

然后就可以套fwt模板了。

#include <bits/stdc++.h>
using namespace std; 
typedef long long ll;
const ll mod=1000000007;

ll quick(ll a,ll b,ll mod)
{
	ll ans=1;
	while(b)
	{
		if(b&1) ans=ans*a%mod;
		a=a*a%mod;
		b>>=1;
	}
	return ans;
}


void FWT_xor(ll *a,ll N,ll opt)
{
	ll inv2=quick(2,mod-2,mod);
    for(ll i=1;i<N;i<<=1)
        for(ll p=i<<1,j=0;j<N;j+=p)
            for(ll k=0;k<i;++k)
            {
                ll X=a[j+k],Y=a[i+j+k];
                a[j+k]=(X+Y)%mod;a[i+j+k]=(X+mod-Y)%mod;
                if(opt==-1)a[j+k]=1ll*a[j+k]*inv2%mod,a[i+j+k]=1ll*a[i+j+k]*inv2%mod;
            }
}

ll n;
ll a[1<<19],b[1<<19],c[1<<19];
int main()
{
	cin>>n;	 
	for(ll i=0;i<n;i++) cin>>a[i];
	for(ll i=0;i<n;i++) cin>>b[i];
	
	memcpy(c,a,sizeof(a));
	FWT_xor(a,n,1);			
	FWT_xor(b,n,1);			 
	for(ll i=0;i<n;i++) 
	c[i]=((ll)b[i]*quick(a[i],mod-2,mod))%mod;
	
	FWT_xor(c,n,-1);
	for(ll i=0;i<n;i++) printf("%d\n",c[i]);
	
	return 0;
}