solved(python): baekjoon 28707

Author: himitery

baekjoon/python/28707/__init__.py

@@ -0,0 +1,52 @@
+import heapq
+import sys
+
+read = lambda: sys.stdin.readline().rstrip()
+
+
+class Problem:
+    def __init__(self):
+        self.n = int(read())
+        self.array = tuple(map(int, read().split()))
+        self.target = tuple(sorted(self.array))
+        self.m = int(read())
+        self.graph = {x: [] for x in range(self.n)}
+
+        for _ in range(self.m):
+            left, right, weight = map(int, read().split())
+            self.graph[left - 1].append((weight, right - 1))
+            self.graph[right - 1].append((weight, left - 1))
+
+    def solve(self) -> None:
+        print(self.dijkstra())
+
+    def dijkstra(self) -> int:
+        heap, visited, costs = [(0, self.array)], set(), {self.array: 0}
+
+        while heap:
+            cost, array = heapq.heappop(heap)
+            if array == self.target:
+                return cost
+
+            if array in visited:
+                continue
+
+            visited.add(array)
+            for src in range(self.n):
+                for weight, dest in self.graph[src]:
+                    if src >= dest:
+                        continue
+
+                    new_array = list(array)
+                    new_array[src], new_array[dest] = new_array[dest], new_array[src]
+                    new_array = tuple(new_array)
+
+                    if new_array not in costs or cost + weight < costs[new_array]:
+                        costs[new_array] = cost + weight
+                        heapq.heappush(heap, (cost + weight, new_array))
+
+        return -1
+
+
+if __name__ == "__main__":
+    Problem().solve()

baekjoon/python/28707/main.py

@@ -0,0 +1,44 @@
+[
+  {
+    "input": [
+      "4",
+      "1 4 3 2",
+      "4",
+      "1 2 4",
+      "2 3 3",
+      "3 4 2",
+      "1 4 10"
+    ],
+    "expected": [
+      "7"
+    ]
+  },
+  {
+    "input": [
+      "4",
+      "1 3 1 3",
+      "6",
+      "1 2 3",
+      "1 3 3",
+      "1 4 3",
+      "2 3 3",
+      "2 4 1",
+      "3 4 1"
+    ],
+    "expected": [
+      "2"
+    ]
+  },
+  {
+    "input": [
+      "5",
+      "5 4 3 2 1",
+      "2",
+      "1 2 5",
+      "3 4 3"
+    ],
+    "expected": [
+      "-1"
+    ]
+  }
+]

baekjoon/python/28707/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()