BZOJ 2194: 快速傅立叶之二

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

分析

fft模板 不解释

代码

#include <bits/stdc++.h>

using namespace std;

#define N 262144
#define pi acos(-1)
#define ll long long

typedef complex<double> E;

int n,m,L;
int R[N];
E a[N],b[N];

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

void fft(E *a,int f)
{
    for (int i = 0; i < n; i++)
        if (i < R[i])
            swap(a[i],a[R[i]]);
    for (int i = 1; i < n; i<<=1)
    {
        E wn(cos(pi / i),f * sin(pi / i));
        for (int j = 0; j < n; j += (i << 1))
        {
            E w(1,0);
            for (int k = 0; k < i; k++, w *= wn)
            {
                E x = a[j + k],y = w * a[j + k + i];
                a[j + k] = x + y;
                a[j + k + i] = x - y;
            }
        }
    }
    if (f == -1)
        for (int i = 0; i < n; i++)
            a[i] /= n;
}

int main()
{
    n = read();
    n--;
    for (int i = 0; i <= n; i++)
    {
        a[i] = read();
        b[n - i] = read();
    }
    m = 2 * n;
    for (n = 1; n <= m; n <<= 1)
        L++;
    for (int i = 0; i < n; i++)
        R[i] = (R[i >> 1] >> 1) | ((i & 1) << (L - 1));
    fft(a,1);
    fft(b,1);
    for (int i = 0; i <= n; i++)
        a[i] *= b[i];
    fft(a,-1);
    for (int i = m / 2; i <= m; i++)
        printf("%d\n",(int)(a[i].real() + 0.1));
}