P4398 [JSOI2008] 二维 Hash

题意

传送门 P4398 [JSOI2008]Blue Mary的战役地图

题解

从大到小枚举正方形的边长，使用二维 $Hash$ 处理两张地图的各个正方形，最后对一张地图的 $Hash$ 值排序，枚举另一张地图 $Hash$ 值并二分求解两张地图是否存在相同正方形。总时间复杂度 $O(N^3\log N)$。

#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
const int maxn = 55;
int N, tot, A[maxn][maxn], B[maxn][maxn];
ull F[maxn * maxn], G[maxn * maxn], tmp[maxn][maxn];

void Hash(int a[maxn][maxn], int k, ull *f)
{
    const ull b1 = 131, b2 = 13331;
    ull t = 1;
    for (int i = 1; i <= k; ++i)
        t *= b1;
    for (int i = 1; i <= N; ++i)
    {
        ull e = 0;
        for (int j = 1; j <= k; ++j)
            e = e * b1 + a[i][j];
        for (int j = 1; j + k - 1 <= N; ++j)
            tmp[i][j] = e, e = e * b1 + a[i][j + k] - a[i][j] * t;
    }
    t = 1;
    for (int i = 1; i <= k; ++i)
        t *= b2;
    for (int j = 1; j + k - 1 <= N; ++j)
    {
        ull e = 0;
        for (int i = 1; i <= k; ++i)
            e = e * b2 + tmp[i][j];
        for (int i = 1; i + k - 1 <= N; ++i)
            f[++tot] = e, e = e * b2 + tmp[i + k][j] - tmp[i][j] * t;
    }
}

int main()
{
    scanf("%d", &N);
    for (int i = 1; i <= N; ++i)
        for (int j = 1; j <= N; ++j)
            scanf("%d", &A[i][j]);
    for (int i = 1; i <= N; ++i)
        for (int j = 1; j <= N; ++j)
            scanf("%d", &B[i][j]);
    int res = 0, f = 0;
    for (int i = N; i && !f; --i)
    {
        tot = 0, Hash(A, i, F);
        tot = 0, Hash(B, i, G);
        sort(F + 1, F + tot + 1);
        for (int j = 1; j <= tot && !f; ++j)
            if (upper_bound(F + 1, F + tot + 1, G[j]) - lower_bound(F + 1, F + tot + 1, G[j]) > 0)
                res = i, f = 1;
    }
    printf("%d\n", res);
    return 0;
}