結果
問題 | No.1065 電柱 / Pole (Easy) |
ユーザー | Coki628 |
提出日時 | 2020-10-27 00:13:12 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 980 ms / 2,000 ms |
コード長 | 1,612 bytes |
コンパイル時間 | 401 ms |
コンパイル使用メモリ | 87,220 KB |
実行使用メモリ | 137,920 KB |
最終ジャッジ日時 | 2023-09-29 03:05:57 |
合計ジャッジ時間 | 29,946 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 77 ms
71,872 KB |
testcase_01 | AC | 75 ms
71,768 KB |
testcase_02 | AC | 574 ms
106,712 KB |
testcase_03 | AC | 726 ms
137,920 KB |
testcase_04 | AC | 692 ms
136,820 KB |
testcase_05 | AC | 498 ms
134,224 KB |
testcase_06 | AC | 497 ms
134,116 KB |
testcase_07 | AC | 181 ms
90,884 KB |
testcase_08 | AC | 382 ms
131,672 KB |
testcase_09 | AC | 135 ms
82,836 KB |
testcase_10 | AC | 232 ms
102,028 KB |
testcase_11 | AC | 190 ms
93,344 KB |
testcase_12 | AC | 187 ms
88,576 KB |
testcase_13 | AC | 723 ms
118,536 KB |
testcase_14 | AC | 790 ms
122,820 KB |
testcase_15 | AC | 896 ms
131,760 KB |
testcase_16 | AC | 516 ms
104,148 KB |
testcase_17 | AC | 963 ms
136,096 KB |
testcase_18 | AC | 418 ms
97,048 KB |
testcase_19 | AC | 888 ms
133,092 KB |
testcase_20 | AC | 331 ms
91,996 KB |
testcase_21 | AC | 458 ms
102,708 KB |
testcase_22 | AC | 846 ms
127,136 KB |
testcase_23 | AC | 97 ms
77,176 KB |
testcase_24 | AC | 107 ms
78,568 KB |
testcase_25 | AC | 179 ms
88,392 KB |
testcase_26 | AC | 526 ms
107,512 KB |
testcase_27 | AC | 573 ms
107,556 KB |
testcase_28 | AC | 919 ms
128,964 KB |
testcase_29 | AC | 229 ms
85,884 KB |
testcase_30 | AC | 892 ms
132,208 KB |
testcase_31 | AC | 609 ms
115,416 KB |
testcase_32 | AC | 462 ms
102,400 KB |
testcase_33 | AC | 980 ms
132,808 KB |
testcase_34 | AC | 430 ms
97,720 KB |
testcase_35 | AC | 889 ms
132,828 KB |
testcase_36 | AC | 112 ms
78,152 KB |
testcase_37 | AC | 146 ms
79,556 KB |
testcase_38 | AC | 119 ms
78,700 KB |
testcase_39 | AC | 147 ms
79,616 KB |
testcase_40 | AC | 97 ms
76,052 KB |
testcase_41 | AC | 960 ms
134,984 KB |
testcase_42 | AC | 380 ms
94,656 KB |
testcase_43 | AC | 554 ms
107,604 KB |
testcase_44 | AC | 283 ms
88,664 KB |
testcase_45 | AC | 638 ms
105,660 KB |
testcase_46 | AC | 152 ms
71,924 KB |
testcase_47 | AC | 97 ms
71,572 KB |
ソースコード
import sys from math import hypot def input(): return sys.stdin.readline().strip() def list2d(a, b, c): return [[c for j in range(b)] for i in range(a)] def list3d(a, b, c, d): return [[[d for k in range(c)] for j in range(b)] for i in range(a)] def list4d(a, b, c, d, e): return [[[[e for l in range(d)] for k in range(c)] for j in range(b)] for i in range(a)] def ceil(x, y=1): return int(-(-x // y)) def INT(): return int(input()) def MAP(): return map(int, input().split()) def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)] def Yes(): print('Yes') def No(): print('No') def YES(): print('YES') def NO(): print('NO') sys.setrecursionlimit(10**9) INF = 10**19 MOD = 10**9 + 7 EPS = 10**-10 def dijkstra(nodes: list, src: int) -> list: """ ダイクストラ(隣接リスト(0-indexed), 始点) """ from heapq import heappush, heappop N = len(nodes) res = [INF] * N que = [(0, src)] res[src] = 0 while que: dist, cur = heappop(que) if res[cur] < dist: continue for nxt, cost in nodes[cur]: if dist + cost < res[nxt]: res[nxt] = dist + cost heappush(que, (dist+cost, nxt)) return res N, M = MAP() s, t = MAP() s -= 1; t -= 1 def calc(a, b): return hypot(XY[a][0]-XY[b][0], XY[a][1]-XY[b][1]) XY = [] for i in range(N): x, y = MAP() XY.append((x, y)) nodes = [[] for i in range(N)] for i in range(M): a, b = MAP() a -= 1; b -= 1 c = calc(a, b) nodes[a].append((b, c)) nodes[b].append((a, c)) ans = dijkstra(nodes, s)[t] print(ans)