結果

問題 No.1283 Extra Fee
ユーザー c-yanc-yan
提出日時 2020-11-12 10:45:45
言語 PyPy3
(7.3.15)
結果
TLE  
実行時間 -
コード長 2,925 bytes
コンパイル時間 426 ms
コンパイル使用メモリ 82,304 KB
実行使用メモリ 113,548 KB
最終ジャッジ日時 2024-07-22 19:06:03
合計ジャッジ時間 30,646 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 43 ms
53,160 KB
testcase_01 AC 43 ms
52,864 KB
testcase_02 AC 44 ms
53,632 KB
testcase_03 AC 44 ms
53,248 KB
testcase_04 AC 43 ms
53,760 KB
testcase_05 AC 43 ms
53,504 KB
testcase_06 AC 46 ms
54,272 KB
testcase_07 AC 43 ms
53,504 KB
testcase_08 AC 47 ms
54,016 KB
testcase_09 AC 45 ms
54,016 KB
testcase_10 AC 45 ms
53,760 KB
testcase_11 AC 420 ms
82,660 KB
testcase_12 AC 476 ms
82,304 KB
testcase_13 AC 314 ms
80,604 KB
testcase_14 AC 680 ms
84,876 KB
testcase_15 AC 891 ms
87,280 KB
testcase_16 AC 394 ms
80,816 KB
testcase_17 TLE -
testcase_18 TLE -
testcase_19 AC 1,923 ms
101,080 KB
testcase_20 AC 1,846 ms
98,908 KB
testcase_21 AC 1,912 ms
99,652 KB
testcase_22 AC 1,741 ms
98,848 KB
testcase_23 AC 1,037 ms
87,068 KB
testcase_24 AC 1,058 ms
86,512 KB
testcase_25 TLE -
testcase_26 AC 1,962 ms
100,652 KB
testcase_27 AC 1,948 ms
99,152 KB
testcase_28 TLE -
testcase_29 TLE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

from heapq import heappop, heappush

INF = 10 ** 18

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] > dp0[h][w] + 1 + c[nh][nw]:
                dp0[nh][nw] = dp0[h][w] + 1 + c[nh][nw]
                heappush(q, (dp0[nh][nw], nh, nw, 0))
            if dp1[nh][nw] > dp0[h][w] + 1:
                dp1[nh][nw] = dp0[h][w] + 1
                heappush(q, (dp1[nh][nw], nh, nw, 1))
        if h != N - 1:
            nh = h + 1
            nw = w
            if dp0[nh][nw] > dp0[h][w] + 1 + c[nh][nw]:
                dp0[nh][nw] = dp0[h][w] + 1 + c[nh][nw]
                heappush(q, (dp0[nh][nw], nh, nw, 0))
            if dp1[nh][nw] > dp0[h][w] + 1:
                dp1[nh][nw] = dp0[h][w] + 1
                heappush(q, (dp1[nh][nw], nh, nw, 1))
        if w != 0:
            nh = h
            nw = w - 1
            if dp0[nh][nw] > dp0[h][w] + 1 + c[nh][nw]:
                dp0[nh][nw] = dp0[h][w] + 1 + c[nh][nw]
                heappush(q, (dp0[nh][nw], nh, nw, 0))
            if dp1[nh][nw] > dp0[h][w] + 1:
                dp1[nh][nw] = dp0[h][w] + 1
                heappush(q, (dp1[nh][nw], nh, nw, 1))
        if w != N - 1:
            nh = h
            nw = w + 1
            if dp0[nh][nw] > dp0[h][w] + 1 + c[nh][nw]:
                dp0[nh][nw] = dp0[h][w] + 1 + c[nh][nw]
                heappush(q, (dp0[nh][nw], nh, nw, 0))
            if dp1[nh][nw] > dp0[h][w] + 1:
                dp1[nh][nw] = dp0[h][w] + 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] > dp1[h][w] + 1 + c[nh][nw]:
                dp1[nh][nw] = dp1[h][w] + 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] > dp1[h][w] + 1 + c[nh][nw]:
                dp1[nh][nw] = dp1[h][w] + 1 + c[nh][nw]
                heappush(q, (dp1[nh][nw], nh, nw, 1))
        if w != 0:
            nh = h
            nw = w - 1
            if dp1[nh][nw] > dp1[h][w] + 1 + c[nh][nw]:
                dp1[nh][nw] = dp1[h][w] + 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] > dp1[h][w] + 1 + c[nh][nw]:
                dp1[nh][nw] = dp1[h][w] + 1 + c[nh][nw]
                heappush(q, (dp1[nh][nw], nh, nw, 1))
print(min(dp0[N - 1][N - 1], dp1[N - 1][N - 1]))
0