bzoj2351 [BeiJing2011]Matrix（二维哈希）

挺裸的，，，搞出hash表，直接查询即可。

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <map>
using namespace std;
#define ull unsigned long long
#define N 1010
#define k1 11113
#define k2 11117
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,m,a,b;map<ull,int>mp;
ull hs[N][N],bin1[N],bin2[N];
char s[N];
int main(){
//  freopen("a.in","r",stdin);
    n=read();m=read();a=read();b=read();bin1[0]=bin2[0]=1;
    for(int i=1;i<=n;++i){
        scanf("%s",s+1);
        for(int j=1;j<=m;++j) hs[i][j]=hs[i][j-1]*k1+s[j];
    }for(int i=1;i<=n;++i)
        for(int j=1;j<=m;++j) hs[i][j]+=hs[i-1][j]*k2;
    for(int i=1;i<=n;++i) bin2[i]=bin2[i-1]*k2;
    for(int i=1;i<=m;++i) bin1[i]=bin1[i-1]*k1;
    for(int i=a;i<=n;++i)
        for(int j=b;j<=m;++j)
    mp[hs[i][j]-hs[i-a][j]*bin2[a]-hs[i][j-b]*bin1[b]+hs[i-a][j-b]*bin2[a]*bin1[b]]=1;
    int owo=read();
    while(owo--){
        ull res=0;
        for(int i=1;i<=a;++i){
            scanf("%s",s+1);
            for(int j=1;j<=b;++j) res+=s[j]*bin2[a-i]*bin1[b-j];
        }puts(mp[res]?"1":"0");
    }return 0;
}