結果

問題 No.1283 Extra Fee
コンテスト
ユーザー c-yan
提出日時 2020-11-12 11:09:52
言語 PyPy3
(7.3.15)
結果
TLE  
実行時間 -
コード長 2,837 bytes
コンパイル時間 316 ms
コンパイル使用メモリ 81,996 KB
実行使用メモリ 113,236 KB
最終ジャッジ日時 2024-07-22 19:08:23
合計ジャッジ時間 29,014 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 27 TLE * 3
権限があれば一括ダウンロードができます

ソースコード

diff # 

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]))
0