結果

問題 No.1283 Extra Fee
ユーザー c-yanc-yan
提出日時 2020-11-12 10:49:07
言語 PyPy3
(7.3.15)
結果
TLE  
実行時間 -
コード長 2,997 bytes
コンパイル時間 569 ms
コンパイル使用メモリ 87,096 KB
実行使用メモリ 120,824 KB
最終ジャッジ日時 2023-09-30 01:10:08
合計ジャッジ時間 29,640 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 73 ms
71,324 KB
testcase_01 AC 72 ms
71,160 KB
testcase_02 AC 74 ms
71,264 KB
testcase_03 AC 74 ms
71,076 KB
testcase_04 AC 73 ms
71,364 KB
testcase_05 AC 73 ms
71,168 KB
testcase_06 AC 76 ms
71,152 KB
testcase_07 AC 75 ms
71,156 KB
testcase_08 AC 76 ms
71,460 KB
testcase_09 AC 76 ms
71,080 KB
testcase_10 AC 76 ms
71,280 KB
testcase_11 AC 448 ms
85,872 KB
testcase_12 AC 521 ms
87,264 KB
testcase_13 AC 335 ms
82,836 KB
testcase_14 AC 664 ms
88,148 KB
testcase_15 AC 879 ms
91,644 KB
testcase_16 AC 411 ms
84,232 KB
testcase_17 TLE -
testcase_18 TLE -
testcase_19 AC 1,768 ms
105,068 KB
testcase_20 AC 1,685 ms
104,720 KB
testcase_21 AC 1,712 ms
102,648 KB
testcase_22 AC 1,589 ms
100,760 KB
testcase_23 AC 968 ms
87,464 KB
testcase_24 AC 987 ms
88,896 KB
testcase_25 AC 1,803 ms
105,960 KB
testcase_26 AC 1,782 ms
105,968 KB
testcase_27 AC 1,785 ms
107,348 KB
testcase_28 AC 1,845 ms
104,628 KB
testcase_29 TLE -
権限があれば一括ダウンロードができます

ソースコード

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] > 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 c[nh][nw] > 0 and 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 c[nh][nw] > 0 and 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 c[nh][nw] > 0 and 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 c[nh][nw] > 0 and 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