백준 14938 - 서강 그라운드

12345678910111213141516171819202122232425262728293031323334353637383940import sys,heapq def dijkstra(st): q = [] heapq.heappush(q, [0,st]) distance[st] = 0 while q: dist, node = heapq.heappop(q) if distance[node] >= dist: for v in graph[node]: cost = dist + v[1] if cost < distance[v[0]]: distance[v[0]] = cost heapq.heappush(q,[cost,v[0]]) n,m,r = map(int, sys.stdin.readline().split())items = [0] + list(map(int, sys.stdin.readline().split()))graph = [[] for _ in range(n+1)]distance = [int(1e9)] * (n+1)for _ in range(r): a,b,l = map(int, sys.stdin.readline().split()) graph[a].append([b,l])..........

원문링크 : 백준 14938 - 서강 그라운드