백준 1916번 최소비용 구하기

문제 링크: https://www.acmicpc.net/problem/1916

Author: skysign

백준 1916번 최소비용 구하기/main.py

@@ -0,0 +1,37 @@
+import heapq
+import sys
+from typing import Dict
+from collections import defaultdict
+
+
+def solve():
+    N = int(sys.stdin.readline().strip())
+    M = int(sys.stdin.readline().strip())
+    maps = [sys.maxsize for _ in range(N + 1)]
+    edges: Dict = defaultdict(list)
+
+    for _ in range(M):
+        fr, to, cost = map(int, sys.stdin.readline().strip().split(' '))
+        edges[fr].append([to, cost])
+
+    depature, destination = map(int, sys.stdin.readline().strip().split(' '))
+    hq = []
+    maps[depature] = 0
+    heapq.heappush(hq, [0, depature])
+
+    while hq:
+        cost_old, depature = heapq.heappop(hq)
+
+        if maps[depature] < cost_old:
+            continue
+
+        for dest, cost_new in edges[depature]:
+            if maps[dest] > cost_old + cost_new:
+                maps[dest] = cost_old + cost_new
+                heapq.heappush(hq, [cost_old + cost_new, dest])
+
+    print(maps[destination])
+
+
+if __name__ == '__main__':
+    solve()

백준 1916번 최소비용 구하기/test1.txt

@@ -0,0 +1,11 @@
+5
+8
+1 2 2
+1 3 3
+1 4 1
+1 5 10
+2 4 2
+3 4 1
+3 5 1
+4 5 3
+1 5

백준 1916번 최소비용 구하기/test1_answer.txt

@@ -0,0 +1 @@
+4

백준 1916번 최소비용 구하기/test_main.py

@@ -0,0 +1,23 @@
+import sys
+from pathlib import Path
+from unittest import TestCase
+from main import solve
+
+
+class Test(TestCase):
+    def my_solve(self, testcase_input):
+        sys.stdin = open(testcase_input, 'r')
+        stdout = sys.stdout
+        sys.stdout = open('stdout.txt', 'w')
+        solve()
+        sys.stdout.close()
+        sys.stdout = stdout
+
+    def test_solve(self, testcase_number: str):
+        self.my_solve('test' + testcase_number + '.txt')
+        self.assertEqual(
+            Path('test' + testcase_number + '_answer.txt').read_text().strip(),
+            Path('stdout.txt').read_text().strip())
+
+    def test1_solve(self):
+        self.test_solve('1')