結果
問題 | No.1099 Range Square Sum |
ユーザー |
![]() |
提出日時 | 2021-09-01 11:04:09 |
言語 | Python3 (3.13.1 + numpy 2.2.1 + scipy 1.14.1) |
結果 |
TLE
|
実行時間 | - |
コード長 | 5,616 bytes |
コンパイル時間 | 481 ms |
コンパイル使用メモリ | 13,056 KB |
実行使用メモリ | 48,804 KB |
最終ジャッジ日時 | 2024-11-27 11:09:41 |
合計ジャッジ時間 | 33,436 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 20 TLE * 10 |
ソースコード
import sysreadline=sys.stdin.readlineclass Lazy_Segment_Tree:def __init__(self,N,f,e,f_act,e_act,operate):self.N=Nself.f=fself.e=eself.f_act=f_actself.e_act=e_actself.operate=operateself.segment_tree=[self.e]*(self.N+self.N)self.segment_tree_act=[self.e_act]*(self.N+self.N)def __getitem__(self,i):if type(i) is int:if -self.N<=i<0:i+=self.N*2elif 0<=i<self.N:i+=self.Nelse:raise IndexError('list index out of range')self.Propagate_Above(i)self.Recalculate_Above(i)return self.Operate_At(i)else:a,b,c=i.start,i.stop,i.stepif a==None or a<-self.N:a=self.Nelif self.N<=a:a=self.N*2elif a<0:a+=self.N*2else:a+=self.Nif b==None or self.N<=b:b=self.N*2elif b<-self.N:b=self.Nelif b<0: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.Propagate_Above(i)self.segment_tree[i]=xself.segment_tree_act[i]=self.e_actself.Recalculate_Above(i)def Operate_At(self,i):return self.operate(self.segment_tree[i],self.segment_tree_act[i])def Propagate_At(self,i):self.segment_tree[i]=self.Operate_At(i)self.segment_tree_act[i<<1]=self.f_act(self.segment_tree_act[i<<1],self.segment_tree_act[i])self.segment_tree_act[i<<1|1]=self.f_act(self.segment_tree_act[i<<1|1],self.segment_tree_act[i])self.segment_tree_act[i]=self.e_actdef Propagate_Above(self,i):H=i.bit_length()-1for h in range(H,0,-1):self.Propagate_At(i>>h)def Recalculate_Above(self,i):while i>1:i>>=1self.segment_tree[i]=self.f(self.Operate_At(i<<1),self.Operate_At(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])self.segment_tree_act=[self.e_act]*(self.N+self.N)def Fold(self,L=None,R=None):L+=self.NR+=self.Nself.Propagate_Above(L//(L&-L))self.Propagate_Above(R//(R&-R)-1)vL=self.evR=self.ewhile L<R:if L&1:vL=self.f(vL,self.Operate_At(L))L+=1if R&1:R-=1vR=self.f(self.Operate_At(R),vR)L>>=1R>>=1return self.f(vL,vR)def Fold_Index(self,L=None,R=None):if L==None or L<-self.N:L=self.Nelif self.N<=L:L=self.N*2elif L<0:L+=self.N*2else:L+=self.Nif R==None or self.N<=R:R=self.N*2elif R<-self.N:R=self.Nelif R<0: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 Operate_Range(self,a,L=None,R=None):L+=self.NR+=self.NL0=L//(L&-L)R0=R//(R&-R)-1self.Propagate_Above(L0)self.Propagate_Above(R0)while L<R:if L&1:self.segment_tree_act[L]=self.f_act(self.segment_tree_act[L],a)L+=1if R&1:R-=1self.segment_tree_act[R]=self.f_act(self.segment_tree_act[R],a)L>>=1R>>=1self.Recalculate_Above(L0)self.Recalculate_Above(R0)def Update(self):for i in range(1,self.N):self.Propagate_At(i)for i in range(self.N,self.N*2):self.segment_tree[i]=self.Operate_At(i)self.segment_tree_act[i]=self.e_actfor 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])N=int(readline())def f(tpl0,tpl1):x0,y0,z0=tpl0x1,y1,z1=tpl1return (x0+x1,y0+y1,z0+z1)e=(0,0,1)def f_act(a,b):return a+be_act=0def operate(tpl,a):x,y,z=tplreturn (x+z*a,y+2*x*a+z*a**2,z)LST=Lazy_Segment_Tree(N,f,e,f_act,e_act,operate)A=list(map(int,readline().split()))for i,a in enumerate(A):LST.Operate_Range(a,i,i+1)Q=int(readline())for _ in range(Q):query=tuple(map(int,readline().split()))if query[0]==1:_,l,r,x=queryl-=1;r-=1LST.Operate_Range(x,l,r+1)else:_,l,r=queryl-=1;r-=1ans=LST.Fold(l,r+1)[1]print(ans)