結果
| 問題 |
No.1069 電柱 / Pole (Hard)
|
| コンテスト | |
| ユーザー |
 vwxyz
|
| 提出日時 | 2021-12-27 08:53:04 |
| 言語 | PyPy3 (7.3.15) |
| 結果 |
AC
|
| 実行時間 | 1,769 ms / 2,000 ms |
| コード長 | 7,410 bytes |
| コンパイル時間 | 356 ms |
| コンパイル使用メモリ | 82,312 KB |
| 実行使用メモリ | 207,340 KB |
| 最終ジャッジ日時 | 2024-07-23 02:36:44 |
| 合計ジャッジ時間 | 16,172 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 79 |
ソースコード
import heapq
import math
import sys
readline=sys.stdin.readline
class Graph:
def __init__(self,V,edges=False,graph=False,directed=False,weighted=False,inf=float("inf")):
self.V=V
self.directed=directed
self.weighted=weighted
self.inf=inf
if not graph:
self.edges=edges
self.graph=[[] for i in range(self.V)]
if weighted:
for i,j,d in self.edges:
self.graph[i].append((j,d))
if not self.directed:
self.graph[j].append((i,d))
else:
for i,j in self.edges:
self.graph[i].append(j)
if not self.directed:
self.graph[j].append(i)
else:
self.graph=graph
self.edges=[]
for i in range(self.V):
if self.weighted:
for j,d in self.graph[i]:
if self.directed or not self.directed and i<=j:
self.edges.append((i,j,d))
else:
for j in self.graph[i]:
if self.directed or not self.directed and i<=j:
self.edges.append((i,j))
def Dijkstra(self,s,route_restoration=False):
dist=[self.inf]*self.V
dist[s]=0
hq=[(0,s)]
if route_restoration:
parents=[None]*self.V
while hq:
dx,x=heapq.heappop(hq)
if dist[x]<dx:
continue
for y,dy in self.graph[x]:
if dist[y]>dx+dy:
dist[y]=dx+dy
if route_restoration:
parents[y]=x
heapq.heappush(hq,(dist[y],y))
if route_restoration:
return dist,parents
else:
return dist
def Route_Restoration(self,s,g,parents,reverse=False):
route=[g]
while s!=g:
if parents[g]==None:
route=[]
break
g=parents[g]
route.append(g)
if not reverse:
route=route[::-1]
return route
def K_Shortest_Path_Routing(self,s,t,K,edge_unicursal=False,point_unicursal=False):
if point_unicursal:
dist,parents=self.Dijkstra(s,route_restoration=True)
route=tuple(self.Route_Restoration(s,t,parents))
queue=[(dist[t],route,[dist[x] for x in route])]
set_queue=set()
set_queue.add(route)
retu=[]
while queue and K:
d,route,route_dist=heapq.heappop(queue)
retu.append((d,route,route_dist))
K-=1
set_route=set()
for i in range(len(route)-1):
x=route[i]
set_route.add(x)
edges=[(v,u,d) for u,v,d in self.edges if not u in set_route and not v in set_route]
G_rev=Graph(self.V,edges=edges,directed=self.directed,weighted=self.weighted,inf=self.inf)
dist_rev,parents_rev=G_rev.Dijkstra(t,route_restoration=True)
for y,d in self.graph[x]:
if y==route[i+1]:
continue
if dist_rev[y]==self.inf:
continue
tpl=route[:i+1]+tuple(self.Route_Restoration(t,y,parents_rev,reverse=True))
if not tpl in set_queue:
heapq.heappush(queue,(route_dist[i]+d+dist_rev[y],tpl,route_dist[:i+1]+[route_dist[i]+d+dist_rev[y]-dist_rev[z] for z in tpl[i+1:]]))
set_queue.add(tpl)
elif edge_unicursal:
dist,parents=self.Dijkstra(s,route_restoration=True)
route=tuple(self.Route_Restoration(s,t,parents))
queue=[(dist[t],route,[dist[x] for x in route])]
set_queue=set()
set_queue.add(route)
retu=[]
while queue and K:
d,route,route_dist=heapq.heappop(queue)
retu.append((d,route,route_dist))
K-=1
set_route=set()
for i in range(len(route)-1):
x=route[i]
y=route[i+1]
set_route.add((x,y,route_dist[i+1]-route_dist[i]))
if not self.directed:
set_route.add((y,x,route_dist[i+1]-route_dist[i]))
edges=[(v,u,d) for u,v,d in self.edges if not (u,v,d) in set_route]
G_rev=Graph(self.V,edges=edges,directed=self.directed,weighted=self.weighted,inf=self.inf)
dist_rev,parents_rev=G_rev.Dijkstra(t,route_restoration=True)
for y,d in self.graph[x]:
if y==route[i+1]:
continue
if dist_rev[y]==self.inf:
continue
tpl=route[:i+1]+tuple(self.Route_Restoration(t,y,parents_rev,reverse=True))
if not tpl in set_queue:
heapq.heappush(queue,(route_dist[i]+d+dist_rev[y],tpl,route_dist[:i+1]+[route_dist[i]+d+dist_rev[y]-dist_rev[z] for z in tpl[i+1:]]))
set_queue.add(tpl)
else:
dist,parents=self.Dijkstra(s,route_restoration=True)
if dist[t]==self.inf:
return False
route_lst=[tuple(self.Route_Restoration(s,x,parents)) for x in range(self.V)]
edges_rev=[(j,i,d) for i,j,d in self.edges]
G_rev=Graph(self.V,edges=edges_rev,weighted=self.weighted,directed=self.directed,inf=self.inf)
dist_rev,parents_rev=G_rev.Dijkstra(t,route_restoration=True)
route_rev_lst=[]
for x in range(self.V):
route_rev_lst.append(tuple(self.Route_Restoration(t,x,parents_rev,reverse=True)))
route=route_lst[t]
queue=[(dist[t],route,[dist[x] for x in route])]
set_queue=set()
set_queue.add(route)
retu=[]
while queue and K:
d,route,route_dist=heapq.heappop(queue)
retu.append((d,route,route_dist))
K-=1
for i in range(len(route)-1):
x=route[i]
for y,d in self.graph[x]:
if y==route[i+1]:
continue
tpl=route[:i+1]+route_rev_lst[y]
if not tpl in set_queue:
heapq.heappush(queue,(route_dist[i]+d+dist_rev[y],tpl,route_dist[:i+1]+[route_dist[i]+d+dist_rev[y]-dist_rev[z] for z in route_rev_lst[y]]))
set_queue.add(tpl)
return retu
N,M,K=map(int,readline().split())
S,T=map(int,readline().split())
S-=1;T-=1
X,Y=[],[]
for _ in range(N):
x,y=map(int,readline().split())
X.append(x)
Y.append(y)
edges=[]
for _ in range(M):
P,Q=map(int,readline().split())
P-=1;Q-=1
edges.append((P,Q,math.sqrt((X[P]-X[Q])**2+(Y[P]-Y[Q])**2)))
G=Graph(N,edges=edges,weighted=True)
ans_lst=[-1]*K
for i,(d,route,dist) in enumerate(G.K_Shortest_Path_Routing(S,T,K,point_unicursal=True)):
ans_lst[i]=d
print(*ans_lst,sep="\n")