結果
問題 | No.1283 Extra Fee |
ユーザー | LyricalMaestro |
提出日時 | 2024-01-24 02:03:02 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
|
実行時間 | - |
コード長 | 1,844 bytes |
コンパイル時間 | 411 ms |
コンパイル使用メモリ | 81,572 KB |
実行使用メモリ | 170,808 KB |
最終ジャッジ日時 | 2024-01-24 02:03:35 |
合計ジャッジ時間 | 24,630 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 38 ms
53,460 KB |
testcase_01 | AC | 37 ms
53,460 KB |
testcase_02 | AC | 42 ms
53,460 KB |
testcase_03 | AC | 38 ms
53,460 KB |
testcase_04 | AC | 38 ms
53,460 KB |
testcase_05 | AC | 39 ms
53,460 KB |
testcase_06 | AC | 42 ms
55,600 KB |
testcase_07 | AC | 40 ms
53,460 KB |
testcase_08 | AC | 43 ms
55,600 KB |
testcase_09 | AC | 40 ms
53,460 KB |
testcase_10 | AC | 39 ms
53,460 KB |
testcase_11 | AC | 327 ms
83,756 KB |
testcase_12 | AC | 295 ms
82,764 KB |
testcase_13 | AC | 227 ms
80,300 KB |
testcase_14 | AC | 455 ms
90,820 KB |
testcase_15 | AC | 702 ms
99,620 KB |
testcase_16 | AC | 268 ms
81,428 KB |
testcase_17 | TLE | - |
testcase_18 | AC | 1,982 ms
161,032 KB |
testcase_19 | TLE | - |
testcase_20 | AC | 1,994 ms
158,460 KB |
testcase_21 | AC | 1,967 ms
160,500 KB |
testcase_22 | AC | 1,710 ms
150,444 KB |
testcase_23 | AC | 1,674 ms
152,676 KB |
testcase_24 | AC | 1,736 ms
160,312 KB |
testcase_25 | TLE | - |
testcase_26 | TLE | - |
testcase_27 | TLE | - |
testcase_28 | TLE | - |
testcase_29 | TLE | - |
ソースコード
## https://yukicoder.me/problems/no/1283 import heapq def main(): N, M = map(int, input().split()) pass_map = [[0] * N for _ in range(N)] for _ in range(M): h, w, c = map(int, input().split()) pass_map[h - 1][w - 1] = c seen = [[[float("inf"), float("inf")] for _ in range(N)] for _ in range(N)] seen[0][0][0] = 0 fix = [[[float("inf"), float("inf")] for _ in range(N)] for _ in range(N)] queue = [] heapq.heappush(queue, (0, 0, 0, 0)) while len(queue) > 0: cost, h, w, state = heapq.heappop(queue) if fix[h][w][state] <= cost: continue fix[h][w][state] = cost for dh, dw in ((0, 1), (1, 0), (0, -1), (-1, 0)): new_h = h + dh new_w = w + dw if 0 <= new_h and new_h < N and 0 <= new_w and new_w < N: # 普通に手数料を払う場合 if fix[new_h][new_w][state] != float("inf"): continue new_cost = cost + 1 + pass_map[new_h][new_w] if seen[new_h][new_w][state] > new_cost: seen[new_h][new_w][state] = new_cost heapq.heappush(queue, (new_cost, new_h, new_w, state)) # 免除を使う場合 if state == 0 and pass_map[new_h][new_w] > 0: if fix[new_h][new_w][1] != float("inf"): continue new_cost = cost + 1 if seen[new_h][new_w][1] > new_cost: seen[new_h][new_w][1] = new_cost heapq.heappush(queue, (new_cost, new_h, new_w, 1)) answer = min(fix[N - 1][N - 1]) if answer == float("inf"): print(-1) else: print(answer) if __name__ == "__main__": main()