#726691 (PyPy3) No.1069 電柱 / Pole (Hard)

提出ソース

結果

問題	No.1069 電柱 / Pole (Hard)
ユーザー	vwxyz
提出日時	2021-12-27 08:46:33
言語	PyPy3 (7.3.15)
結果	AC
実行時間	1,675 ms / 2,000 ms
コード長	5,775 bytes
コンパイル時間	203 ms
コンパイル使用メモリ	82,596 KB
実行使用メモリ	207,464 KB
最終ジャッジ日時	2024-07-23 15:10:11
合計ジャッジ時間	15,560 ms
ジャッジサーバーID （参考情報）	judge2 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	45 ms 54,556 KB
testcase_01	AC	46 ms 55,564 KB
testcase_02	AC	42 ms 55,628 KB
testcase_03	AC	41 ms 54,772 KB
testcase_04	AC	1,675 ms 207,464 KB
testcase_05	AC	1,232 ms 132,760 KB
testcase_06	AC	175 ms 79,356 KB
testcase_07	AC	190 ms 79,772 KB
testcase_08	AC	201 ms 80,848 KB
testcase_09	AC	195 ms 80,004 KB
testcase_10	AC	163 ms 79,288 KB
testcase_11	AC	96 ms 77,100 KB
testcase_12	AC	122 ms 77,856 KB
testcase_13	AC	272 ms 81,104 KB
testcase_14	AC	216 ms 80,844 KB
testcase_15	AC	164 ms 79,700 KB
testcase_16	AC	141 ms 78,344 KB
testcase_17	AC	131 ms 77,948 KB
testcase_18	AC	180 ms 79,888 KB
testcase_19	AC	185 ms 80,380 KB
testcase_20	AC	117 ms 78,108 KB
testcase_21	AC	251 ms 81,208 KB
testcase_22	AC	145 ms 78,416 KB
testcase_23	AC	351 ms 85,360 KB
testcase_24	AC	165 ms 80,092 KB
testcase_25	AC	155 ms 79,684 KB
testcase_26	AC	152 ms 79,840 KB
testcase_27	AC	150 ms 79,828 KB
testcase_28	AC	151 ms 79,724 KB
testcase_29	AC	107 ms 77,932 KB
testcase_30	AC	86 ms 77,172 KB
testcase_31	AC	42 ms 54,560 KB
testcase_32	AC	42 ms 55,840 KB
testcase_33	AC	42 ms 54,368 KB
testcase_34	AC	43 ms 54,692 KB
testcase_35	AC	43 ms 54,796 KB
testcase_36	AC	45 ms 56,336 KB
testcase_37	AC	130 ms 78,120 KB
testcase_38	AC	126 ms 77,456 KB
testcase_39	AC	54 ms 64,684 KB
testcase_40	AC	107 ms 77,316 KB
testcase_41	AC	139 ms 78,108 KB
testcase_42	AC	138 ms 78,180 KB
testcase_43	AC	149 ms 78,544 KB
testcase_44	AC	173 ms 80,144 KB
testcase_45	AC	191 ms 80,356 KB
testcase_46	AC	220 ms 81,420 KB
testcase_47	AC	225 ms 81,392 KB
testcase_48	AC	168 ms 79,960 KB
testcase_49	AC	186 ms 80,244 KB
testcase_50	AC	115 ms 77,512 KB
testcase_51	AC	201 ms 79,900 KB
testcase_52	AC	111 ms 77,964 KB
testcase_53	AC	188 ms 79,944 KB
testcase_54	AC	43 ms 54,824 KB
testcase_55	AC	54 ms 64,660 KB
testcase_56	AC	43 ms 54,164 KB
testcase_57	AC	57 ms 66,456 KB
testcase_58	AC	41 ms 55,876 KB
testcase_59	AC	74 ms 73,628 KB
testcase_60	AC	42 ms 54,244 KB
testcase_61	AC	54 ms 64,012 KB
testcase_62	AC	44 ms 55,452 KB
testcase_63	AC	42 ms 54,456 KB
testcase_64	AC	64 ms 68,540 KB
testcase_65	AC	42 ms 55,028 KB
testcase_66	AC	43 ms 55,396 KB
testcase_67	AC	41 ms 55,156 KB
testcase_68	AC	45 ms 54,748 KB
testcase_69	AC	147 ms 78,380 KB
testcase_70	AC	156 ms 79,644 KB
testcase_71	AC	123 ms 79,288 KB
testcase_72	AC	108 ms 77,240 KB
testcase_73	AC	136 ms 78,100 KB
testcase_74	AC	177 ms 80,068 KB
testcase_75	AC	161 ms 79,468 KB
testcase_76	AC	210 ms 81,308 KB
testcase_77	AC	228 ms 80,656 KB
testcase_78	AC	101 ms 77,356 KB
testcase_79	AC	248 ms 81,872 KB
testcase_80	AC	212 ms 80,960 KB
testcase_81	AC	226 ms 81,716 KB
testcase_82	AC	177 ms 80,184 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

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)

        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")

yukicoder

結果

テストケース

ソースコード