結果

問題 No.318 学学学学学
ユーザー convexineq
提出日時 2020-12-22 23:32:17
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 431 ms / 2,000 ms
コード長 2,537 bytes
コンパイル時間 177 ms
コンパイル使用メモリ 82,200 KB
実行使用メモリ 102,940 KB
最終ジャッジ日時 2024-09-21 14:24:22
合計ジャッジ時間 8,061 ms
ジャッジサーバーID
(参考情報)
judge1 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 26
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

class segment_tree_dual:
def __init__(self, N, compose, funcval, ID_M=None):
self.compose = compose
self.ID_M = ID_M
self.funcval = funcval
self.height = (N-1).bit_length() #
self.N0 = 1<<self.height # >= N
self.laz = [self.ID_M]*(2*self.N0) #
self.val = None #
#
def build(self,initial):
self.val = initial[:]
#laz[k] k laz[k] val
def propagate(self,k):
if self.laz[k] == self.ID_M: return;
if self.N0 <= k:
self.val[k-self.N0] = self.funcval(self.val[k-self.N0], self.laz[k])
self.laz[k] = self.ID_M
else:
self.laz[(k<<1) ] = self.compose(self.laz[(k<<1) ],self.laz[k]);
self.laz[(k<<1)+1] = self.compose(self.laz[(k<<1)+1],self.laz[k]);
self.laz[k] = self.ID_M;
#
def propagate_all(self):
upto = self.N0 + len(self.val)
for i in range(1,upto): self.propagate(i)
# laz[k]
def thrust(self,k):
for i in range(self.height,-1,-1): self.propagate(k>>i)
# [l,r] f
def update(self, L,R,f):
L += self.N0; R += self.N0+1
""""""
#self.thrust(L)
#self.thrust(R-1)
# f
while L < R:
if R & 1:
R -= 1
self.laz[R] = self.compose(self.laz[R],f)
if L & 1:
self.laz[L] = self.compose(self.laz[L],f)
L += 1
L >>= 1; R >>= 1
# values[k]
def point_get(self, k):
res = self.val[k]
k += self.N0
while k:
if self.laz[k] != self.ID_M:
res = self.funcval(res, self.laz[k])
k //= 2
return res
# values[k] = x
def point_set(self, k):
self.thrust(k+self.N0)
self.val[k] = x
n = int(input())
*a, = map(int,input().split())
d = {}
for i,ai in enumerate(a):
if ai in d: d[ai].append(i)
else: d[ai] = [i]
seg = segment_tree_dual(n, max, max, ID_M=0)
seg.build([0]*n)
for k,lst in sorted(d.items()):
lst.sort()
seg.update(lst[0],lst[-1],k)
seg.propagate_all()
print(*seg.val)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0