1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
| #include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
typedef unsigned long long ULL;
const int N = 1010, M = N * N;
const int row = 131, col = 13331;
int n, m, T, P, Q;
char str[N][N];
ULL h[N][N], h2[N][N];
ULL p1[M], p2[M];
void init(char s[][N], ULL h[][N], int n, int m) {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
h[i][j] = h[i - 1][j] * row + h[i][j - 1] * col - h[i - 1][j - 1] * row * col + s[i][j];
}
}
}
ULL get(ULL h[][N], int x1, int y1, int x2, int y2) {
return h[x2][y2] - h[x1 - 1][y2] * p1[x2 - x1 + 1] - h[x2][y1 - 1] * p2[y2 - y1 + 1]
+ h[x1 - 1][y1 - 1] * p1[x2 - x1 + 1] * p2[y2 - y1 + 1];
}
int main() {
p1[0] = p2[0] = 1;
for (int i = 1; i <= 1e6; i++) p1[i] = p1[i - 1] * row, p2[i] = p2[i - 1] * col;
cin >> T;
while (T--) {
cin >> n >> m;
for (int i = 1; i <= n; i++) scanf("%s", str[i] + 1);
init(str, h, n, m);
int ans = 0;
cin >> P >> Q;
for (int i = 1; i <= P; i++) scanf("%s", str[i] + 1);
init(str, h2, P, Q);
bool flag = false;
for (int i = 1; i <= n - P + 1; i++) {
for (int j = 1; j <= m - Q + 1; j++) {
if (get(h, i, j, i + P - 1, j + Q - 1) == h2[P][Q]) {
ans++;
}
}
}
printf("%d\n", ans);
}
return 0;
}
|