結果
問題 | No.631 Noelちゃんと電車旅行 |
ユーザー | vwxyz |
提出日時 | 2022-03-24 04:16:43 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 543 ms / 2,000 ms |
コード長 | 8,843 bytes |
コンパイル時間 | 606 ms |
コンパイル使用メモリ | 82,172 KB |
実行使用メモリ | 94,588 KB |
最終ジャッジ日時 | 2024-10-12 09:11:53 |
合計ジャッジ時間 | 9,618 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 385 ms
78,900 KB |
testcase_01 | AC | 540 ms
94,080 KB |
testcase_02 | AC | 533 ms
94,464 KB |
testcase_03 | AC | 543 ms
94,588 KB |
testcase_04 | AC | 542 ms
94,336 KB |
testcase_05 | AC | 537 ms
94,208 KB |
testcase_06 | AC | 300 ms
82,036 KB |
testcase_07 | AC | 232 ms
85,104 KB |
testcase_08 | AC | 436 ms
90,496 KB |
testcase_09 | AC | 491 ms
83,840 KB |
testcase_10 | AC | 377 ms
89,980 KB |
testcase_11 | AC | 365 ms
86,764 KB |
testcase_12 | AC | 413 ms
92,288 KB |
testcase_13 | AC | 398 ms
79,856 KB |
testcase_14 | AC | 258 ms
78,100 KB |
testcase_15 | AC | 365 ms
80,652 KB |
testcase_16 | AC | 58 ms
66,944 KB |
testcase_17 | AC | 56 ms
66,560 KB |
testcase_18 | AC | 56 ms
67,072 KB |
testcase_19 | AC | 55 ms
66,944 KB |
testcase_20 | AC | 56 ms
66,944 KB |
ソースコード
import sys readline=sys.stdin.readline class Lazy_Segment_Tree: def __init__(self,N,f,e,f_act,e_act,operate,lst=None): self.N=N self.f=f self.e=e self.f_act=f_act self.e_act=e_act self.operate=operate self.segment_tree=[self.e]*(self.N+self.N) self.segment_tree_act=[self.e_act]*(self.N+self.N) if lst!=None: for i,x in enumerate(lst): self.segment_tree[i+self.N]=x 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]) 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*2 elif 0<=i<self.N: i+=self.N else: 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.step if a==None or a<-self.N: a=self.N elif self.N<=a: a=self.N*2 elif a<0: a+=self.N*2 else: a+=self.N if b==None or self.N<=b: b=self.N*2 elif b<-self.N: b=self.N elif b<0: b+=self.N*2 else: b+=self.N return self.segment_tree[slice(a,b,c)] def __setitem__(self,i,x): if -self.N<=i<0: i+=self.N*2 elif 0<=i<self.N: i+=self.N else: raise IndexError('list index out of range') self.Propagate_Above(i) self.segment_tree[i]=x self.segment_tree_act[i]=self.e_act self.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_act def Propagate_Above(self,i): H=i.bit_length()-1 for h in range(H,0,-1): self.Propagate_At(i>>h) def Recalculate_Above(self,i): while i>1: i>>=1 self.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.segment_tree[i+self.N]=x 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]) self.segment_tree_act=[self.e_act]*(self.N+self.N) def Fold(self,L=None,R=None): if L==None: L=self.N else: L+=self.N if R==None: R=self.N*2 else: R+=self.N self.Propagate_Above(L//(L&-L)) self.Propagate_Above(R//(R&-R)-1) vL=self.e vR=self.e while L<R: if L&1: vL=self.f(vL,self.Operate_At(L)) L+=1 if R&1: R-=1 vR=self.f(self.Operate_At(R),vR) L>>=1 R>>=1 return self.f(vL,vR) def Fold_Index(self,L=None,R=None): if L==None: L=self.N else: L+=self.N if R==None: R=self.N*2 else: R+=self.N if L==R: return None x=self.Fold(L-self.N,R-self.N) while L<R: if L&1: if self.segment_tree[L]==x: i=L break L+=1 if R&1: R-=1 if self.segment_tree[R]==x: i=R break L>>=1 R>>=1 while i<self.N: if self.segment_tree[i]==self.segment_tree[i<<1]: i<<=1 else: i<<=1 i|=1 i-=self.N return i def Operate_Range(self,a,L=None,R=None): if L==None: L=self.N else: L+=self.N if R==None: R=self.N*2 else: R+=self.N L0=L//(L&-L) R0=R//(R&-R)-1 self.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+=1 if R&1: R-=1 self.segment_tree_act[R]=self.f_act(self.segment_tree_act[R],a) L>>=1 R>>=1 self.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_act 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 Bisect_Right(self,L=None,f=None): if L==self.N: return self.N if L==None: L=0 L+=self.N self.Propagate_Above(L//(L&-L)) self.Propagate_Above(self.N//(self.N&-self.N)-1) l,r=L,self.N*2 vl=self.e vr=self.e while l<r: if l&1: vl=self.f(vl,self.Operate_At(l)) l+=1 if r&1: r-=1 vr=self.f(self.Operate_At(r),vr) l>>=1 r>>=1 if f(self.f(vl,vr)): return self.N v=self.e while True: while L%2==0: L>>=1 self.Propagate_Above(L) vv=self.f(v,self.Operate_At(L)) if f(vv): v=vv L+=1 else: while L<self.N: L<<=1 self.Propagate_Above(L) vv=self.f(v,self.Operate_At(L)) if f(vv): v=vv L+=1 return L-self.N def Bisect_Left(self,R=None,f=None): if R==0: return 0 if R==None: R=self.N R+=self.N self.Propagate_Above(self.N//(self.N&-self.N)) self.Propagate_Above(R//(R&-R)-1) vl=self.e vr=self.e l,r=self.N,R while l<r: if l&1: vl=self.f(vl,self.Operate_At(l)) l+=1 if r&1: r-=1 vr=self.f(self.Operate_At(r),vr) l>>=1 r>>=1 if f(self.f(vl,vr)): return 0 v=self.e while True: R-=1 while R>1 and R%2: R>>=1 self.Propagate_Above(R) vv=self.f(self.Operate_At(R),v) if f(vv): v=vv else: while R<self.N: R=2*R+1 self.Propagate_Above(R) vv=self.f(self.Operate_At(R),v) if f(vv): v=vv R-=1 return R+1-self.N def __str__(self): import copy segment_tree=copy.deepcopy(self.segment_tree) segment_tree_act=copy.deepcopy(self.segment_tree_act) for i in range(1,self.N): segment_tree[i]=self.operate(segment_tree[i],segment_tree_act[i]) segment_tree_act[i<<1]=self.f_act(segment_tree_act[i<<1],segment_tree_act[i]) segment_tree_act[i<<1|1]=self.f_act(segment_tree_act[i<<1|1],segment_tree_act[i]) segment_tree_act[i]=self.e_act for i in range(self.N,self.N*2): segment_tree[i]=self.operate(segment_tree[i],segment_tree_act[i]) segment_tree_act[i]=self.e_act for i in range(self.N-1,0,-1): segment_tree[i]=self.f(segment_tree[i<<1],segment_tree[i<<1|1]) return '['+', '.join(map(str,[self.operate(x,a) for x,a in zip(segment_tree[self.N:],segment_tree_act[self.N:])]))+']' N=int(readline()) T=list(map(int,readline().split())) for i in range(N-1): T[i]-=3*i inf=1<<60 f=max e=-inf def f_act(a,b): return a+b e_act=0 def operate(x,a): return x+a LST=Lazy_Segment_Tree(N-1,f,e,f_act,e_act,operate,T) M=int(readline()) for _ in range(M): L,R,D=map(int,readline().split()) L-=1 LST.Operate_Range(D,L,R) ans=3*(N-1)+LST.Fold() print(ans)