結果
問題 | No.2626 Similar But Different Name |
ユーザー |
|
提出日時 | 2024-02-10 08:53:32 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 7,618 bytes |
コンパイル時間 | 273 ms |
コンパイル使用メモリ | 82,356 KB |
実行使用メモリ | 139,464 KB |
最終ジャッジ日時 | 2024-09-28 17:02:24 |
合計ジャッジ時間 | 58,098 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 33 TLE * 2 |
ソースコード
import collections,sys,math,functools,operator,itertools,bisect,heapq,decimal,string,time,randomclass FFT():def primitive_root_constexpr(self,m):if m==2:return 1if m==167772161:return 3if m==469762049:return 3if m==754974721:return 11if m==998244353:return 3divs=[0]*20divs[0]=2cnt=1x=(m-1)//2while(x%2==0):x//=2i=3while(i*i<=x):if (x%i==0):divs[cnt]=icnt+=1while(x%i==0):x//=ii+=2if x>1:divs[cnt]=xcnt+=1g=2while(1):ok=Truefor i in range(cnt):if pow(g,(m-1)//divs[i],m)==1:ok=Falsebreakif ok:return gg+=1def bsf(self,x):res=0while(x%2==0):res+=1x//=2return resrank2=0root=[]iroot=[]rate2=[]irate2=[]rate3=[]irate3=[]def __init__(self,MOD):self.mod=MODself.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.modself.iroot[i]=(self.iroot[i+1]**2)%self.modprod=1;iprod=1for i in range(self.rank2-1):self.rate2[i]=(self.root[i+2]*prod)%self.modself.irate2[i]=(self.iroot[i+2]*iprod)%self.modprod=(prod*self.iroot[i+2])%self.modiprod=(iprod*self.root[i+2])%self.modprod=1;iprod=1for i in range(self.rank2-2):self.rate3[i]=(self.root[i+3]*prod)%self.modself.irate3[i]=(self.iroot[i+3]*iprod)%self.modprod=(prod*self.iroot[i+3])%self.modiprod=(iprod*self.root[i+3])%self.moddef butterfly(self,a):n=len(a)h=(n-1).bit_length()LEN=0while(LEN<h):if (h-LEN==1):p=1<<(h-LEN-1)rot=1for s in range(1<<LEN):offset=s<<(h-LEN)for i in range(p):l=a[i+offset]r=a[i+offset+p]*rota[i+offset]=(l+r)%self.moda[i+offset+p]=(l-r)%self.modrot*=self.rate2[(~s & -~s).bit_length()-1]rot%=self.modLEN+=1else:p=1<<(h-LEN-2)rot=1imag=self.root[2]for s in range(1<<LEN):rot2=(rot*rot)%self.modrot3=(rot2*rot)%self.modoffset=s<<(h-LEN)for i in range(p):a0=a[i+offset]a1=a[i+offset+p]*rota2=a[i+offset+2*p]*rot2a3=a[i+offset+3*p]*rot3a1na3imag=(a1-a3)%self.mod*imaga[i+offset]=(a0+a2+a1+a3)%self.moda[i+offset+p]=(a0+a2-a1-a3)%self.moda[i+offset+2*p]=(a0-a2+a1na3imag)%self.moda[i+offset+3*p]=(a0-a2-a1na3imag)%self.modrot*=self.rate3[(~s & -~s).bit_length()-1]rot%=self.modLEN+=2def butterfly_inv(self,a):n=len(a)h=(n-1).bit_length()LEN=hwhile(LEN):if (LEN==1):p=1<<(h-LEN)irot=1for 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.moda[i+offset+p]=(l-r)*irot%self.modirot*=self.irate2[(~s & -~s).bit_length()-1]irot%=self.modLEN-=1else:p=1<<(h-LEN)irot=1iimag=self.iroot[2]for s in range(1<<(LEN-2)):irot2=(irot*irot)%self.modirot3=(irot*irot2)%self.modoffset=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.moda[i+offset]=(a0+a1+a2+a3)%self.moda[i+offset+p]=(a0-a1+a2na3iimag)*irot%self.moda[i+offset+2*p]=(a0+a1-a2-a3)*irot2%self.moda[i+offset+3*p]=(a0-a1-a2na3iimag)*irot3%self.modirot*=self.irate3[(~s & -~s).bit_length()-1]irot%=self.modLEN-=2def 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.modreturn resz=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.modreturn c[:n+m-1]#sys.setrecursionlimit(10**9)#sys.set_int_max_str_digits(0)n,m,k = map(int,input().split())s = input()t = input()mod = pow(2,61)-1h = [0 for i in range(n)]for i in range(n-m+1):if i == 0:for j in range(m):if ord('A') <= ord(s[j]) <= ord('Z'):h[0] += (ord(s[j])-ord('A')) * pow(26,j,mod)h[0] %= modelse:h[0] += (ord(s[j])-ord('a')) * pow(26,j,mod)h[0] %= modelse:h[i] = h[i-1] - (ord(s[i-1])-ord('A') if ord('A') <= ord(s[i-1]) <= ord('Z') else ord(s[i-1])-ord('a'))h[i] *= pow(26,mod-2,mod)h[i] += pow(26,m-1,mod) * (ord(s[i+m-1])-ord('A') if ord('A') <= ord(s[i+m-1]) <= ord('Z') else ord(s[i+m-1])-ord('a'))h[i] %= modtval = 0for j in range(m):if ord('A') <= ord(t[j]) <= ord('Z'):tval += (ord(t[j])-ord('A')) * pow(26,j,mod)tval %= modelse:tval += (ord(t[j])-ord('a')) * pow(26,j,mod)tval %= modss = [-1 if ord('A') <= ord(s[j]) <= ord('Z') else 1 for j in range(n)]tt = [-1 if ord('A') <= ord(t[j]) <= ord('Z') else 1 for j in range(m)]tt.reverse()conv = FFT(998244353)st = conv.convolution(ss,tt)ans = 0for i in range(n-m+1):if h[i] == tval:x = st[m-1+i]#print(i,x)if m-2*k <= x <= m-2 or m-2*k <= x-998244353 <= m-2:ans += 1print(ans)