結果

問題 No.2695 Warp Zone
ユーザー FromBooskaFromBooska
提出日時 2024-03-23 01:15:28
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 686 ms / 2,000 ms
コード長 1,436 bytes
コンパイル時間 264 ms
コンパイル使用メモリ 82,200 KB
実行使用メモリ 205,192 KB
最終ジャッジ日時 2024-09-30 12:55:42
合計ジャッジ時間 9,122 ms
ジャッジサーバーID
(参考情報)
judge5 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 24
権限があれば一括ダウンロードができます

ソースコード

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

#
import sys
input = sys.stdin.readline
H, W, N = map(int, input().split())
dic = {}
edges = [[] for i in range(N*2+2)]
for i in range(N):
a, b, c, d = map(int, input().split())
dic[i*2] = (a, b)
dic[i*2+1] = (c, d)
edges[i*2].append((i*2+1, 1))
dic[N*2]=(1, 1)
dic[N*2+1]=(H, W)
for u in range(N*2+2):
for v in range(N*2+2):
if u == v:
continue
if 0<=u<N*2 and u%2 == 0 and v==u+1:
continue
d = abs(dic[u][0]-dic[v][0])+abs(dic[u][1]-dic[v][1])
edges[u].append((v, d))
#edges[v].append((u, d))
#print(edges)
from heapq import heappush, heappop
INF = 10 ** 18
def dijkstra(s, n, connect): #(, )
distance = [INF] * n
que = [(0, s)] #(distance, node)
distance[s] = 0
confirmed = [False] * n #
while que:
w,v = heappop(que)
if distance[v]<w:
continue
confirmed[v] = True
for to, cost in connect[v]: # v
if confirmed[to] == False and distance[v] + cost < distance[to]:
distance[to] = distance[v] + cost
heappush(que, (distance[to], to))
return distance
distance = dijkstra(N*2, N*2+2, edges)
ans = distance[N*2+1]
print(ans)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0