[bzoj2462] [BeiJing2011]矩阵模板

　　二维的hash。。

　　注意n的范围是1000........

　　真相似乎是全部输出1就行了233

 #include<cstdio>
 #include<iostream>
 #include<cstring>
 #define ull unsigned long long
 using namespace std;
 const int maxn=;
 const int modd=;
 ull pre[maxn][maxn],v[maxn][maxn],jc[maxn];
 int n,m,a,b,q;
 char s[maxn];
 bool u[];

 int main(){
     register int i,j,k;
     scanf("%d%d%d%d",&n,&m,&a,&b);
     for(i=jc[]=;i<=m;i++)jc[i]=jc[i-]*;
     for(i=;i<=n;i++){
         scanf("%s",s+);
         for(j=;j<=m;j++)pre[i][j]=pre[i][j-]*+s[j];
         if(i==a)
             for(j=b;j<=m;j++)
             for(k=;k<=i;k++)v[i][j]=v[i][j]*+pre[k][j]-pre[k][j-b]*jc[b];
         else if(i>a)
             for(j=b;j<=m;j++)v[i][j]=v[i-][j]*+pre[i][j]-pre[i][j-b]*jc[b]-(pre[i-a][j]-pre[i-a][j-b]*jc[b])*jc[a];
     }
     for(i=;i<=n;i++)for(j=;j<=m;j++)u[v[i][j]%modd]=;
     scanf("%d",&q);
     while(q--){
         ull now=,now1;
         for(i=;i<=a;i++){
             scanf("%s",s+);
             for(now1=,j=;j<=b;j++)now1=now1*+s[j];
             now=now*+now1;
         }
         bool flag=u[now%modd];
         //for(i=a;i<=n&&!flag;i++)for(j=b;j<=m;j++)if(v[i][j]==now){flag=1;break;}
         puts(flag?"":"");
     }
     return ;
 }