solved(python): baekjoon 11779

Author: himitery

baekjoon/python/11779/__init__.py

@@ -0,0 +1,54 @@
+import heapq
+import math
+import sys
+from collections import defaultdict
+
+read = lambda: sys.stdin.readline().rstrip()
+
+
+class Problem:
+    def __init__(self):
+        self.n = int(read())
+        self.m = int(read())
+        self.bus = defaultdict(list)
+
+        for _ in range(self.m):
+            src, dest, weight = map(int, read().split())
+            self.bus[src - 1].append((dest - 1, weight))
+
+        self.src, self.dest = map(lambda x: int(x) - 1, read().split())
+
+    def solve(self) -> None:
+        weights = [math.inf] * self.n
+        weights[self.src] = 0
+
+        queue, path = [(0.0, self.src)], [-1 for _ in range(self.n)]
+        while queue:
+            weight, city = heapq.heappop(queue)
+            weight = -weight
+            if weights[city] < weight:
+                continue
+
+            for next_city, next_weight in self.bus[city]:
+                if weight + next_weight < weights[next_city]:
+                    weights[next_city] = weight + next_weight
+                    path[next_city] = city
+                    heapq.heappush(queue, (-weights[next_city], next_city))
+
+        res = self.find_path(path)
+
+        print(int(weights[self.dest]))
+        print(len(res))
+        print(*res)
+
+    def find_path(self, path: list[int]) -> list[int]:
+        current, result = self.dest, []
+        while current != -1:
+            result.append(current + 1)
+            current = path[current]
+
+        return list(reversed(result))
+
+
+if __name__ == "__main__":
+    Problem().solve()

baekjoon/python/11779/main.py

@@ -0,0 +1,36 @@
+[
+  {
+    "input": [
+      "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"
+    ],
+    "expected": [
+      "4",
+      "3",
+      "1 3 5"
+    ]
+  },
+  {
+    "input": [
+      "3",
+      "2",
+      "1 2 100000",
+      "2 3 100000",
+      "1 3"
+    ],
+    "expected": [
+      "200000",
+      "3",
+      "1 2 3"
+    ]
+  }
+]

baekjoon/python/11779/sample.json

@@ -0,0 +1,36 @@
+import json
+import os.path
+import unittest
+from io import StringIO
+from unittest.mock import patch
+
+from parameterized import parameterized
+
+from main import Problem
+
+
+def load_sample(filename: str):
+    path = os.path.join(os.path.dirname(os.path.abspath(__file__)), filename)
+
+    with open(path, "r") as file:
+        return [(case["input"], case["expected"]) for case in json.load(file)]
+
+
+class TestCase(unittest.TestCase):
+    @parameterized.expand(load_sample("sample.json"))
+    def test_case(self, case: str, expected: list[str]):
+        # When
+        with (
+            patch("sys.stdin.readline", side_effect=case),
+            patch("sys.stdout", new_callable=StringIO) as output,
+        ):
+            Problem().solve()
+
+            result = output.getvalue().rstrip()
+
+        # Then
+        self.assertEqual("\n".join(expected), result)
+
+
+if __name__ == "__main__":
+    unittest.main()