CodeForces 1080E Sonya and Matrix Beauty (Manacher + hash)

题意：给出一个矩阵，求所有子矩阵在变换后构成每行、每列是回文串的子矩阵个数，具体变换表现为将子矩阵行上的元素重新排列。

题解：Manacher+hash
要构成回文串，则奇数个元素的种数最多只有一个。
在划分完子矩阵后，将一行的元素哈希，然后将列上的哈希值跑Manacher。
因为有行上的条件限制，用$f[]$标记一下行上是否是回文串即可。

#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
#include<queue>
#include<stack>
#include<cmath>
#include<vector>
#include<fstream>
#include<set>
#include<map>
#define ll long long
using namespace std;

const int MAXN = 1111;
const int h = 2333;
int n, m, Mp[MAXN], f[MAXN], num[MAXN][MAXN];
ll ans;
unsigned ll poww[MAXN], ha[MAXN], Ma[MAXN << 1];
char s[MAXN][MAXN];

void Manacher() {
	for (int i = 1; i <= 2 * n + 2; i++) f[i] = 0;
	for (int i = 1; i <= n; i++) {
		if (num[i][27] <= 1) Ma[i << 1] = ha[i]; 
		else f[i << 1] = 1;
		Ma[(i << 1) - 1] = -1;
	}
	int len = n << 1 | 1, mx = 0, id = 0;
	f[0] = f[len + 1] = 1; Ma[len] = -1;
	for (int i = 1; i <= len; i++) {
		Mp[i] = mx > i ? min(mx - i, Mp[(id << 1) - i]) : 1;
		while (!f[i - Mp[i]] && !f[i + Mp[i]] && Ma[i - Mp[i]] == Ma[i + Mp[i]]) ++Mp[i];
		if (i + Mp[i] >= mx) mx = i + Mp[i], id = i;
		if (!f[i]) ans += Mp[i] / 2;
	}
}

int main() {
	poww[0] = 1;
	for (int i = 1; i <= 26; i++) poww[i] = poww[i - 1] * h;
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; i++) scanf("%s", s[i] + 1);
	for (int i = 1; i <= m; i++) {
		for (int j = 1; j <= n; j++) {
			ha[j] = 0;
			for (int k = 0; k <= 27; ++k) num[j][k] = 0;
		}
		for (int j = i; j <= m; j++) {
			for (int k = 1; k <= n; k++) {
				int x = s[k][j] - 'a' + 1;
				num[k][x]++;
				ha[k] += poww[x];
				if (num[k][x] & 1) num[k][27]++; 
				else num[k][27]--;
			}
			Manacher();
		}
	}
	printf("%lld\n", ans);
	return 0;
}