Notice
Recent Posts
Recent Comments
Link
목록5972 (1)
clohi 님의 블로그
[BOJ / Python] 5972 : 택배 배송
https://www.acmicpc.net/problem/5972 문제 코드import heapqimport sysinput = sys.stdin.readlineINF = int(1e9)n, m = map(int, input().split())graph = [[] for _ in range(n+1)]distance = [INF for _ in range(n+1)]for i in range(m): a, b, c = map(int, input().split()) graph[a].append((b,c)) graph[b].append((a,c))def dijkstra(start): q = [] heapq.heappush(q, (0, start)) distance[start] = ..
Algorithm/BOJ
2025. 5. 18. 20:39