結果

問題 No.2354 Poor Sight in Winter
ユーザー Shirotsume
提出日時 2023-04-11 11:40:11
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 887 ms / 2,000 ms
コード長 1,538 bytes
コンパイル時間 258 ms
コンパイル使用メモリ 82,260 KB
実行使用メモリ 282,892 KB
最終ジャッジ日時 2024-10-07 03:52:58
合計ジャッジ時間 10,290 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 26
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

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 = 0
while abs(ok - ng) > 1:
    mid = (ok + ng) // 2
    if check(mid):
        ok = mid
    else:
        ng = mid
print(ok)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0