結果
問題 | No.1283 Extra Fee |
ユーザー | c-yan |
提出日時 | 2020-11-12 11:09:52 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
|
実行時間 | - |
コード長 | 2,837 bytes |
コンパイル時間 | 278 ms |
コンパイル使用メモリ | 87,024 KB |
実行使用メモリ | 117,364 KB |
最終ジャッジ日時 | 2023-09-30 01:11:23 |
合計ジャッジ時間 | 29,344 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 83 ms
71,260 KB |
testcase_01 | AC | 79 ms
71,320 KB |
testcase_02 | AC | 80 ms
71,528 KB |
testcase_03 | AC | 81 ms
71,468 KB |
testcase_04 | AC | 79 ms
71,356 KB |
testcase_05 | AC | 82 ms
71,420 KB |
testcase_06 | AC | 83 ms
71,324 KB |
testcase_07 | AC | 82 ms
71,608 KB |
testcase_08 | AC | 84 ms
71,260 KB |
testcase_09 | AC | 83 ms
71,112 KB |
testcase_10 | AC | 82 ms
71,588 KB |
testcase_11 | AC | 433 ms
84,728 KB |
testcase_12 | AC | 469 ms
84,632 KB |
testcase_13 | AC | 343 ms
82,176 KB |
testcase_14 | AC | 675 ms
88,532 KB |
testcase_15 | AC | 876 ms
90,044 KB |
testcase_16 | AC | 405 ms
82,696 KB |
testcase_17 | TLE | - |
testcase_18 | AC | 1,961 ms
106,984 KB |
testcase_19 | AC | 1,824 ms
102,772 KB |
testcase_20 | AC | 1,754 ms
101,544 KB |
testcase_21 | AC | 1,801 ms
101,852 KB |
testcase_22 | AC | 1,645 ms
100,780 KB |
testcase_23 | AC | 1,006 ms
88,040 KB |
testcase_24 | AC | 1,034 ms
87,996 KB |
testcase_25 | AC | 1,864 ms
102,900 KB |
testcase_26 | AC | 1,857 ms
105,576 KB |
testcase_27 | AC | 1,843 ms
102,492 KB |
testcase_28 | AC | 1,947 ms
104,568 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 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 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]))