結果
問題 | No.1283 Extra Fee |
ユーザー | mkawa2 |
提出日時 | 2022-03-08 13:50:01 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,375 ms / 2,000 ms |
コード長 | 1,426 bytes |
コンパイル時間 | 204 ms |
コンパイル使用メモリ | 82,212 KB |
実行使用メモリ | 99,572 KB |
最終ジャッジ日時 | 2024-04-28 00:49:34 |
合計ジャッジ時間 | 15,284 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 35 ms
52,608 KB |
testcase_01 | AC | 39 ms
52,992 KB |
testcase_02 | AC | 41 ms
53,120 KB |
testcase_03 | AC | 37 ms
52,480 KB |
testcase_04 | AC | 37 ms
52,864 KB |
testcase_05 | AC | 36 ms
52,608 KB |
testcase_06 | AC | 39 ms
53,248 KB |
testcase_07 | AC | 36 ms
52,736 KB |
testcase_08 | AC | 37 ms
53,376 KB |
testcase_09 | AC | 36 ms
53,248 KB |
testcase_10 | AC | 36 ms
52,992 KB |
testcase_11 | AC | 195 ms
78,464 KB |
testcase_12 | AC | 191 ms
78,188 KB |
testcase_13 | AC | 145 ms
77,284 KB |
testcase_14 | AC | 257 ms
78,764 KB |
testcase_15 | AC | 326 ms
79,848 KB |
testcase_16 | AC | 163 ms
77,524 KB |
testcase_17 | AC | 1,265 ms
98,636 KB |
testcase_18 | AC | 883 ms
89,228 KB |
testcase_19 | AC | 882 ms
88,684 KB |
testcase_20 | AC | 804 ms
87,776 KB |
testcase_21 | AC | 836 ms
87,616 KB |
testcase_22 | AC | 792 ms
86,144 KB |
testcase_23 | AC | 794 ms
84,740 KB |
testcase_24 | AC | 800 ms
84,992 KB |
testcase_25 | AC | 890 ms
88,672 KB |
testcase_26 | AC | 886 ms
88,588 KB |
testcase_27 | AC | 913 ms
88,960 KB |
testcase_28 | AC | 890 ms
88,464 KB |
testcase_29 | AC | 1,375 ms
99,572 KB |
ソースコード
import sys # sys.setrecursionlimit(200005) int1 = lambda x: int(x)-1 pDB = lambda *x: print(*x, end="\n", file=sys.stderr) p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr) def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LI1(): return list(map(int1, sys.stdin.readline().split())) def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def SI(): return sys.stdin.readline().rstrip() dij = [(0, 1), (-1, 0), (0, -1), (1, 0)] # dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)] inf = (1 << 63)-1 # inf = (1 << 31)-1 # md = 10**9+7 md = 998244353 from heapq import * n, m = LI() cc = [0]*n*n for _ in range(m): i, j, c = LI1() cc[i*n+j] = c+1 dist = [[inf]*n*n for _ in range(2)] dist[0][0] = 0 hp = [(0, 0, 0)] while hp: d, f, ij = heappop(hp) if d > dist[f][ij]: continue i, j = divmod(ij, n) for di, dj in dij: ni, nj = i+di, j+dj if ni < 0 or nj < 0 or ni >= n or nj >= n: continue nij = ni*n+nj nd = d+cc[nij]+1 if nd >= dist[f][nij]: continue dist[f][nij] = nd heappush(hp, (nd, f, nij)) if f == 0: nd = d+1 if nd >= dist[1][nij]: continue dist[1][nij] = nd heappush(hp, (nd, 1, nij)) print(dist[1][-1])