hihocoder 1388 (中国剩余定理 NTT)

题目链接：点击这里

题意：求$min \left\{ \sum_{0}^{n-1}(A_i-B_{(i+k) \space mod \space n})^2 \big\|k=0,1\dots n-1 \right\}$.

把A数组逆置过来倍增一倍的长度，显然结果就是卷积的某一项。结果比较比，所以NTT时取两个$10^9$左右的模数，然后用CRT合并。

#include <cstdio>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <vector>
#include <cstring>
using namespace std;
#define pi acos (-1)
#define maxn 1000005
#define mod1 1004535809LL
#define mod2 469762049LL
#define G 3

long long x1[maxn], x2[maxn], x3[maxn], x4[maxn];

long long mul (long long a, long long b, long long mod) {
    if (b == 0)
        return 0;
    long long ans = mul (a, b>>1, mod);
    ans = ans*2%mod;
    if (b&1) ans += a, ans %= mod;
    return ans;
}


long long qpow (long long a, long long b, long long mod) {
    long long ret=1;
    while (b) {
        if (b&1) ret = (ret*a)%mod;
        a = (a*a)%mod;
        b >>= 1;
    }
    return ret;
}

void gcd (long long a, long long b, long long &d, long long &x, long long &y) {
    if (!b) {
        d = a;
        x = 1;
        y = 0;
    }
    else {
        gcd (b, a%b, d, y, x);
        y -= x*(a/b);
    }
}

long long aa[11], mm[11];
long long china (int n, long long *a, long long *m) {
    long long M = 1, d, y, x = 0;
    for (int i = 0; i < n; i++) M *= m[i];
    for (int i = 0; i< n; i++) {
        long long w = M/m[i];
        gcd (m[i], w, d, d, y);
        x = (x+ mul (mul (y, w, M), a[i], M)) % M;
    }
    return (x+M) % M;
}

void change (long long y[], int len) {
    for(int i = 1, j = len / 2; i < len - 1; i++) {
        if(i < j) swap(y[i], y[j]);
        int k = len / 2;
        while(j >= k) {
            j -= k;
            k /= 2;
        }
        if(j < k) j += k;
    }
}
void fft (long long y[], int len, int on, long long mod) {
    change (y, len);
    for(int h = 2; h <= len; h <<= 1) {
        long long wn = qpow(G, (mod-1)/h, mod);
        if(on == -1) wn = qpow(wn, mod-2, mod);
        for(int j = 0; j < len; j += h) {
            long long w = 1;
            for(int k = j; k < j + h / 2; k++) {
                long long u = y[k];
                long long t = w * y[k + h / 2] % mod;
                y[k] = (u + t) % mod;
                y[k+h/2] = (u - t + mod) % mod;
                w = w * wn % mod;
            }
        }
    }
    if(on == -1) {
        long long t = qpow (len, mod - 2, mod);
        for(int i = 0; i < len; i++)
            y[i] = y[i] * t % mod;
    }
}

int n;
long long a[maxn], b[maxn];

void solve () {
    for (int i = 0; i < n/2; i++) {
        swap (b[i], b[n-i-1]);
    }
    for (int i = n; i < 2*n; i++) {
        b[i] = b[i-n];
    }
    int len = 1;
    while (len < 2*n) len <<= 1;
    for (int i = 0; i < n; i++) {
        x1[i] = x3[i] = a[i];
    }
    for (int i = n; i < len; i++) {
        x1[i] = x3[i] = 0;
    }
    for (int i = 0; i < 2*n; i++) {
        x2[i] = x4[i] = b[i];
    }
    for (int i = 2*n; i < len; i++) {
        x2[i] = x4[i] = 0;
    }
    fft (x1, len, 1, mod1);
    fft (x2, len, 1, mod1);
    fft (x3, len, 1, mod2);
    fft (x4, len, 1, mod2);
    for (int i = 0; i < len; i++) {
        x1[i] = x1[i]*x2[i]%mod1;
        x3[i] = x3[i]*x4[i]%mod2;
    }
    fft (x1, len, -1, mod1);
    fft (x3, len, -1, mod2);
    long long ans = 0;
    for (int i = n-1; i <= 2*n-2; i++) {
        mm[0] = mod1, mm[1] = mod2;
        aa[0] = x1[i], aa[1] = x3[i];
        long long tmp = china (2, aa, mm);
        ans = max (ans, tmp);
    }
    long long tot = 0;
    for (int i = 0; i < n; i++) {
        tot += a[i]*a[i] + b[i]*b[i];
    }
    printf ("%lld\n", tot-2*ans);
}


int main () {
    //freopen ("2.txt", "r", stdin);
    int t;
    scanf ("%d", &t);
    while (t--) {
        scanf ("%d", &n);
        for (int i = 0; i < n; i++) {
            scanf ("%lld", &a[i]);
        }
        for (int j = 0; j < n; j++) {
            scanf ("%lld", &b[j]);
        }
        solve ();
    }
    return 0;
}