結果
問題 | No.2361 Many String Compare Queries |
ユーザー |
![]() |
提出日時 | 2023-11-03 21:58:10 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,061 ms / 2,500 ms |
コード長 | 8,784 bytes |
コンパイル時間 | 297 ms |
コンパイル使用メモリ | 82,304 KB |
実行使用メモリ | 160,628 KB |
最終ジャッジ日時 | 2024-09-25 20:13:17 |
合計ジャッジ時間 | 7,915 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 14 |
ソースコード
import sysreadline=sys.stdin.readlinedef SA_IS(lst,compressed=False):N=len(lst)if not compressed:decomp=sorted(list(set(lst)))comp={x:i for i,x in enumerate(decomp)}lst=[comp[s]+1 for s in lst]+[0]else:lst=[s+1 for s in lst]+[0]def induced_sort(N,lst,type,LMS,bucket_count,sorted_LMS_index=None):buckets_left=[[] for b in range(bucket_count)]buckets_right=[[] for b in range(bucket_count)]if sorted_LMS_index==None:for i in LMS:buckets_right[lst[i]].append(i)else:for i in sorted_LMS_index[::-1]:buckets_right[lst[LMS[i]]].append(LMS[i])for b in range(bucket_count):for i in buckets_left[b]:if i and type[i-1]=="L":buckets_left[lst[i-1]].append(i-1)for i in buckets_right[b][::-1]:if i and type[i-1]=="L":buckets_left[lst[i-1]].append(i-1)buckets_right[b]=[]for b in range(bucket_count-1,-1,-1):for i in buckets_right[b]:if i and type[i-1]=="S":buckets_right[lst[i-1]].append(i-1)for i in buckets_left[b][::-1]:if i and type[i-1]=="S":buckets_right[lst[i-1]].append(i-1)suffix_array=[N]for b in range(1,bucket_count):suffix_array+=buckets_left[b]+buckets_right[b][::-1]return suffix_arraystack=[]while N>=1:type=[None]*(N+1)type[N]="S"for i in range(N-1,-1,-1):if lst[i]<lst[i+1]:type[i]="S"elif lst[i]>lst[i+1]:type[i]="L"else:type[i]=type[i+1]LMS=[i for i in range(1,N) if type[i-1]=="L" and type[i]=="S"]+[N]bucket_count=max(lst)+1stack.append((N,lst,type,LMS,bucket_count))suffix_array=induced_sort(N,lst,type,LMS,bucket_count)LMS_substring=[None]*(N+1)for i in range(len(LMS)-1):LMS_substring[LMS[i]]=lst[LMS[i]:LMS[i+1]]LMS_substring[N]=lst[N:N+1]num=0prev=[0]for i in suffix_array:if LMS_substring[i]!=None:if prev!=LMS_substring[i]:prev=LMS_substring[i]num+=1LMS_substring[i]=numlst=[LMS_substring[i] for i in LMS]N=len(lst)-1sorted_LMS_index=[0]for N,lst,type,LMS,bucket_count in stack[::-1]:suffix_array=induced_sort(N,lst,type,LMS,bucket_count,sorted_LMS_index)sorted_LMS_index=suffix_arraysuffix_array=suffix_array[1:]return suffix_arraydef LCP(lst,suffix_array):N=len(lst)idx=[None]*Nfor i in range(N):idx[suffix_array[i]]=ilcp=[None]*(N-1)r=0for l in range(N):if idx[l]==N-1:continuell=suffix_array[idx[l]+1]while r<l or r<N and ll+r-l<N and lst[r]==lst[ll+r-l]:r+=1lcp[idx[l]]=r-lreturn lcpclass Segment_Tree:def __init__(self,N,f,e,lst=None,dynamic=False):self.f=fself.e=eself.N=Nif dynamic:self.segment_tree=defaultdict(lambda:self.e)else:if lst==None:self.segment_tree=[self.e]*2*self.Nelse:assert len(lst)<=self.Nself.segment_tree=[self.e]*self.N+[x for x in lst]+[self.e]*(N-len(lst))for i in range(self.N-1,0,-1):self.segment_tree[i]=self.f(self.segment_tree[i<<1],self.segment_tree[i<<1|1])def __getitem__(self,i):if type(i)==int:if -self.N<=i<0:return self.segment_tree[i+self.N*2]elif 0<=i<self.N:return self.segment_tree[i+self.N]else:raise IndexError("list index out of range")else:a,b,c=i.start,i.stop,i.stepif a==None:a=self.Nelse:a+=self.Nif b==None:b=self.N*2else:b+=self.Nreturn self.segment_tree[slice(a,b,c)]def __setitem__(self,i,x):if -self.N<=i<0:i+=self.N*2elif 0<=i<self.N:i+=self.Nelse:raise IndexError("list index out of range")self.segment_tree[i]=xwhile i>1:i>>= 1self.segment_tree[i]=self.f(self.segment_tree[i<<1],self.segment_tree[i<<1|1])def Build(self,lst):for i,x in enumerate(lst,self.N):self.segment_tree[i]=xfor i in range(self.N-1,0,-1):self.segment_tree[i]=self.f(self.segment_tree[i<<1],self.segment_tree[i<<1|1])def Fold(self,L=None,R=None):if L==None:L=self.Nelse:L+=self.Nif R==None:R=self.N*2else:R+=self.NvL=self.evR=self.ewhile L<R:if L&1:vL=self.f(vL,self.segment_tree[L])L+=1if R&1:R-=1vR=self.f(self.segment_tree[R],vR)L>>=1R>>=1return self.f(vL,vR)def Fold_Index(self,L=None,R=None):if L==None:L=self.Nelse:L+=self.Nif R==None:R=self.N*2else:R+=self.Nif L==R:return Nonex=self.Fold(L-self.N,R-self.N)while L<R:if L&1:if self.segment_tree[L]==x:i=LbreakL+=1if R&1:R-=1if self.segment_tree[R]==x:i=RbreakL>>=1R>>=1while i<self.N:if self.segment_tree[i]==self.segment_tree[i<<1]:i<<=1else:i<<=1i|=1i-=self.Nreturn idef Bisect_Right(self,L=None,f=None):if L==self.N:return self.Nif L==None:L=0L+=self.Nvl=self.evr=self.el,r=L,self.N*2while l<r:if l&1:vl=self.f(vl,self.segment_tree[l])l+=1if r&1:r-=1vr=self.f(self.segment_tree[r],vr)l>>=1r>>=1if f(self.f(vl,vr)):return self.Nv=self.ewhile True:while L%2==0:L>>=1vv=self.f(v,self.segment_tree[L])if f(vv):v=vvL+=1else:while L<self.N:L<<=1vv=self.f(v,self.segment_tree[L])if f(vv):v=vvL+=1return L-self.Ndef Bisect_Left(self,R=None,f=None):if R==0:return 0if R==None:R=self.NR+=self.Nvl=self.evr=self.el,r=self.N,Rwhile l<r:if l&1:vl=self.f(vl,self.segment_tree[l])l+=1if r&1:r-=1vr=self.f(self.segment_tree[r],vr)l>>=1r>>=1if f(self.f(vl,vr)):return 0v=self.ewhile True:R-=1while R>1 and R%2:R>>=1vv=self.f(self.segment_tree[R],v)if f(vv):v=vvelse:while R<self.N:R=2*R+1vv=self.f(self.segment_tree[R],v)if f(vv):v=vvR-=1return R+1-self.Ndef __str__(self):return "["+", ".join(map(str,self.segment_tree[self.N:]))+"]"N,Q=map(int,readline().split())S=readline().rstrip()inf=1<<30SA=SA_IS(S)lcp=LCP(S,SA)ST_min=Segment_Tree(N-1,min,inf,lcp)ST_sum=Segment_Tree(N,lambda x,y:x+y,0,[N-i for i in SA])idx=[None]*Nfor i in range(N):idx[SA[i]]=idp=[None]*Ndp[N-1]=0for i in range(N-2,-1,-1):r=ST_min.Bisect_Right(i,lambda le:le>=lcp[i])dp[i]=dp[r]+(r-i)*lcp[i]for q in range(Q):L,R=map(int,readline().split())L-=1i=idx[L]l=ST_min.Bisect_Left(i,lambda le:le>=R-L)r=ST_min.Bisect_Right(i,lambda le:le>=R-L)+1ans=ST_sum.Fold(0,l)+(i-l)*(R-L-1)+R-L-1+(r-i-1)*(R-L-1)+dp[r-1]print(ans)