結果
| 問題 | No.2626 Similar But Different Name |
| ユーザー |
 nikoro256
|
| 提出日時 | 2024-02-09 23:19:37 |
| 言語 | PyPy3 (7.3.15) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 9,909 bytes |
| コンパイル時間 | 251 ms |
| コンパイル使用メモリ | 82,428 KB |
| 実行使用メモリ | 251,840 KB |
| 最終ジャッジ日時 | 2024-09-28 16:32:51 |
| 合計ジャッジ時間 | 23,666 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge2 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | WA | - |
| testcase_01 | AC | 41 ms
58,496 KB |
| testcase_02 | AC | 40 ms
56,508 KB |
| testcase_03 | WA | - |
| testcase_04 | AC | 39 ms
56,724 KB |
| testcase_05 | AC | 42 ms
56,932 KB |
| testcase_06 | WA | - |
| testcase_07 | WA | - |
| testcase_08 | WA | - |
| testcase_09 | AC | 99 ms
77,588 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 | WA | - |
| testcase_19 | WA | - |
| testcase_20 | WA | - |
| testcase_21 | AC | 577 ms
218,340 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 | WA | - |
ソースコード
from collections import Counter
# SA-IS (O(nlogn))
# s: 文字列
def sais(s):
uniq = list(set(s))
uniq.sort()
return sais_rec(list(map({e: i+1 for i, e in enumerate(uniq)}.__getitem__, s)), len(uniq))
def sais_rec(lst, num):
L = len(lst)
if L < 2:
return lst + [0]
lst = lst + [0]
L += 1
res = [-1] * L
t = [1] * L
for i in range(L-2, -1, -1):
t[i] = 1 if (lst[i] < lst[i+1] or (lst[i] == lst[i+1] and t[i+1])) else 0
isLMS = [t[i-1] < t[i] for i in range(L)]
LMS = [i for i in range(1, L) if t[i-1] < t[i]]
LMSn = len(LMS)
count = Counter(lst)
tmp = 0
cstart = [0]*(num+1)
cend = [0]*(num+1)
for key in range(num+1):
cstart[key] = tmp
cend[key] = tmp = tmp + count[key]
cc_it = [iter(range(e-1, s-1, -1)) for s, e in zip(cstart, cend)]
for e in reversed(LMS):
res[next(cc_it[lst[e]])] = e
cs_it = [iter(range(s, e)) for s, e in zip(cstart, cend)]
ce_it = [iter(range(e-1, s-1, -1)) for s, e in zip(cstart, cend)]
for e in res:
if e > 0 and not t[e-1]:
res[next(cs_it[lst[e-1]])] = e-1
for e in reversed(res):
if e > 0 and t[e-1]:
res[next(ce_it[lst[e-1]])] = e-1
name = 0; prev = -1
pLMS = {}
for e in res:
if isLMS[e]:
if prev == -1 or lst[e] != lst[prev]:
name += 1; prev = e
else:
for i in range(1, L):
if lst[e+i] != lst[prev+i]:
name += 1; prev = e
break
if isLMS[e+i] or isLMS[prev+i]:
break
pLMS[e] = name-1
if name < LMSn:
sublst = [pLMS[e] for e in LMS if e < L-1]
ret = sais_rec(sublst, name-1)
LMS = list(map(LMS.__getitem__, reversed(ret)))
else:
LMS = [e for e in reversed(res) if isLMS[e]]
res = [-1] * L
cc_it = [iter(range(e-1, s-1, -1)) for s, e in zip(cstart, cend)]
for e in LMS:
res[next(cc_it[lst[e]])] = e
cs_it = [iter(range(s, e)) for s, e in zip(cstart, cend)]
ce_it = [iter(range(e-1, s-1, -1)) for s, e in zip(cstart, cend)]
for e in res:
if e > 0 and not t[e-1]:
res[next(cs_it[lst[e-1]])] = e-1
for e in reversed(res):
if e > 0 and t[e-1]:
res[next(ce_it[lst[e-1]])] = e-1
return res
# Longest Common Prefix
# (文字列s, 文字列長n, Suffix Array)を引数として与える
def LCP(s, n, sa):
lcp = [-1]*(n+1)
rank = [0]*(n+1)
for i in range(n+1): rank[sa[i]] = i
h = 0
lcp[0] = 0
for i in range(n):
j = sa[rank[i] - 1]
if h > 0: h -= 1
while j+h < n and i+h < n and s[j+h]==s[i+h]:
h += 1
lcp[rank[i] - 1] = h
return lcp
#https://github.com/shakayami/ACL-for-python/blob/master/convolution.py
class FFT():
def primitive_root_constexpr(self,m):
if m==2:return 1
if m==167772161:return 3
if m==469762049:return 3
if m==754974721:return 11
if m==998244353:return 3
divs=[0]*20
divs[0]=2
cnt=1
x=(m-1)//2
while(x%2==0):x//=2
i=3
while(i*i<=x):
if (x%i==0):
divs[cnt]=i
cnt+=1
while(x%i==0):
x//=i
i+=2
if x>1:
divs[cnt]=x
cnt+=1
g=2
while(1):
ok=True
for i in range(cnt):
if pow(g,(m-1)//divs[i],m)==1:
ok=False
break
if ok:
return g
g+=1
def bsf(self,x):
res=0
while(x%2==0):
res+=1
x//=2
return res
rank2=0
root=[]
iroot=[]
rate2=[]
irate2=[]
rate3=[]
irate3=[]
def __init__(self,MOD):
self.mod=MOD
self.g=self.primitive_root_constexpr(self.mod)
self.rank2=self.bsf(self.mod-1)
self.root=[0 for i in range(self.rank2+1)]
self.iroot=[0 for i in range(self.rank2+1)]
self.rate2=[0 for i in range(self.rank2)]
self.irate2=[0 for i in range(self.rank2)]
self.rate3=[0 for i in range(self.rank2-1)]
self.irate3=[0 for i in range(self.rank2-1)]
self.root[self.rank2]=pow(self.g,(self.mod-1)>>self.rank2,self.mod)
self.iroot[self.rank2]=pow(self.root[self.rank2],self.mod-2,self.mod)
for i in range(self.rank2-1,-1,-1):
self.root[i]=(self.root[i+1]**2)%self.mod
self.iroot[i]=(self.iroot[i+1]**2)%self.mod
prod=1;iprod=1
for i in range(self.rank2-1):
self.rate2[i]=(self.root[i+2]*prod)%self.mod
self.irate2[i]=(self.iroot[i+2]*iprod)%self.mod
prod=(prod*self.iroot[i+2])%self.mod
iprod=(iprod*self.root[i+2])%self.mod
prod=1;iprod=1
for i in range(self.rank2-2):
self.rate3[i]=(self.root[i+3]*prod)%self.mod
self.irate3[i]=(self.iroot[i+3]*iprod)%self.mod
prod=(prod*self.iroot[i+3])%self.mod
iprod=(iprod*self.root[i+3])%self.mod
def butterfly(self,a):
n=len(a)
h=(n-1).bit_length()
LEN=0
while(LEN<h):
if (h-LEN==1):
p=1<<(h-LEN-1)
rot=1
for s in range(1<<LEN):
offset=s<<(h-LEN)
for i in range(p):
l=a[i+offset]
r=a[i+offset+p]*rot
a[i+offset]=(l+r)%self.mod
a[i+offset+p]=(l-r)%self.mod
rot*=self.rate2[(~s & -~s).bit_length()-1]
rot%=self.mod
LEN+=1
else:
p=1<<(h-LEN-2)
rot=1
imag=self.root[2]
for s in range(1<<LEN):
rot2=(rot*rot)%self.mod
rot3=(rot2*rot)%self.mod
offset=s<<(h-LEN)
for i in range(p):
a0=a[i+offset]
a1=a[i+offset+p]*rot
a2=a[i+offset+2*p]*rot2
a3=a[i+offset+3*p]*rot3
a1na3imag=(a1-a3)%self.mod*imag
a[i+offset]=(a0+a2+a1+a3)%self.mod
a[i+offset+p]=(a0+a2-a1-a3)%self.mod
a[i+offset+2*p]=(a0-a2+a1na3imag)%self.mod
a[i+offset+3*p]=(a0-a2-a1na3imag)%self.mod
rot*=self.rate3[(~s & -~s).bit_length()-1]
rot%=self.mod
LEN+=2
def butterfly_inv(self,a):
n=len(a)
h=(n-1).bit_length()
LEN=h
while(LEN):
if (LEN==1):
p=1<<(h-LEN)
irot=1
for s in range(1<<(LEN-1)):
offset=s<<(h-LEN+1)
for i in range(p):
l=a[i+offset]
r=a[i+offset+p]
a[i+offset]=(l+r)%self.mod
a[i+offset+p]=(l-r)*irot%self.mod
irot*=self.irate2[(~s & -~s).bit_length()-1]
irot%=self.mod
LEN-=1
else:
p=1<<(h-LEN)
irot=1
iimag=self.iroot[2]
for s in range(1<<(LEN-2)):
irot2=(irot*irot)%self.mod
irot3=(irot*irot2)%self.mod
offset=s<<(h-LEN+2)
for i in range(p):
a0=a[i+offset]
a1=a[i+offset+p]
a2=a[i+offset+2*p]
a3=a[i+offset+3*p]
a2na3iimag=(a2-a3)*iimag%self.mod
a[i+offset]=(a0+a1+a2+a3)%self.mod
a[i+offset+p]=(a0-a1+a2na3iimag)*irot%self.mod
a[i+offset+2*p]=(a0+a1-a2-a3)*irot2%self.mod
a[i+offset+3*p]=(a0-a1-a2na3iimag)*irot3%self.mod
irot*=self.irate3[(~s & -~s).bit_length()-1]
irot%=self.mod
LEN-=2
def convolution(self,a,b):
n=len(a);m=len(b)
if not(a) or not(b):
return []
if min(n,m)<=40:
res=[0]*(n+m-1)
for i in range(n):
for j in range(m):
res[i+j]+=a[i]*b[j]
res[i+j]%=self.mod
return res
z=1<<((n+m-2).bit_length())
a=a+[0]*(z-n)
b=b+[0]*(z-m)
self.butterfly(a)
self.butterfly(b)
c=[(a[i]*b[i])%self.mod for i in range(z)]
self.butterfly_inv(c)
iz=pow(z,self.mod-2,self.mod)
for i in range(n+m-1):
c[i]=(c[i]*iz)%self.mod
return c[:n+m-1]
def nibun(f):
left,right=-1,N-1
while right-left>1:
mid=(right+left)//2
if f(mid):
left=mid
else:
right=mid
return right
def isok(n):
pos=sa[n]
if S[pos:].upper()<T.upper():
return True
return False
def isok2(n):
pos=sa[n]
if S[pos:].upper()<T.upper()+'z':
return True
return False
N,M,K=map(int,input().split())
S=input()
T=input()
sa=sais(S.upper())
#print(sa)
one=nibun(isok)
two=nibun(isok2)
#print(one,two)
s=[]
t=[]
for si in S:
if si.isupper():
s.append(1)
else:
s.append(-1)
for si in T:
if si.isupper():
t.append(1)
else:
t.append(-1)
fft=FFT(998244353)
fa=fft.convolution(s,t)
ans=0
for i in range(one,two):
tmp=fa[sa[i]]
if tmp>=10**8:
tmp-=998244353
if M>tmp>=M-K*2:
ans+=1
print(ans)