結果

問題 No.318 学学学学学
ユーザー SI1000-github
提出日時 2022-04-01 22:05:15
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 951 ms / 2,000 ms
コード長 7,295 bytes
コンパイル時間 489 ms
コンパイル使用メモリ 82,224 KB
実行使用メモリ 111,080 KB
最終ジャッジ日時 2024-11-20 09:25:23
合計ジャッジ時間 12,218 ms
ジャッジサーバーID
(参考情報)
judge5 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 26
権限があれば一括ダウンロードができます

ソースコード

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

#!/usr/bin/python
# -*- coding: utf-8 -*-
# import
from sys import stdin, setrecursionlimit
setrecursionlimit(10**8)
# def
def int_map():
return map(int,input().split())
def int_list():
return ['Null']+list(map(int,input().split()))
# N+1
def int_mtx(N):
x = [['Null']+list(map(int, stdin.readline().split())) for _ in range(N)]
x.insert(0,['Null'])
return x
# N+1
# AAAAA
# BBBBB
# CCCCC
#
# '0AAAAA'
# '0BBBBB'
# '0CCCCC'
#
def str_mtx(N):
x = ['0'+stdin.readline()[:-1] for _ in range(N)]
x.insert(0,'0')
return x
# N+1
# AAAAA XXXXX
# BBBBB YYYYY
# CCCCC ZZZZZ
#
# [[['0'],[AAAAA],[XXXXX]],
# [['0'],[BBBBB],[YYYYY]],
# [['0'],[CCCCC],[ZZZZZ]] ]
#
def str_list(N):
x = [['0']+list(map(str, stdin.readline().split())) for _ in range(N)]
x.insert(0,['0'])
return x
# H+1, W+1,
def zero_mtx(H,W):
x = [[0]*(W+1) for i in range(H+1)]
return x
#
def print_space(l):
return print(" ".join([str(x) for x in l[1:]]))
#
# N
def int_mtx_0(N):
x = [list(map(int, stdin.readline().split())) for _ in range(N)]
return x
#
# N+1
def str_mtx_0(N):
x = [list(stdin.readline()[:-1]) for _ in range(N)]
return x
#
#
def print_space_0(l):
return print(" ".join([str(x) for x in l]))
#
# H, W,
def zero_mtx_0(H,W):
x = [[0]*W for i in range(H)]
return x
def int_list_0():
return list(map(int,input().split()))
##
from collections import deque
# from collections import defaultdict
# 使
# import itertools
# 使
# import math
# dict
# import collections
#
# a_copy = deepcopy(a)
# from copy import deepcopy
# main code
class LazySegTree:
def __init__(self, initial_data, SegType, UpdateType):
if SegType == "min":
self.X_f = min; self.X_unit = float('inf')
elif SegType == "max":
self.X_f = max; self.X_unit = -float('inf')
elif SegType == "sum":
def segfunc(x, y):
return x+y
self.X_f = segfunc; self.X_unit = 0
elif SegType == "pro":
def segfunc(x, y):
return x*y
self.X_f = segfunc; self.X_unit = 1
elif SegType == "xor":
def segfunc(x, y):
return x^y
self.X_f = segfunc; self.X_unit = 0
elif SegType == "gcd":
from math import gcd
self.X_f = gcd; self.X_unit = 0
elif SegType == "lcm":
from math import gcd
def lcm(a,b):
return a//gcd(a,b)*b
self.X_f = lcm; self.X_unit = 1
self.A_unit = None
self.N = len(initial_data)
self.X = [self.X_unit] * (self.N + self.N)
self.A = [self.A_unit] * (self.N + self.N)
# A_unit = None
# (A,*) : A = Z + {A_unit}
# a*None = a; a*b = a+b
# a*None = a; a*b = b
# a*b
# X A x@a
if UpdateType == "add":
self.add_or_set = 1
else:
self.add_or_set = 0
def a_b(a, b): # a*b
if a == self.A_unit:
return b
elif b == self.A_unit:
return a
else:
return self.add_or_set*a + b
self.A_f = a_b
def x_a(x, a): # x@a
if a == self.A_unit:
return x
return self.add_or_set*x + a
self.operate = x_a
self.build(initial_data)
def leaf(self):
return self.X[self.N:]
def all_lazy(self):
for i in range(self.N):
self._propagate_at(i)
# for i in range(self.N+1, 2*self.N):
# self._eval_at(i)
# self.A[i] = self.A_unit
def build(self, seq):
for i, x in enumerate(seq, self.N):
self.X[i] = x
for i in range(self.N - 1, 0, -1):
self.X[i] = self.X_f(self.X[i << 1], self.X[i << 1 | 1])
def _eval_at(self, i):
return self.operate(self.X[i], self.A[i])
def _propagate_at(self, i):
self.X[i] = self._eval_at(i)
self.A[2*i] = self.A_f(self.A[2*i], self.A[i])
self.A[2*i+1] = self.A_f(self.A[2*i+1], self.A[i])
self.A[i] = self.A_unit
def _propagate_above(self, i):
H = i.bit_length() - 1
for h in range(H, 0, -1):
self._propagate_at(i >> h)
def _recalc_above(self, i):
while i > 1:
i >>= 1
self.X[i] = self.X_f(self._eval_at(i << 1), self._eval_at(i << 1 | 1))
def set_val(self, i, x):
i += self.N
self._propagate_above(i)
self.X[i] = x
self.A[i] = self.A_unit
self._recalc_above(i)
def fold(self, L, R):
L += self.N
R += self.N
self._propagate_above(L // (L & -L))
self._propagate_above(R // (R & -R) - 1)
vL = self.X_unit
vR = self.X_unit
while L < R:
if L & 1:
vL = self.X_f(vL, self._eval_at(L))
L += 1
if R & 1:
R -= 1
vR = self.X_f(self._eval_at(R), vR)
L >>= 1
R >>= 1
return self.X_f(vL, vR)
def operate_range(self, L, R, x):
L += self.N
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.A[L] = self.A_f(self.A[L], x)
L += 1
if R & 1:
R -= 1
self.A[R] = self.A_f(self.A[R], x)
L >>= 1
R >>= 1
self._recalc_above(L0)
self._recalc_above(R0)
n = int(input())
data = int_list_0()
from collections import defaultdict
d = defaultdict(list)
for i,datai in enumerate(data):
d[datai].append(i)
SegType = "max"
UpdateType = "set"
seg = LazySegTree(data, SegType, UpdateType)
d2 = sorted(d.items())
for k,v in d2:
seg.operate_range(v[0],v[-1]+1,k)
seg.all_lazy()
print_space_0(seg.A[n:])
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0