[프로그래머스] Level2, 배달 (Python)
문제 https://programmers.co.kr/learn/courses/30/lessons/12978?language=python3 코딩테스트 연습 - 배달 5 [[1,2,1],[2,3,3],[5,2,2],[1,4,2],[5,3,1],[5,4,2]] 3 4 6 [[1,2,1],[1,3,2],[2,3,2],[3,4,3],[3,5,2],[3,5,3],[5,6,1]] 4 4 programmers.co.kr 코드 import sys import heapq def solution(N, road, K): answer = 0 INF = sys.maxsize graph = [[] for _ in range(N+1)] distance = [INF for _ in range(N+1)] for a,b,c in road..
알고리즘/프로그래머스
2021. 9. 13. 14:04