hihoCoder #1388 : Periodic Signal

NTT (long long 版）

#include <algorithm>
#include <cstring>
#include <string.h>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <cstdio>
#include <cmath>

#define INF 0x3ffffff

using namespace std;

typedef long long LL;
const int N = ;
const LL P = 180143985094819841LL; //190734863287 * 2 ^ 18 + 1
const int G = ;
LL 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);
    }
}
LL a[], b[];
LL x[N], y[N], num[N];
void mul(LL a[], LL b[], LL c[], int len)
{
    NTT(a, len, );
    NTT(b, len, );
    for (int i = ; i < len; i++)
    {
        c[i] = mul(a[i], b[i]);
    }
    NTT(c, len, -);
}
void init(){
     memset(num,,sizeof(num));
     memset(x,,sizeof(x));
     memset(y,,sizeof(y));
}
int main()
{
    int T;
    scanf("%d",&T);
    getwn(); //！！！
    LL suma,sumb;
    while(T--)
        {
            int n;
             suma=;sumb=; //suma为A[]平方和
            init();
            scanf("%d",&n);
             for(int i = ;i < n;i++) {scanf("%lld",&a[i]);suma+=a[i]*a[i];}
             for(int i = ;i < n;i++) {scanf("%lld",&b[i]);sumb+=b[i]*b[i];}
            int len = ;
            while( len < *n ) len <<= ;
             for(int i = ;i < n;i++){
                x[i] = a[i];
            }
             for(int i = ;i < n;i++){
                y[i] = b[n-i-];
            }
                    mul(x, y, num, len); //NTT
          LL ret=num[n-];
          for(int i=;i<n-;i++) {
                ret=max(ret,num[i]+num[i+n]);
          }
          LL ans=suma+sumb-*ret;
         cout<< ans<<endl;
        }
    return ;
}