結果
| 問題 |
No.255 Splarrraaay ｽﾌﾟﾗｰﾚｪｰｰｲ
|
| コンテスト | |
| ユーザー |
 vwxyz
|
| 提出日時 | 2024-04-11 02:45:53 |
| 言語 | PyPy2 (7.3.15) |
| 結果 |
MLE
|
| 実行時間 | - |
| コード長 | 9,740 bytes |
| コンパイル時間 | 1,090 ms |
| コンパイル使用メモリ | 76,352 KB |
| 実行使用メモリ | 269,556 KB |
| 最終ジャッジ日時 | 2024-10-02 21:17:19 |
| 合計ジャッジ時間 | 28,763 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 1 MLE * 9 |
ソースコード
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
self.Propagate_Above(L)
while True:
while L%2==0:
L>>=1
vv=self.f(v,self.Operate_At(L))
if f(vv):
v=vv
L+=1
else:
while L<self.N:
self.Propagate_At(L)
L<<=1
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
self.Propagate_Above(R-1)
while True:
R-=1
while R>1 and R%2:
R>>=1
vv=self.f(self.Operate_At(R),v)
if f(vv):
v=vv
else:
while R<self.N:
self.Propagate_At(R)
R=(R<<1)|1
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())
mod=10**18+9
def f(tpl0,tpl1):
return tuple((x+y)%mod for x,y in zip(tpl0,tpl1))
e=(0,)*6
def f_act(a_tpl,b_tpl):
for i in range(5):
if b_tpl[i]:
return tuple((a_tpl[i]+b_tpl[i])%mod if i==j else 0 for j in range(5))
return a_tpl
e_act=(0,)*5
def operate(tpl,a_tpl):
for i in range(5):
if a_tpl[i]:
return (0,)*i+((tpl[i]+a_tpl[i]*tpl[5]%mod)%mod,)+(0,)*(4-i)+(tpl[5],)
return tpl
ans_lst=[0]*5
Q=int(readline())
X,L,R=[],[],[]
bound=[0,1<<60]
for _ in range(Q):
x,l,r=map(int,readline().split())
r+=1
X.append(x)
L.append(l)
R.append(r)
bound.append(l)
bound.append(r)
bound=sorted(list(set(bound)))
comp={b:i for i,b in enumerate(bound)}
le=len(comp)-1
for q in range(Q):
L[q]=comp[L[q]]
R[q]=comp[R[q]]
del comp
LST=Lazy_Segment_Tree(le,f,e,f_act,e_act,operate,[(0,)*5+(bound[i+1]-bound[i],) for i in range(le)])
del bound
for x,l,r in zip(X[:10000],L,R):
if x:
x-=1
LST.Operate_Range((0,)*x+(1,)+(0,)*(4-x),l,r)
else:
tpl=LST.Fold(l,r)[:5]
m=max(tpl)
if tpl.count(m)>=2:
continue
i=tpl.index(m)
ans_lst[i]+=m
tpl=LST.Fold()[:5]
for i in range(5):
ans_lst[i]+=tpl[i]
print(" ".join(map(str,ans_lst)))