結果
問題 | No.2100 [Cherry Alpha C] Two-way Steps |
ユーザー |
|
提出日時 | 2022-10-14 23:02:46 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
|
実行時間 | - |
コード長 | 1,856 bytes |
コンパイル時間 | 542 ms |
コンパイル使用メモリ | 82,300 KB |
実行使用メモリ | 108,264 KB |
最終ジャッジ日時 | 2024-06-26 16:51:11 |
合計ジャッジ時間 | 6,221 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 10 TLE * 1 -- * 37 |
ソースコード
from collections import defaultdictfrom heapq import heapify, heappop, heappushimport sysinput = sys.stdin.readlinedef main():n, m = map(int, input().split())H = list(map(int, input().split()))G1 = defaultdict(list)G2 = defaultdict(list)for _ in range(m):x, y = map(int, input().split())x -= 1y -= 1G1[x].append((y, H[y] - H[x]))G2[y].append((x, H[x] - H[y]))DP = [[-1, -1] for _ in range(n)]DP[0][0] = 0H = [(0, 0, 0)]heapify(H)while H:cnt, cp, up = heappop(H)cnt *= -1if cnt < DP[cp][up]:continueif cp == n - 1:continuefor np, d in G1[cp]:if d > 0:if up == 0:if cnt + d <= DP[np][1]:continueDP[np][1] = cnt + dheappush(H, (-DP[np][1], np, 1))else:if cnt <= DP[np][0]:continueDP[np][0] = cntheappush(H, (-DP[np][0], np, 0))print(max(DP[n - 1]))DP = [[-1, -1] for _ in range(n)]DP[n - 1][0] = 0H = [(0, n - 1, 0)]heapify(H)while H:cnt, cp, up = heappop(H)cnt *= -1if cnt < DP[cp][up]:continueif cp == 0:continuefor np, d in G2[cp]:if d > 0:if up == 0:if cnt + d <= DP[np][1]:continueDP[np][1] = cnt + dheappush(H, (-DP[np][1], np, 1))else:if cnt <= DP[np][0]:continueDP[np][0] = cntheappush(H, (-DP[np][0], np, 0))print(max(DP[0]))if __name__ == '__main__':main()