본문 바로가기

다익스트라10

[백준] 10282번 - 해킹 (파이썬) # 해킹 import heapq import sys input = sys.stdin.readline def hacking(n, start): dist = [sys.maxsize] * (n+1) dist[start] = 0 q = [] heapq.heappush(q, (0, start)) while q: time, computer = heapq.heappop(q) for ntime, ncom in arr[computer]: total = time + ntime if dist[ncom] > total: dist[ncom] = total heapq.heappush(q, (total, ncom)) result_time = 0 result_com = 0 for x in dist: if x != sys.maxsiz.. 2022. 3. 11.
[백준] 11779번 - 최소비용 구하기 2 (파이썬) # 최소비용 구하기 2 import sys import heapq input = sys.stdin.readline MAX = sys.maxsize N, M = int(input()), int(input()) arr = [[]for _ in range(N+1)] for _ in range(M): start, end, cost = map(int, input().split()) arr[start].append((cost, end)) def dijkstra(start): q = [] heapq.heappush(q, (0, start)) result[start] = 0 while q: cost, city = heapq.heappop(q) if result[city] < cost: continue for ncost.. 2022. 2. 9.
[백준] 1238번 - 파티 (파이썬) # 파티 import sys import heapq input = sys.stdin.readline MAX = sys.maxsize N, M, X = map(int, input().split()) arr = [[] for _ in range(N+1)] for _ in range(M): a, b, cost = map(int, input().split()) arr[a].append((cost, b)) come = [MAX] * (N+1) go = [MAX] * (N+1) def go_dijkstra(x): q = [] heapq.heappush(q, (0, x)) go[x] = 0 while q: cost, node = heapq.heappop(q) for ncost, nnode in arr[node]: i.. 2022. 1. 25.

티스토리툴바