結果
| 問題 |
No.855 ヘビの日光浴
|
| コンテスト | |
| ユーザー |
 vwxyz
|
| 提出日時 | 2024-04-13 12:47:29 |
| 言語 | PyPy3 (7.3.15) |
| 結果 |
AC
|
| 実行時間 | 932 ms / 3,153 ms |
| コード長 | 7,952 bytes |
| コンパイル時間 | 262 ms |
| コンパイル使用メモリ | 82,304 KB |
| 実行使用メモリ | 137,452 KB |
| 最終ジャッジ日時 | 2024-10-03 00:02:56 |
| 合計ジャッジ時間 | 23,742 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 92 |
ソースコード
from collections import defaultdict
import bisect
class Segment_Tree:
def __init__(self,N,f,e,lst=None,dynamic=False):
self.f=f
self.e=e
self.N=N
if dynamic:
self.segment_tree=defaultdict(lambda:self.e)
else:
if lst==None:
self.segment_tree=[self.e]*2*self.N
else:
assert len(lst)<=self.N
self.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.step
if a==None:
a=self.N
else:
a+=self.N
if b==None:
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.segment_tree[i]=x
while i>1:
i>>= 1
self.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]=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])
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
vL=self.e
vR=self.e
while L<R:
if L&1:
vL=self.f(vL,self.segment_tree[L])
L+=1
if R&1:
R-=1
vR=self.f(self.segment_tree[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 Bisect_Right(self,L=None,f=None):
if L==self.N:
return self.N
if L==None:
L=0
L+=self.N
vl=self.e
vr=self.e
l,r=L,self.N*2
while l<r:
if l&1:
vl=self.f(vl,self.segment_tree[l])
l+=1
if r&1:
r-=1
vr=self.f(self.segment_tree[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
vv=self.f(v,self.segment_tree[L])
if f(vv):
v=vv
L+=1
else:
while L<self.N:
L<<=1
vv=self.f(v,self.segment_tree[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
vl=self.e
vr=self.e
l,r=self.N,R
while l<r:
if l&1:
vl=self.f(vl,self.segment_tree[l])
l+=1
if r&1:
r-=1
vr=self.f(self.segment_tree[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
vv=self.f(self.segment_tree[R],v)
if f(vv):
v=vv
else:
while R<self.N:
R=2*R+1
vv=self.f(self.segment_tree[R],v)
if f(vv):
v=vv
R-=1
return R+1-self.N
def __str__(self):
return "["+", ".join(map(str,self.segment_tree[self.N:]))+"]"
def Compress(lst):
decomp=sorted(list(set(lst)))
comp={x:i for i,x in enumerate(decomp)}
return comp,decomp
W,H,N=map(int,input().split())
XYL=[]
X,Y=[],[]
for i in range(N):
x,y,l=map(int,input().split())
if x in (0,H+1):
Y.append(y)
l=min(l,H+1)
else:
X.append(x)
l=min(l,W+1)
XYL.append((x,y,l))
compX,decompX=Compress(X)
compY,decompY=Compress(Y)
leX=len(compX)
leY=len(compY)
inf=1<<60
STX0=Segment_Tree(leX,max,-inf,[0]*leX)
STX1=Segment_Tree(leX,max,-inf,[0]*leX)
STY0=Segment_Tree(leY,max,-inf,[0]*leY)
STY1=Segment_Tree(leY,max,-inf,[0]*leY)
for x,y,L in XYL:
if x==0:
j=compY[y]
L+=STY0[j]
r0=STX0.Bisect_Right(0,lambda ma:ma<=y-1)
r1=STX1.Bisect_Right(0,lambda ma:ma<=W-y)
if r0<r1 and decompX[r0]<=L and STY1[j]<H+1-decompX[r0]:
STX0[r0]=0
STY0[j]=0
elif r1<r0 and decompX[r1]<=L and STY1[j]<H+1-decompX[r1]:
STX1[r1]=0
STY0[j]=0
elif L+STY1[j]>=H+1:
STY0[j]=0
STY1[j]=0
elif L<H+1:
STY0[j]=L
else:
STY0[j]=0
elif x==H+1:
j=compY[y]
L+=STY1[j]
l0=STX0.Bisect_Left(leX,lambda ma:ma<=y-1)
l1=STX1.Bisect_Left(leX,lambda ma:ma<=W-y)
if l0>l1 and H+1-decompX[l0-1]<=L and STY0[j]<decompX[l0-1]:
STX0[l0-1]=0
STY1[j]=0
elif l1>l0 and H+1-decompX[l1-1]<=L and STY0[j]<decompX[l1-1]:
STX1[l1-1]=0
STY1[j]=0
elif STY0[j]+L>=H+1:
STY1[j]=0
STY0[j]=0
elif L<H+1:
STY1[j]=L
else:
STY1[j]=0
elif y==0:
i=compX[x]
L+=STX0[i]
r0=STY0.Bisect_Right(0,lambda ma:ma<=x-1)
r1=STY1.Bisect_Right(0,lambda ma:ma<=H-x)
if r0<r1 and decompY[r0]<=L and STX1[i]<W+1-decompY[r0]:
STY0[r0]=0
STX0[i]=0
elif r1<r0 and decompY[r1]<=L and STX1[i]<W+1-decompY[r1]:
STY1[r1]=0
STX0[i]=0
elif L+STX1[i]>=W+1:
STX0[i]=0
STX1[i]=0
elif L<W+1:
STX0[i]=L
else:
STX0[i]=0
elif y==W+1:
i=compX[x]
L+=STX1[i]
l0=STY0.Bisect_Left(leY,lambda ma:ma<=x-1)
l1=STY1.Bisect_Left(leY,lambda ma:ma<=H-x)
if l0>l1 and W+1-decompY[l0-1]<=L and STX0[i]<decompY[l0-1]:
STY0[l0-1]=0
STX1[i]=0
elif l1>l0 and W+1-decompY[l1-1]<=L and STX0[i]<decompY[l1-1]:
STY1[l1-1]=0
STX1[i]=0
elif STX0[i]+L>=W+1:
STX1[i]=0
STX0[i]=0
elif L<W+1:
STX1[i]=L
else:
STX1[i]=0
ans=sum(STX0[x]+STX1[x] for x in range(leX))+sum(STY0[y]+STY1[y] for y in range(leY))
print(ans)