hihocoder #1388 : Periodic Signal NTT&FFT

传送门：hihocoder #1388 : Periodic Signal

先来几个大牛传送门：  (模板) NTT long long 版

解法一：因为我们知道FFT会精度不够，所以坚持用NTT，但是模数不够大，然后就一直GG，看来我们的搜索姿势也有问题，居然没有搜到上面大神的板子，真的是GG

http://www.cnblogs.com/WABoss/p/5903927.html

/**************************************************************
    Problem:
    User: youmi
    Language: C++
    Result: Accepted
    Time:
    Memory:
****************************************************************/
//#pragma comment(linker, "/STACK:1024000000,1024000000")
//#include<bits/stdc++.h>
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <cmath>
#include <queue>
#include <deque>
#include <string>
#include <vector>
#define zeros(a) memset(a,0,sizeof(a))
#define ones(a) memset(a,-1,sizeof(a))
#define sc(a) scanf("%d",&a)
#define sc2(a,b) scanf("%d%d",&a,&b)
#define sc3(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define scs(a) scanf("%s",a)
#define sclld(a) scanf("%I64d",&a)
#define pt(a) printf("%d\n",a)
#define ptlld(a) printf("%I64d\n",a)
#define rep(i,from,to) for(int i=from;i<=to;i++)
#define irep(i,to,from) for(int i=to;i>=from;i--)
#define Max(a,b) ((a)>(b)?(a):(b))
#define Min(a,b) ((a)<(b)?(a):(b))
#define lson (step<<1)
#define rson (lson+1)
#define eps 1e-6
#define oo 0x3fffffff
#define TEST cout<<"*************************"<<endl
const double pi=*atan(1.0);

using namespace std;
typedef long long ll;

int n;
const ll P = 50000000001507329LL; //190734863287 * 2 ^ 18 + 1
//const ll P = 1004535809LL; //479 * 2 ^ 21 + 1
//const ll P = 1004535809; // 119 * 2 ^ 23 + 1
const int N =  << ;
const int G = ;
int len;
ll A[N],B[N];
long long a[N],b[N],wn[];

ll mul(ll x, ll y) {
    return (x * y - (ll)(x / (long double)P * y + 1e-) * P + P) % P;
}

ll qpow(ll x, ll k, ll p) {
    ll ret = ;
    while(k) {
        if(k & ) ret = mul(ret, x);
        k >>= ;
        x = mul(x, x);
    }
    return ret;
}

void getwn()
{
    for(int i = ; i <= ; ++i)
    {
        int t =  << i;
        wn[i] = qpow(G, (P - ) / t, P);
    }
}

void change(ll *y, int len)
{
    for(int i = , j = len / ; i < len - ; ++i)
    {
        if(i < j) swap(y[i], y[j]);
        int k = len / ;
        while(j >= k)
        {
            j -= k;
            k /= ;
        }
        j += k;
    }
}

void NTT(ll *y, int len, int on)
{
    change(y, len);
    int id = ;
    for(int h = ; h <= len; h <<= )
    {
        ++id;
        for(int j = ; j < len; j += h)
        {
            ll w = ;
            for(int k = j; k < j + h / ; ++k)
            {
                ll u = y[k];
                ll t = mul(y[k+h/], w);
                y[k] = u + t;
                if(y[k] >= P) y[k] -= P;
                y[k+h/] = u - t + P;
                if(y[k+h/] >= P) y[k+h/] -= P;
                w = mul(w, wn[id]);
            }
        }
    }
    if(on == -)
    {
        for(int i = ; i < len / ; ++i) swap(y[i], y[len-i]);
        ll inv = qpow(len, P - , P);
        for(int i = ; i < len; ++i)
            y[i] = mul(y[i], inv);
    }
}
void work()///卷积，点乘，插值
{
    NTT(a,len,);
    NTT(b,len,);
    for(int i=;i<len;i++)
        a[i]=mul(a[i],b[i]);
    NTT(a,len,-);
}
ll solve()
{
    zeros(a);
    zeros(b);
    rep(i,,n-)
        a[i]=A[i];
    rep(i,,n-)
        b[i]=B[i];
    reverse(b,b+n);
    work();
    ll ans=;
    rep(i,,n-)
        a[i]+=a[i+n];
    rep(i,,n-)
        ans=max(ans,*a[i]);
    return ans;
}
int main()
{
    #ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
    #endif
    int T_T;
    scanf("%d",&T_T);
    getwn();
    for(int kase=;kase<=T_T;kase++)
    {
        sc(n);
        len=;
        while(len<=*n)
            len<<=;
        rep(i,,n-)
            cin>>A[i];
        rep(i,,n-)
            cin>>B[i];
        ll temp=;
        rep(i,,n-)
            temp+=A[i]*A[i];
        rep(i,,n-)
            temp+=B[i]*B[i];
        ll ans=solve();
        ans=temp-ans;
        cout<<(ans)<<endl;
    }
}

解法二：这个解法确实很漂亮，比赛的时候一直徘徊找一个更大的 模数，然后就GG了，http://www.cnblogs.com/smartweed/p/5903838.html

解法三：其实这种解法我们也尝试了，队友说NTT搞了那么久，说明暴力应该可以，不过最后只剩几分钟来不及找到合适的循环次数，http://www.cnblogs.com/cshg/p/5905398.html