14-wnsmir

wnsmir/최단경로/전보.py

@@ -0,0 +1,39 @@
+import heapq
+import sys
+
+input = sys.stdin.readline
+INF = 987654321
+
+N, M ,start = map(int, input().split())
+graph = [[]for i in range(N+1)]
+distance = [INF]*(N+1)
+
+for _ in range(M+1):
+    X, Y, Z = map(int, input().split())
+    graph[X].append(Y, Z)
+
+def dijkstra(start):
+    q = []
+    heapq.heappush(q, (0,start))
+    distance[start] = 0
+    while q:
+        dist, now = heapq.heappop(q)
+        if distance[now] < dist:
+            continue
+        for i in graph[now]:
+            cost = dist + i[1]
+            if cost < distance[i[0]]:
+                distance[i[0]] = cost
+                heapq.heappush(q, (cost,i[0]))
+
+dijkstra(start)
+
+count = 0
+max_distance = 0
+
+for d in distance:
+    if d != INF:
+        count += 1
+        max_distance = max(max_distance, d)
+
+print(count -1, max_distance)