NOI模拟赛 编辑距离

考虑值域比较小，求绝对值可以转化为枚举 $t$ , $|a-b|={\sum }_{t=0}^4(a>t)\oplus (b>t)$ ，于是问题转化为求两数组的区间逐位异或和。考虑分块，将64位分为一块，记$f[i][j]$为a数组从第i位开始分块，第j个块的二进制表达，同理$g[i][j]$为b数组对应的表达。查询时直接从询问偏移量开始异或g与f的对应位即可。

#define MAXN 110000
#define MAXM 1100000
#pragma GCC target("popcnt")
#define ull unsigned long long
using namespace std;

inline 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;
}

int n, q;
int a[MAXN], b[MAXN];

int w = 50;

void work1() {
    for (int i = 1; i <= q; i++) {
        int p1 = read(), p2 = read(), x = read();
        int ans = 0;
        for (int i = 1; i <= x; i++) ans += abs(a[p1 + i - 1] - b[p2 + i - 1]);
        printf("%d\n", ans);
    }
}

int p1[MAXM], p2[MAXM], s[MAXM];
int ans[MAXM];

ull f[MAXN], g[MAXN];
ull F[64][MAXN >> 6], G[64][MAXN >> 6];

void solve() {
    for (int i = 0; i < 64; i++) {
        for (int j = i; j < n; j += 64) {
            F[i][j >> 6] = G[i][j >> 6] = 0;
            for (int k = 0; k < 64; k++) F[i][j >> 6] |= (f[j + k] << k), G[i][j >> 6] |= (g[j + k] << k);
        }
    }
    for (int i = 1; i <= q; i++) {
        int p = p1[i] & 63, q = p2[i] & 63;
        int pp = p1[i] >> 6, qq = p2[i] >> 6;
        int j = 0, k = 0;
        for (; k + 63 < s[i]; j++, k += 64) ans[i] += __builtin_popcountll(F[p][pp + j] ^ G[q][qq + j]);
        for (; k < s[i]; k++) ans[i] += f[p1[i] + k] ^ g[p2[i] + k];
    }
}

signed main() {
    freopen("dist.in", "r", stdin);
    freopen("dist.out", "w", stdout);
    n = read(), q = read();
    for (int i = 1; i <= n; i++) a[i] = read();
    for (int i = 1; i <= n; i++) b[i] = read();
    if (n <= 10000) {
        work1();
        return 0;
    }
    for (int i = 1; i <= q; i++) p1[i] = read() - 1, p2[i] = read() - 1, s[i] = read();

    for (int i = 1; i <= 4; i++) {
        for (int j = 1; j <= n; j++) f[j - 1] |= (a[j] == i), g[j - 1] |= (b[j] == i);
        solve();
    }
    for (int i = 1; i <= q; i++) printf("%d\n", ans[i]);

    return 0;
}