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
54
55
56
57
58

#include <cstdio>
#include <algorithm>
#include <map>
#include <string>
using namespace std;
typedef unsigned long long ULL;
const int INF = 1009999999;
char str[4000005];
int ts, tt, n, m;
string wa[4000005], wb[4000005];
ULL H[4000005], mul[4000005];
inline ULL GetHash(int l, int r) { --l; return H[r] - H[l] * mul[r - l]; }
map<ULL, int> M;
int main() {
    scanf("%d%d%d%d", &ts, &tt, &n, &m);
    int HSK = (n + m) >> 1;
    string *S = wa, *T = wb;
    for (int i = 0; i < ts; ++i) {
        scanf("%s", str);
        S[i] = string(str);
    }
    for (int i = 0; i < tt; ++i) {
        scanf("%s", str);
        T[i] = string(str);
    }
    if (n < m) {
        swap(n, m);
        swap(S, T);
        swap(ts, tt);
    }
    mul[0] = 1;
    for (int i = 1; i <= n; ++i)
        mul[i] = mul[i-1] * 29;
    ULL has, Mag, Ans = 0;
    for (int i = 0; i < tt; ++i) {
        has = 0;
        for (int j = 0; j < m; ++j)
            has = has * 29 + ULL(T[i][j] - 'a' + 1);
        M[has] ++;
    }
    for (int i = 0; i < ts; ++i) {
        has = 0;
        for (int j = 0; j < HSK; ++j)
            H[j + 1] = H[j] * 29 + ULL(S[i][j] - 'a' + 1);
        for (int j = HSK; j < (HSK << 1); ++j)
            H[j + 1] = H[j] * 29 + ULL(S[i][j - HSK] - 'a' + 1);
        for (int j = HSK; j < n; ++j)
            has = has * 29 + ULL(S[i][j] - 'a' + 1);
        for (int j = 1; j <= HSK; ++j) {
            if (GetHash(j, j + n - HSK - 1) == has) {
                Mag = GetHash(j + n - HSK, j + HSK - 1);
                Ans += M[Mag];
            }
        }
    }
    printf("%llu", Ans);
    return 0;
}