結果
問題 | No.1344 Typical Shortest Path Sum |
ユーザー | mkawa2 |
提出日時 | 2023-03-09 13:18:47 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,182 bytes |
コンパイル時間 | 151 ms |
コンパイル使用メモリ | 82,368 KB |
実行使用メモリ | 76,592 KB |
最終ジャッジ日時 | 2024-09-18 02:52:37 |
合計ジャッジ時間 | 6,667 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 38 ms
53,336 KB |
testcase_01 | AC | 39 ms
52,672 KB |
testcase_02 | AC | 38 ms
53,604 KB |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | AC | 39 ms
52,708 KB |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | AC | 38 ms
53,100 KB |
testcase_09 | WA | - |
testcase_10 | AC | 38 ms
52,640 KB |
testcase_11 | AC | 37 ms
53,012 KB |
testcase_12 | AC | 38 ms
53,072 KB |
testcase_13 | AC | 39 ms
53,540 KB |
testcase_14 | WA | - |
testcase_15 | AC | 38 ms
53,756 KB |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | AC | 37 ms
52,616 KB |
testcase_21 | WA | - |
testcase_22 | AC | 38 ms
53,596 KB |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | AC | 37 ms
52,864 KB |
testcase_26 | WA | - |
testcase_27 | AC | 38 ms
52,868 KB |
testcase_28 | WA | - |
testcase_29 | AC | 38 ms
52,788 KB |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | AC | 38 ms
54,220 KB |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | AC | 39 ms
52,828 KB |
testcase_36 | AC | 37 ms
53,156 KB |
testcase_37 | WA | - |
testcase_38 | AC | 37 ms
54,148 KB |
testcase_39 | WA | - |
testcase_40 | WA | - |
testcase_41 | WA | - |
testcase_42 | WA | - |
testcase_43 | WA | - |
testcase_44 | WA | - |
testcase_45 | WA | - |
testcase_46 | WA | - |
testcase_47 | WA | - |
testcase_48 | WA | - |
testcase_49 | WA | - |
testcase_50 | WA | - |
testcase_51 | WA | - |
testcase_52 | WA | - |
testcase_53 | WA | - |
testcase_54 | WA | - |
testcase_55 | WA | - |
testcase_56 | WA | - |
testcase_57 | WA | - |
testcase_58 | WA | - |
testcase_59 | WA | - |
testcase_60 | AC | 47 ms
61,064 KB |
testcase_61 | AC | 39 ms
53,512 KB |
testcase_62 | AC | 66 ms
69,588 KB |
testcase_63 | AC | 49 ms
63,052 KB |
testcase_64 | AC | 51 ms
62,824 KB |
testcase_65 | AC | 62 ms
70,312 KB |
testcase_66 | AC | 61 ms
68,904 KB |
testcase_67 | AC | 61 ms
68,456 KB |
testcase_68 | AC | 49 ms
63,568 KB |
testcase_69 | AC | 49 ms
61,500 KB |
testcase_70 | WA | - |
testcase_71 | WA | - |
testcase_72 | AC | 39 ms
52,664 KB |
testcase_73 | AC | 38 ms
52,668 KB |
testcase_74 | WA | - |
testcase_75 | WA | - |
testcase_76 | WA | - |
testcase_77 | WA | - |
testcase_78 | WA | - |
testcase_79 | WA | - |
ソースコード
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 n, m = LI() dist = [[inf]*n for _ in range(n)] for u in range(n): dist[u][u] = 0 for _ in range(m): u, v, d = LI() u -= 1 v -= 1 dist[u][v] = min(dist[u][v], d) for v in range(n): for u in range(n): for w in range(n): dist[u][w] = min(dist[u][w], dist[u][v]+dist[v][w]) for u in range(n): ans = 0 for v in range(n): if dist[u][v] == inf or u == v: continue ans += dist[u][v] print(ans)