結果

問題 No.2626 Similar But Different Name
ユーザー 👑 rin204rin204
提出日時 2024-02-10 00:31:13
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 404 ms / 3,000 ms
コード長 6,517 bytes
コンパイル時間 311 ms
コンパイル使用メモリ 81,700 KB
実行使用メモリ 126,556 KB
最終ジャッジ日時 2024-02-10 00:31:24
合計ジャッジ時間 9,087 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 38 ms
53,460 KB
testcase_01 AC 39 ms
53,460 KB
testcase_02 AC 36 ms
53,460 KB
testcase_03 AC 34 ms
53,460 KB
testcase_04 AC 34 ms
53,460 KB
testcase_05 AC 35 ms
53,460 KB
testcase_06 AC 38 ms
53,460 KB
testcase_07 AC 52 ms
68,504 KB
testcase_08 AC 50 ms
66,416 KB
testcase_09 AC 45 ms
64,192 KB
testcase_10 AC 81 ms
76,404 KB
testcase_11 AC 77 ms
76,396 KB
testcase_12 AC 72 ms
76,152 KB
testcase_13 AC 91 ms
76,396 KB
testcase_14 AC 77 ms
76,264 KB
testcase_15 AC 76 ms
76,144 KB
testcase_16 AC 78 ms
76,264 KB
testcase_17 AC 79 ms
76,264 KB
testcase_18 AC 354 ms
126,556 KB
testcase_19 AC 151 ms
101,776 KB
testcase_20 AC 124 ms
101,776 KB
testcase_21 AC 94 ms
88,212 KB
testcase_22 AC 404 ms
122,696 KB
testcase_23 AC 375 ms
123,088 KB
testcase_24 AC 373 ms
120,504 KB
testcase_25 AC 389 ms
121,332 KB
testcase_26 AC 362 ms
123,092 KB
testcase_27 AC 368 ms
123,144 KB
testcase_28 AC 396 ms
121,352 KB
testcase_29 AC 352 ms
119,908 KB
testcase_30 AC 375 ms
120,552 KB
testcase_31 AC 388 ms
121,172 KB
testcase_32 AC 347 ms
121,892 KB
testcase_33 AC 362 ms
121,512 KB
testcase_34 AC 350 ms
119,760 KB
testcase_35 AC 354 ms
121,208 KB
testcase_36 AC 364 ms
119,760 KB
testcase_37 AC 343 ms
126,556 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

class NTT998:
    # fmt: off
    rate2=(0, 911660635, 509520358, 369330050, 332049552, 983190778, 123842337, 238493703, 975955924, 603855026, 856644456, 131300601, 842657263, 730768835, 942482514, 806263778, 151565301, 510815449, 503497456, 743006876, 741047443, 56250497, 867605899, 0)
    irate2=(0, 86583718, 372528824, 373294451, 645684063, 112220581, 692852209, 155456985, 797128860, 90816748, 860285882, 927414960, 354738543, 109331171, 293255632, 535113200, 308540755, 121186627, 608385704, 438932459, 359477183, 824071951, 103369235, 0)
    rate3=(0, 372528824, 337190230, 454590761, 816400692, 578227951, 180142363, 83780245, 6597683, 70046822, 623238099, 183021267, 402682409, 631680428, 344509872, 689220186, 365017329, 774342554, 729444058, 102986190, 128751033, 395565204, 0)
    irate3=(0, 509520358, 929031873, 170256584, 839780419, 282974284, 395914482, 444904435, 72135471, 638914820, 66769500, 771127074, 985925487, 262319669, 262341272, 625870173, 768022760, 859816005, 914661783, 430819711, 272774365, 530924681, 0)
    # fmt: on

    def butterfly(A):
        n = len(A)
        h = (n - 1).bit_length()
        le = 0
        while le < h:
            if h - le == 1:
                p = 1 << (h - le - 1)
                rot = 1
                for s in range(1 << le):
                    offset = s << (h - le)
                    for i in range(p):
                        l = A[i + offset]
                        r = A[i + offset + p] * rot
                        A[i + offset] = (l + r) % 998244353
                        A[i + offset + p] = (l - r) % 998244353
                    rot *= NTT998.rate2[(~s & -~s).bit_length()]
                    rot %= 998244353
                le += 1
            else:
                p = 1 << (h - le - 2)
                rot = 1
                for s in range(1 << le):
                    rot2 = rot * rot % 998244353
                    rot3 = rot2 * rot % 998244353
                    offset = s << (h - le)
                    for i in range(p):
                        a0 = A[i + offset]
                        a1 = A[i + offset + p] * rot
                        a2 = A[i + offset + p * 2] * rot2
                        a3 = A[i + offset + p * 3] * rot3
                        a1na3imag = (a1 - a3) % 998244353 * 911660635
                        A[i + offset] = (a0 + a2 + a1 + a3) % 998244353
                        A[i + offset + p] = (a0 + a2 - a1 - a3) % 998244353
                        A[i + offset + p * 2] = (a0 - a2 + a1na3imag) % 998244353
                        A[i + offset + p * 3] = (a0 - a2 - a1na3imag) % 998244353
                    rot *= NTT998.rate3[(~s & -~s).bit_length()]
                    rot %= 998244353
                le += 2

    def butterfly_inv(A):
        n = len(A)
        h = (n - 1).bit_length()
        le = h
        while le:
            if le == 1:
                p = 1 << (h - le)
                irot = 1
                for s in range(1 << (le - 1)):
                    offset = s << (h - le + 1)
                    for i in range(p):
                        l = A[i + offset]
                        r = A[i + offset + p]
                        A[i + offset] = (l + r) % 998244353
                        A[i + offset + p] = (l - r) * irot % 998244353
                    irot *= NTT998.irate2[(~s & -~s).bit_length()]
                    irot %= 998244353
                le -= 1
            else:
                p = 1 << (h - le)
                irot = 1
                for s in range(1 << (le - 2)):
                    irot2 = irot * irot % 998244353
                    irot3 = irot2 * irot % 998244353
                    offset = s << (h - le + 2)
                    for i in range(p):
                        a0 = A[i + offset]
                        a1 = A[i + offset + p]
                        a2 = A[i + offset + p * 2]
                        a3 = A[i + offset + p * 3]
                        a2na3iimag = (a2 - a3) * 86583718 % 998244353
                        A[i + offset] = (a0 + a1 + a2 + a3) % 998244353
                        A[i + offset + p] = (a0 - a1 + a2na3iimag) * irot % 998244353
                        A[i + offset + p * 2] = (a0 + a1 - a2 - a3) * irot2 % 998244353
                        A[i + offset + p * 3] = (a0 - a1 - a2na3iimag) * irot3 % 998244353
                    irot *= NTT998.irate3[(~s & -~s).bit_length()]
                    irot %= 998244353
                le -= 2

    def multiply(A, B):
        n = len(A)
        m = len(B)
        if min(n, m) <= 60:
            C = [0] * (n + m - 1)
            for i in range(n):
                if i % 8 == 0:
                    for j in range(m):
                        C[i + j] += A[i] * B[j]
                        C[i + j] %= 998244353
                else:
                    for j in range(m):
                        C[i + j] += A[i] * B[j]
            return [c % 998244353 for c in C]
        A = A[:]
        B = B[:]
        z = 1 << (n + m - 2).bit_length()
        A += [0] * (z - n)
        B += [0] * (z - m)
        NTT998.butterfly(A)
        NTT998.butterfly(B)
        for i in range(z):
            A[i] *= B[i]
            A[i] %= 998244353
        NTT998.butterfly_inv(A)
        A = A[: n + m - 1]
        iz = pow(z, 998244353 - 2, 998244353)
        return [a * iz % 998244353 for a in A]


def partial_match_table(word):
    n = len(word)
    table = [0] * (n + 1)
    table[0] = -1

    i = 0
    j = 1
    while j < n:
        matched = word[i] == word[j]
        if not matched and i > 0:
            i = table[i]
        else:
            if matched:
                i += 1
            j += 1
            table[j] = i

    return table


def kmp_search(text, word):
    table = partial_match_table(word)
    n = len(text)

    i = p = 0
    ret = []
    while i < n:
        if text[i] == word[p]:
            i += 1
            p += 1
            if p == len(word):
                ret.append(i - p)
                p = table[p]
        else:
            p = table[p]
            if p < 0:
                i += 1
                p += 1

    return ret


n, m, k = map(int, input().split())
S = input()
T = input()
res = kmp_search(S.lower(), T.lower())

A = [1 if s.isupper() else -1 for s in S]
B = [-1 if t.isupper() else 1 for t in T]
B = B[::-1]
C = NTT998.multiply(A, B)
ans = 0

for i in res:
    tot = C[i + m - 1]
    if tot > 10**7:
        tot -= 998244353
    tot += m
    tot //= 2
    if 1 <= tot <= k:
        ans += 1

print(ans)
0