結果

問題 No.1095 Smallest Kadomatsu Subsequence
ユーザー mkawa2
提出日時 2021-06-11 10:38:12
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 872 ms / 2,000 ms
コード長 1,801 bytes
コンパイル時間 451 ms
コンパイル使用メモリ 82,380 KB
実行使用メモリ 134,684 KB
最終ジャッジ日時 2024-12-14 04:24:33
合計ジャッジ時間 9,407 ms
ジャッジサーバーID
(参考情報)
judge2 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 30
権限があれば一括ダウンロードができます

ソースコード

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

import sys
sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = 10**16
# md = 998244353
# md = 10**9+7
class BIT:
def __init__(self, n):
self.inf = 10**16
self.n = n+3
self.table = [self.inf]*(self.n+1)
def update(self, i, x):
i += 1
while i <= self.n:
if x < self.table[i]: self.table[i] = x
i += i & -i
def min(self, i):
i += 1
res = self.inf
while i > 0:
if self.table[i] < res: res = self.table[i]
i -= i & -i
return res
n = II()
aa = LI()
def make_mn(aa):
res = []
mn = inf
for a in aa:
if mn < a: res.append(mn)
else: res.append(inf)
mn = min(mn, a)
return res
ll = make_mn(aa)
rr = make_mn(aa[::-1])[::-1]
ans = inf
for a, l, r in zip(aa, ll, rr):
ans = min(ans, a+l+r)
def make_mx(aa):
bit = BIT(n)
res = [inf]*n
for i, a in sorted(enumerate(aa), key=lambda x: -x[1]):
mn = bit.min(i-1)
res[i] = mn
bit.update(i, a)
return res
ll = make_mx(aa)
rr = make_mx(aa[::-1])[::-1]
for a, l, r in zip(aa, ll, rr):
ans = min(ans, a+l+r)
if ans == inf: ans = -1
print(ans)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0