結果
問題 | No.2354 Poor Sight in Winter |
ユーザー | Shirotsume |
提出日時 | 2023-04-11 11:39:27 |
言語 | PyPy3 (7.3.15) |
結果 |
RE
|
実行時間 | - |
コード長 | 1,539 bytes |
コンパイル時間 | 180 ms |
コンパイル使用メモリ | 82,176 KB |
実行使用メモリ | 283,136 KB |
最終ジャッジ日時 | 2024-04-16 10:39:06 |
合計ジャッジ時間 | 12,631 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 48 ms
54,528 KB |
testcase_01 | AC | 51 ms
55,040 KB |
testcase_02 | AC | 49 ms
54,784 KB |
testcase_03 | RE | - |
testcase_04 | AC | 48 ms
54,656 KB |
testcase_05 | RE | - |
testcase_06 | AC | 50 ms
54,784 KB |
testcase_07 | RE | - |
testcase_08 | RE | - |
testcase_09 | RE | - |
testcase_10 | AC | 70 ms
66,688 KB |
testcase_11 | AC | 898 ms
283,136 KB |
testcase_12 | AC | 918 ms
281,728 KB |
testcase_13 | AC | 1,089 ms
280,320 KB |
testcase_14 | AC | 1,069 ms
276,736 KB |
testcase_15 | AC | 1,055 ms
276,864 KB |
testcase_16 | AC | 1,066 ms
279,936 KB |
testcase_17 | AC | 1,052 ms
279,552 KB |
testcase_18 | AC | 394 ms
109,568 KB |
testcase_19 | AC | 684 ms
196,608 KB |
testcase_20 | AC | 421 ms
121,784 KB |
testcase_21 | AC | 177 ms
78,200 KB |
testcase_22 | AC | 290 ms
90,564 KB |
testcase_23 | AC | 289 ms
90,120 KB |
testcase_24 | AC | 589 ms
170,596 KB |
testcase_25 | RE | - |
testcase_26 | RE | - |
testcase_27 | RE | - |
testcase_28 | AC | 168 ms
78,012 KB |
ソースコード
import sys from collections import deque, Counter input = lambda: sys.stdin.readline().rstrip() ii = lambda: int(input()) mi = lambda: map(int, input().split()) li = lambda: list(mi()) inf = 2 ** 63 - 1 mod = 998244353 def Dijkstra(s, graph): INF = 2 ** 63 - 1 import heapq n = len(graph) dist = [INF] * n dist[s] = 0 bef = [0] * n bef[s] = s hq = [(0, s)] heapq.heapify(hq) while hq: c, now = heapq.heappop(hq) if c > dist[now]: continue for to, cost in graph[now]: if dist[now] + cost < dist[to]: dist[to] = cost + dist[now] bef[to] = now heapq.heappush(hq, (dist[to], + to)) return dist, bef def DijkstraRest(bef, t): now = t ret = [] while bef[now] != now: ret.append((bef[now], now)) now = bef[now] ret.reverse() return ret n, k = mi() sx, sy, gx, gy = mi() XY = [(sx, sy), (gx, gy)] + [tuple(li()) for _ in range(n)] def check(x): graph = [[] for _ in range(n + 2)] for i in range(n + 2): x1, y1 = XY[i] for j in range(i + 1, n + 2): x2, y2 = XY[j] dist = abs(x2 - x1) + abs(y2 - y1) cost = (dist - 1) // x graph[i].append((j, cost)) graph[j].append((i, cost)) d, _ = Dijkstra(0, graph) return d[1] <= k ok = 10 ** 9 ng = -1 while abs(ok - ng) > 1: mid = (ok + ng) // 2 if check(mid): ok = mid else: ng = mid print(ok)