結果
問題 | No.2626 Similar But Different Name |
ユーザー |
![]() |
提出日時 | 2024-02-10 00:00:05 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 884 ms / 3,000 ms |
コード長 | 8,152 bytes |
コンパイル時間 | 339 ms |
コンパイル使用メモリ | 82,388 KB |
実行使用メモリ | 153,116 KB |
最終ジャッジ日時 | 2024-09-28 16:43:42 |
合計ジャッジ時間 | 18,021 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 35 |
ソースコード
import ioimport sysfrom collections import defaultdict, deque, Counterfrom itertools import permutations, combinations, accumulatefrom heapq import heappush, heappopfrom bisect import bisect_right, bisect_leftfrom math import gcdimport math_INPUT = """\68 2 1aiaIAiAIAI7 3 2aaaaaaaAAA15 2 1DXDXGdXdXgDxDxGDx"""#z algorithmdef z_algorithm(s):N = len(s)Z_alg = [0]*NZ_alg[0] = Ni = 1j = 0while i < N:while i+j < N and s[j] == s[i+j]:j += 1Z_alg[i] = jif j == 0:i += 1continuek = 1while i+k < N and k + Z_alg[k]<j:Z_alg[i+k] = Z_alg[k]k += 1i += kj -= kreturn Z_algclass 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]def input():return sys.stdin.readline()[:-1]def solve(test):N,M,K=map(int, input().split())S=input()T=input()Z=z_algorithm(T.lower()+"_"+S.lower())[-N:]CONV=FFT(998244353)A=[0 if S[i].islower() else 1 for i in range(N)]B=[0 if T[i].islower() else 1 for i in range(M)]s=sum(B)C=CONV.convolution(A,B[::-1])[-N:]# print(Z,C)D=[sum(A[:M])]for i in range(N-M):D.append(D[-1]+A[i+M]-A[i])# print(D)ans=0for i in range(N-M+1):if Z[i]==M and 0<D[i]-2*C[i]+s<=K:ans+=1print(ans)def random_input():from random import randint,shuffleN=randint(1,10)M=randint(1,N)A=list(range(1,M+1))+[randint(1,M) for _ in range(N-M)]shuffle(A)return (" ".join(map(str, [N,M]))+"\n"+" ".join(map(str, A))+"\n")*3def simple_solve():return []def main(test):if test==0:solve(0)elif test==1:sys.stdin = io.StringIO(_INPUT)case_no=int(input())for _ in range(case_no):solve(0)else:for i in range(1000):sys.stdin = io.StringIO(random_input())x=solve(1)y=simple_solve()if x!=y:print(i,x,y)print(*[line for line in sys.stdin],sep='')break#0:提出用、1:与えられたテスト用、2:ストレステスト用main(0)