結果
| 問題 | No.2626 Similar But Different Name |
| ユーザー |
 hirayuu_yc
|
| 提出日時 | 2024-02-09 22:12:01 |
| 言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 5,257 bytes |
| コンパイル時間 | 206 ms |
| コンパイル使用メモリ | 12,544 KB |
| 実行使用メモリ | 126,556 KB |
| 最終ジャッジ日時 | 2024-09-28 15:28:14 |
| 合計ジャッジ時間 | 45,992 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge3 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 472 ms
43,924 KB |
| testcase_01 | AC | 482 ms
43,924 KB |
| testcase_02 | AC | 465 ms
43,928 KB |
| testcase_03 | AC | 467 ms
44,056 KB |
| testcase_04 | AC | 475 ms
44,056 KB |
| testcase_05 | AC | 464 ms
44,180 KB |
| testcase_06 | AC | 471 ms
44,056 KB |
| testcase_07 | AC | 476 ms
44,052 KB |
| testcase_08 | AC | 479 ms
43,924 KB |
| testcase_09 | AC | 483 ms
44,060 KB |
| testcase_10 | WA | - |
| testcase_11 | WA | - |
| testcase_12 | WA | - |
| testcase_13 | WA | - |
| testcase_14 | WA | - |
| testcase_15 | WA | - |
| testcase_16 | WA | - |
| testcase_17 | WA | - |
| testcase_18 | AC | 1,699 ms
126,556 KB |
| testcase_19 | AC | 1,767 ms
117,980 KB |
| testcase_20 | AC | 1,706 ms
118,284 KB |
| testcase_21 | AC | 1,667 ms
117,936 KB |
| testcase_22 | WA | - |
| testcase_23 | WA | - |
| testcase_24 | WA | - |
| testcase_25 | WA | - |
| testcase_26 | WA | - |
| testcase_27 | WA | - |
| testcase_28 | WA | - |
| testcase_29 | WA | - |
| testcase_30 | WA | - |
| testcase_31 | WA | - |
| testcase_32 | WA | - |
| testcase_33 | WA | - |
| testcase_34 | WA | - |
| testcase_35 | WA | - |
| testcase_36 | WA | - |
| testcase_37 | AC | 1,639 ms
125,680 KB |
ソースコード
import sys
sys.setrecursionlimit((1<<19)-1)
#import pypyjit
#pypyjit.set_param('max_unroll_recursion=-1')
import random
import numpy as np
def comv(f,g):
sz=1<<(max(len(f),len(g)).bit_length()+1)
ff=np.fft.rfft(f,sz)
fg=np.fft.rfft(g,sz)
h=np.fft.irfft(ff*fg,sz)
h=np.rint(h).astype(np.int64)
return h[:len(f)+len(g)-1]
"""
# https://judge.yosupo.jp/submission/55648
# AtCoder Libary v1.4 を python に移植したもの
# https://github.com/atcoder/ac-library/blob/master/atcoder/convolution.hpp
MOD = 998244353
IMAG = 911660635
IIMAG = 86583718
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)
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) % MOD
a[i + offset + p] = (l - r) % MOD
rot *= rate2[(~s & -~s).bit_length()]
rot %= MOD
le += 1
else:
p = 1 << (h - le - 2)
rot = 1
for s in range(1 << le):
rot2 = rot * rot % MOD
rot3 = rot2 * rot % MOD
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) % MOD * IMAG
a[i + offset] = (a0 + a2 + a1 + a3) % MOD
a[i + offset + p] = (a0 + a2 - a1 - a3) % MOD
a[i + offset + p * 2] = (a0 - a2 + a1na3imag) % MOD
a[i + offset + p * 3] = (a0 - a2 - a1na3imag) % MOD
rot *= rate3[(~s & -~s).bit_length()]
rot %= MOD
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) % MOD
a[i + offset + p] = (l - r) * irot % MOD
irot *= irate2[(~s & -~s).bit_length()]
irot %= MOD
le -= 1
else:
p = 1 << (h - le)
irot = 1
for s in range(1 << (le - 2)):
irot2 = irot * irot % MOD
irot3 = irot2 * irot % MOD
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) * IIMAG % MOD
a[i + offset] = (a0 + a1 + a2 + a3) % MOD
a[i + offset + p] = (a0 - a1 + a2na3iimag) * irot % MOD
a[i + offset + p * 2] = (a0 + a1 - a2 - a3) * irot2 % MOD
a[i + offset + p * 3] = (a0 - a1 - a2na3iimag) * irot3 % MOD
irot *= irate3[(~s & -~s).bit_length()]
irot %= MOD
le -= 2
def multiply(s, t):
n = len(s)
m = len(t)
if min(n, m) <= 60:
a = [0] * (n + m - 1)
for i in range(n):
if i % 8 == 0:
for j in range(m):
a[i + j] += s[i] * t[j]
a[i + j] %= MOD
else:
for j in range(m):
a[i + j] += s[i] * t[j]
return [x % MOD for x in a]
a = s.copy()
b = t.copy()
z = 1 << (n + m - 2).bit_length()
a += [0] * (z - n)
b += [0] * (z - m)
butterfly(a)
butterfly(b)
for i in range(z):
a[i] *= b[i]
a[i] %= MOD
butterfly_inv(a)
a = a[:n + m - 1]
iz = pow(z, MOD - 2, MOD)
return [v * iz % MOD for v in a]
"""
P=(1<<61)-1
B=random.randint(100,P-1)
N,M,K=map(int,input().split())
S=input()
T=input()
s=S.lower()
t=T.lower()
bp=pow(B,M,P)
cumt=0
for i in t:
cumt*=B
cumt+=ord(i)
cumt%=P
ok=[0]*N
cums=0
for i in range(N):
cums*=B
cums+=ord(s[i])
if i>=M:
cums-=bp*ord(s[i-M])
cums%=P
if cums==cumt:
ok[i-M+1]=1
p=[]
for i in range(N):
if S[i]==s[i]:
p.append(1)
else:
p.append(-1)
q=[]
for i in range(M):
if T[i]==t[i]:
q.append(-1)
else:
q.append(1)
pq=comv(p,q)
ans=0
for i in range((N-M+1)):
if 2<=pq[i+M-1]+M<=K*2:
if ok[i]==1:
ans+=1
print(ans)