题意:
给一个大矩阵, 在给若干个小矩阵,然后问你这次小矩阵是否在大矩阵中出现过,有几个出现过。
矩阵只有两个字符组成。
h[i][j] 表示,第i行,从j-q个字符到j这一段字符的哈希值。
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <stack>
#include <queue>
#include <vector>
#include <algorithm>
#define mem(x,v) memset(x,v,sizeof(x))
#define go(i,a,b) for (int i = a; i <= b; i++)
#define og(i,a,b) for (int i = a; i >= b; i--)
using namespace std;
typedef long long ll;
const double EPS = 1e-10;
const int INF = 0x3f3f3f3f;
const int N = 1111;
ll h[N][N],a[100];
int n,m,p,t,q;
char mp[N][N],tmp[N];
bool ok(){
for (int i = 0; i + p - 1 < n; i++){
for(int j = q-1; j < m; j++){
int flag = 1;
for (int k = 0; k < p; k++){
if (h[i+k][j] != a[k]){
flag = 0; break;
}
}
if (flag) return true;
}
}
return false;
}
int main(){
int num = 0;
while(scanf("%d %d %d %d %d",&n,&m,&t,&p,&q)!=EOF){
if (!n && !m && !t) break;
for (int i = 0; i < n; i++) scanf("%s",mp[i]);
mem(h,0);
for (int i = 0; i < n; i++)
for (int j = 0; j < q; j++)
if (mp[i][j] == '*') h[i][q-1] |= (1LL << j);
for (int i = 0; i < n; i++)
for (int j = q; j < m; j++){
if (mp[i][j-q] == '*') h[i][j] = h[i][j-1] - 1LL;
else h[i][j] = h[i][j-1];
h[i][j] >>= 1LL;
if (mp[i][j] == '*') h[i][j] |= (1LL << (q-1)); }
int cnt = 0;
while(t--){
for (int i = 0; i < p; i++){
scanf("%s",tmp);
a[i] = 0;
for (int j = 0; j < q; j++)
if (tmp[j] == '*') a[i] |= (1LL << j);
}
if (ok())cnt++;
}
printf("Case %d: %d\n",++num,cnt);
}
return 0;
}