[백준 1800번] 인터넷 설치 (Python3)
import sys input = sys.stdin.readline from heapq import heappush,heappop INF=1e9 N,M,K = map(int,input().split()) graph = [[] for i in range(N)] for i in range(M): x,y,w = map(int,input().split()) graph[x-1].append((y-1,w)) graph[y-1].append((x-1,w)) DP = [[INF]*N for i in range(K+1)] hq = [] heappush(hq,(0,0)) while hq: w,now = heappop(hq) if DP[0][now]
[백준 1162번] 도로포장 (Python3)
import sys input = sys.stdin.readline from heapq import heappush,heappop INF=sys.maxsize N,M,K = map(int,input().split()) graph = [[] for i in range(N)] for i in range(M): x,y,w = map(int,input().split()) graph[x-1].append((y-1,w)) graph[y-1].append((x-1,w)) DP = [[INF]*N for i in range(K+1)] hq = [] heappush(hq,(0,0)) while hq: w,now = heappop(hq) if DP[0][now]