bzoj 1414 对称的正方形

用manacher写了一上午，愣是没有写出来，逼着自己学了字符串hash，水过。

主要是维护4个方向的hash值，如果这是个合法的正方形，那么这个子矩形的4个hash值是相同的。

我也明白了什么是自然溢出，就是开一个unsigned……，然后不用取模就行了

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>

#define md
#define ll long long
#define inf (int) 1e9
#define eps 1e-8
#define N 2010
#define it unsigned int
const it cheng1=1212121211;
const it cheng2=1212121223;
using namespace std;
it f[4][N][N],mi1[N],mi2[N];
int n,m;
void build()
{
	for (int i=1;i<=n;i++)
      for (int j=1;j<=m;j++)
        f[0][i][j]+=f[0][i][j-1]*cheng1;
    for (int i=1;i<=n;i++)
      for (int j=1;j<=m;j++)
        f[0][i][j]+=f[0][i-1][j]*cheng2;
    
	for (int i=1;i<=n;i++)
      for (int j=m;j;j--)
        f[1][i][j]+=f[1][i][j+1]*cheng1;
    for (int i=1;i<=n;i++)
      for (int j=m;j;j--)
        f[1][i][j]+=f[1][i-1][j]*cheng2;
    
	for (int i=n;i;i--)
      for (int j=1;j<=m;j++)
        f[2][i][j]+=f[2][i][j-1]*cheng1;
    for (int i=n;i;i--)
      for (int j=1;j<=m;j++)
        f[2][i][j]+=f[2][i+1][j]*cheng2;
    
	for (int i=n;i;i--)
      for (int j=m;j;j--)
        f[3][i][j]+=f[3][i][j+1]*cheng1;
    for (int i=n;i;i--)
      for (int j=m;j;j--)
        f[3][i][j]+=f[3][i+1][j]*cheng2;
}

bool ok(int x1,int x2,int y1,int y2)
{
	it mix=mi2[x2+1-x1],miy=mi1[y2+1-y1];
	it hash0=f[0][x2][y2]
			-f[0][x1-1][y2]*mix
			-f[0][x2][y1-1]*miy
			+f[0][x1-1][y1-1]*mix*miy;
	it hash1=f[1][x2][y1]
			-f[1][x2][y2+1]*miy
			-f[1][x1-1][y1]*mix
			+f[1][x1-1][y2+1]*mix*miy;
	if (hash0!=hash1) return 0;
	it hash2=f[2][x1][y2]
			-f[2][x2+1][y2]*mix
			-f[2][x1][y1-1]*miy
			+f[2][x2+1][y1-1]*mix*miy;
	if (hash2!=hash0) return 0;
	it hash3=f[3][x1][y1]
			-f[3][x2+1][y1]*mix
			-f[3][x1][y2+1]*miy
			+f[3][x2+1][y2+1]*mix*miy;
	return hash3==hash0;
}

int find(int x,int y)
{
	int l=1,r=min(min(x,n-x+1),min(y,m-y+1));
	while (l!=r)
	{
		int mid=(l+r+1)>>1;
		if (ok(x-mid+1,x+mid-1,y-mid+1,y+mid-1)) l=mid; else r=mid-1;
	}
	return l;
}

int main()
{
	int x,ans=0;
	scanf("%d%d",&n,&m);
	for (int i=1;i<=n;i++)
	  for (int j=1;j<=m;j++)
	  {
	    scanf("%d",&x);
	    for (int k=0;k<=3;k++) f[k][i<<1][j<<1]=x;
	  }
	n=n*2+1; m=m*2+1;
	mi1[0]=1; for (int i=1;i<=max(n,m);i++) mi1[i]=mi1[i-1]*cheng1;
	mi2[0]=1; for (int i=1;i<=max(n,m);i++) mi2[i]=mi2[i-1]*cheng2;
	build();
	for (int i=1;i<=n;i++)
	  for (int j=1;j<=m;j++)
	    if (((i+j)^1)&1) ans+=find(i,j)>>1;
	printf("%d\n",ans);
	return 0;
}