結果

問題 No.2100 [Cherry Alpha C] Two-way Steps
ユーザー sepa38sepa38
提出日時 2022-10-14 22:00:29
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 356 ms / 2,000 ms
コード長 977 bytes
コンパイル時間 322 ms
コンパイル使用メモリ 82,432 KB
実行使用メモリ 119,164 KB
最終ジャッジ日時 2024-06-26 14:04:24
合計ジャッジ時間 13,411 ms
ジャッジサーバーID
(参考情報)
judge2 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 48
権限があれば一括ダウンロードができます

ソースコード

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

from collections import deque
n, m = map(int, input().split())
h = list(map(int, input().split()))
e = [[] for i in range(n)]
re = [[] for i in range(n)]
for i in range(m):
x, y = map(lambda x: int(x)-1, input().split())
x, y = sorted([x, y])
e[x].append(y)
re[y].append(x)
dp = [[-1, -1] for i in range(n)]
dp[0] = [0, -1]
flg = [0] * n
flg[0] = 1
for u in range(n):
if flg[u] == 0:
continue
for v in e[u]:
if h[v] > h[u]:
if dp[u][0] == -1:
continue
dp[v][1] = max(dp[v][1], dp[u][0]+h[v]-h[u])
else:
dp[v][0] = max(dp[v][0], max(dp[u]))
flg[v] = 1
print(max(dp[-1]))
dp = [[-1, -1] for i in range(n)]
dp[-1] = [0, -1]
flg = [0] * n
flg[-1] = 1
for u in reversed(range(n)):
if flg[u] == 0:
continue
for v in re[u]:
if h[v] > h[u]:
if dp[u][0] == -1:
continue
dp[v][1] = max(dp[v][1], dp[u][0]+h[v]-h[u])
else:
dp[v][0] = max(dp[v][0], max(dp[u]))
flg[v] = 1
print(max(dp[0]))
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0