2194: 快速傅立叶之二

2194: 快速傅立叶之二

Time Limit: 10 Sec   Memory Limit: 259 MB
Submit: 1078   Solved: 619
[ Submit][ Status][ Discuss]

Description

请计算C[k]=sigma(a[i]*b[i-k]) 其中 k < = i < n ，并且有 n < = 10 ^ 5。 a,b中的元素均为小于等于100的非负整数。

Input

第一行一个整数N,接下来N行，第i+2..i+N-1行，每行两个数，依次表示a[i],b[i] (0 < = i < N)。

Output

输出N行，每行一个整数，第i行输出C[i-1]。

Sample Input

5
3 1
2 4
1 1
2 4
1 4

Sample Output

24
12
10
6
1

HINT

Source

[ Submit][ Status][ Discuss]



把b数列整个翻转，就能构造出卷积的形式了，

然后上个NTT解决。。。写这题主要是复习算法啦= =

#include<iostream>
#include<cstring>
#include<vector>
#include<queue>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<bitset>
using namespace std;

const int maxn = (1<<19);
typedef long long LL;
const LL P = 1004535809;
const LL g = 3;

int n,N = 1;
LL A[maxn],B[maxn],C[maxn],w[maxn];

LL ksm(LL x,int y)
{
	int ret = 1;
	for (; y; y >>= 1)
	{
		if (y&1) ret = ret*x%P;
		x = x*x%P;
	}
	return ret;
}

void Rader(LL *F)
{
	int j = (N >> 1);
	for (int i = 1; i < N - 1; i++)
	{
		if (i < j) swap(F[i],F[j]);
		int k = (N >> 1);
		while (j >= k) j -= k,k >>= 1;
		j += k;
	}
}

void NTT(LL *F,int on)
{
	Rader(F);
	for (int h = 2; h <= N; h <<= 1)
		for (int k = 0; k < N; k += h)
		{
			int t = 0;
			for (int i = k; i < k + (h>>1); i++)
			{
				int j = i + (h>>1);
				LL u = F[i],v = w[t]*F[j]%P;
				F[i] = (u + v) % P;
				F[j] = (u - v + P) % P;
				t += N / h;
			}
		}
	if (on == -1)
	{
		LL inv = ksm(N,P - 2);
		for (int i = 0; i < N; i++)
			F[i] = F[i]*inv%P;
	}
}

int main()
{
	#ifdef DMC
		freopen("DMC.txt","r",stdin);
	#endif
	
	cin >> n; while (N < n) N <<= 1;
	for (int i = 0; i < n; i++) scanf("%lld%lld",&A[i],&B[i]);
	for (int i = 0; i < N / 2; i++) swap(B[i],B[N - i - 1]); N <<= 1;
	w[0] = w[N] = 1; w[1] = ksm(g,(P - 1) / N); 
	for (int i = 2; i < N; i++) w[i] = w[i-1]*w[1]%P;
	NTT(A,1); NTT(B,1);
	for (int i = 0; i < N; i++) C[i] = A[i]*B[i]%P;
	for (int i = 0; i < N / 2; i++) swap(w[i],w[N - i]);
	NTT(C,-1); N >>= 1;
	for (int i = 0; i < n; i++) printf("%lld\n",C[N + i - 1]);
	return 0;
}