結果
問題 | No.1283 Extra Fee |
ユーザー | c-yan |
提出日時 | 2020-11-12 11:00:48 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 2,883 bytes |
コンパイル時間 | 201 ms |
コンパイル使用メモリ | 82,432 KB |
実行使用メモリ | 114,532 KB |
最終ジャッジ日時 | 2024-07-22 19:07:50 |
合計ジャッジ時間 | 29,229 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 41 ms
53,248 KB |
testcase_01 | AC | 40 ms
52,864 KB |
testcase_02 | AC | 40 ms
53,248 KB |
testcase_03 | AC | 39 ms
53,012 KB |
testcase_04 | AC | 40 ms
53,120 KB |
testcase_05 | AC | 42 ms
53,248 KB |
testcase_06 | AC | 44 ms
53,888 KB |
testcase_07 | AC | 42 ms
53,376 KB |
testcase_08 | AC | 43 ms
54,272 KB |
testcase_09 | AC | 43 ms
54,016 KB |
testcase_10 | AC | 43 ms
53,760 KB |
testcase_11 | AC | 395 ms
82,272 KB |
testcase_12 | AC | 444 ms
82,644 KB |
testcase_13 | AC | 293 ms
80,068 KB |
testcase_14 | AC | 640 ms
84,688 KB |
testcase_15 | AC | 868 ms
88,048 KB |
testcase_16 | AC | 369 ms
81,560 KB |
testcase_17 | TLE | - |
testcase_18 | TLE | - |
testcase_19 | AC | 1,844 ms
98,672 KB |
testcase_20 | AC | 1,762 ms
99,124 KB |
testcase_21 | AC | 1,805 ms
100,220 KB |
testcase_22 | AC | 1,634 ms
96,280 KB |
testcase_23 | AC | 1,026 ms
86,236 KB |
testcase_24 | AC | 1,034 ms
86,060 KB |
testcase_25 | AC | 1,880 ms
99,000 KB |
testcase_26 | AC | 1,880 ms
99,584 KB |
testcase_27 | AC | 1,871 ms
100,068 KB |
testcase_28 | AC | 1,971 ms
101,140 KB |
testcase_29 | TLE | - |
ソースコード
from heapq import heappop, heappush INF = 10 ** 15 N, M = map(int, input().split()) c = [[0] * N for _ in range(N)] for _ in range(M): h, w, cc = map(int, input().split()) c[h - 1][w - 1] = cc dp0 = [[INF] * N for _ in range(N)] dp1 = [[INF] * N for _ in range(N)] dp0[0][0] = 0 q = [(0, 0, 0, 0)] while q: cc, h, w, t = heappop(q) if t == 0: if dp0[h][w] < cc: continue cc = dp0[h][w] if h != 0: nh = h - 1 nw = w if dp0[nh][nw] > cc + 1 + c[nh][nw]: dp0[nh][nw] = cc + 1 + c[nh][nw] heappush(q, (dp0[nh][nw], nh, nw, 0)) if dp1[nh][nw] > 0 and dp1[nh][nw] > cc + 1: dp1[nh][nw] = cc + 1 heappush(q, (dp1[nh][nw], nh, nw, 1)) if h != N - 1: nh = h + 1 nw = w if dp0[nh][nw] > cc + 1 + c[nh][nw]: dp0[nh][nw] = cc + 1 + c[nh][nw] heappush(q, (dp0[nh][nw], nh, nw, 0)) if dp1[nh][nw] > 0 and dp1[nh][nw] > cc + 1: dp1[nh][nw] = cc + 1 heappush(q, (dp1[nh][nw], nh, nw, 1)) if w != 0: nh = h nw = w - 1 if dp0[nh][nw] > cc + 1 + c[nh][nw]: dp0[nh][nw] = cc + 1 + c[nh][nw] heappush(q, (dp0[nh][nw], nh, nw, 0)) if dp1[nh][nw] > 0 and dp1[nh][nw] > cc + 1: dp1[nh][nw] = cc + 1 heappush(q, (dp1[nh][nw], nh, nw, 1)) if w != N - 1: nh = h nw = w + 1 if dp0[nh][nw] > cc + 1 + c[nh][nw]: dp0[nh][nw] = cc + 1 + c[nh][nw] heappush(q, (dp0[nh][nw], nh, nw, 0)) if dp1[nh][nw] > 0 and dp1[nh][nw] > cc + 1: dp1[nh][nw] = cc + 1 heappush(q, (dp1[nh][nw], nh, nw, 1)) elif t == 1: if dp1[h][w] < cc: continue cc = dp1[h][w] if h != 0: nh = h - 1 nw = w if dp1[nh][nw] > cc + 1 + c[nh][nw]: dp1[nh][nw] = cc + 1 + c[nh][nw] heappush(q, (dp1[nh][nw], nh, nw, 1)) if h != N - 1: nh = h + 1 nw = w if dp1[nh][nw] > cc + 1 + c[nh][nw]: dp1[nh][nw] = cc + 1 + c[nh][nw] heappush(q, (dp1[nh][nw], nh, nw, 1)) if w != 0: nh = h nw = w - 1 if dp1[nh][nw] > cc + 1 + c[nh][nw]: dp1[nh][nw] = cc + 1 + c[nh][nw] heappush(q, (dp1[nh][nw], nh, nw, 1)) if w != N - 1: nh = h nw = w + 1 if dp1[nh][nw] > cc + 1 + c[nh][nw]: dp1[nh][nw] = cc + 1 + c[nh][nw] heappush(q, (dp1[nh][nw], nh, nw, 1)) print(min(dp0[N - 1][N - 1], dp1[N - 1][N - 1]))