洛谷-3803 【模板】多项式乘法（FFT,NNT）

题目描述
给定一个n次多项式F(x)，和一个m次多项式G(x)。
请求出F(x)和G(x)的卷积。
输入输出格式
输入格式：
第一行2个正整数n,m。
接下来一行n+1个数字，从低到高表示F(x)的系数。
接下来一行m+1个数字，从低到高表示G(x))的系数。
输出格式：
一行n+m+1个数字，从低到高表示F(x)∗G(x)的系数。

输入输出样例
输入样例#1：
1 2
1 2
1 2 1

输出样例#1：
1 4 5 2

说明
保证输入中的系数大于等于 0 且小于等于9。
对于100%的数据： n,m≤10⁶
数据有一定梯度。
空间限制：256MB

//FFT
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<string>
#include<cmath>
#include<vector>
using namespace std;
int n, m;
const double Pi = acos(-1.0);
struct complex{
    double x,y;
    complex (double xx=0,double yy=0){x=xx,y=yy;}
};
complex operator + (complex a,complex b){ return complex(a.x+b.x , a.y+b.y);}
complex operator - (complex a,complex b){ return complex(a.x-b.x , a.y-b.y);}
complex operator * (complex a,complex b){ return complex(a.x*b.x-a.y*b.y , a.x*b.y+a.y*b.x);}
vector<complex>a, b;
inline int getnum(){
    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 get_read(){
    n = getnum(); m = getnum();
    for (int i = 0; i <= n; ++i) a.push_back(complex(getnum(), 0));
    for (int i = 0; i <= m; ++i) b.push_back(complex(getnum(), 0));
}
void fft(int limit, vector<complex>&a, int type){
    if (limit == 1) return;
    vector<complex>a1, a2;
    a1.clear(); a2.clear();
    for (int i = 0; i <= limit; i += 2)
        a1.push_back(a[i]), a2.push_back(a[i + 1]);
    fft(limit >> 1, a1, type);
    fft(limit >> 1, a2, type);
    complex Wn = complex(cos(2.0 * Pi / limit), type * sin(2.0 * Pi / limit)), w = complex(1, 0);
    for (int i = 0; i < (limit >> 1); ++i, w = w * Wn) {
        a[i] = a1[i] + w * a2[i];
        a[i + (limit >> 1)] = a1[i] - w * a2[i];
    }
    a1.clear(); a2.clear();
}
void get_work(){
    int limit = 1;
    while (limit <= n + m) limit <<= 1;
    for (int i = n + 1; i <= limit; ++i) a.push_back(complex(0, 0));
    fft(limit, a, 1);
    for (int i = m + 1; i <= limit; ++i) b.push_back(complex(0, 0));
    fft(limit, b, 1);
    for (int i = 0; i <= limit; ++i) a[i] = a[i] * b[i];
    fft(limit, a, -1);
    for (int i = 0; i <= n + m; ++i) printf("%d ", (int)(a[i].x / limit + 0.5));
}
int main(){
    //freopen("/home/wxy/Desktop/testdata-1.in", "r", stdin);
    get_read();
    get_work();
    return 0;
}

//NNT
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#define ll long long
const int maxm=3e6+100,mod=998244353,g=3,gi=332748118;
inline ll fastpow(ll x,int y){
    ll ans=1;
    for(;y;y>>=1,x=(x*x)%mod)
     if(y&1) ans=(ans*x)%mod;
    return ans%mod;
} 
int n,m,len;
ll inv,A[maxm],B[maxm],rev[maxm];
inline void NTT(ll *a,int f){
    for(int i=0;i<n;i++) if(i<rev[i]) std::swap(a[i],a[rev[i]]);
    for(int i=1;i<n;i<<=1){
        ll wn=fastpow((f==1)?g:gi,(mod-1)/(i<<1));
        for(int j=0;j<n;j+=(i<<1)){
            ll w=1;
            for(int k=0;k<i;k++,w=(w*wn)%mod){
                ll x=a[j+k],y=(w*a[i+j+k])%mod;
                a[j+k]=(x+y)%mod;
                a[i+j+k]=(x-y+mod)%mod;
            }
        }
    }
    if(f==-1)
     for(int i=0;i<n;i++) a[i]=(a[i]*inv)%mod;
}
int main(){
    scanf("%d%d",&n,&m);
    for(int i=0;i<=n;i++) scanf("%lld",&A[i]),A[i]=(A[i]+mod)%mod;
    for(int i=0;i<=m;i++) scanf("%lld",&B[i]),B[i]=(B[i]+mod)%mod;
    m+=n;
    for(n=1;n<=m;n<<=1) len++;
    inv=fastpow(n,mod-2);
    for(int i=0;i<n;i++) rev[i]=(rev[i>>1]>>1)|((i&1)<<(len-1));
    NTT(A,1),NTT(B,1);
    for(int i=0;i<n;i++) A[i]=(A[i]*B[i]+mod)%mod;
    NTT(A,-1);
    for(int i=0;i<=m;i++) printf("%lld ",A[i]);
    return 0;
}