solved(python): baekjoon 16236

Author: himitery

baekjoon/python/16236/__init__.py

@@ -0,0 +1,85 @@
+import heapq
+import sys
+
+read = lambda: sys.stdin.readline().rstrip()
+
+
+class Problem:
+    def __init__(self):
+        self.n = int(read())
+        self.graph = [list(map(int, read().split())) for _ in range(self.n)]
+
+    def solve(self) -> None:
+        graph = self.graph
+        shark = self.find_shark(graph)
+
+        shark_size, weight, time = 2, 0, 0
+        while True:
+            found = self.find_nearest_fish(
+                graph,
+                shark,
+                shark_size,
+            )
+            if not found:
+                break
+
+            (y, x), append_time = found
+
+            weight += 1
+            if weight == shark_size:
+                shark_size += 1
+                weight = 0
+
+            time += append_time
+            graph[shark[0]][shark[1]] = 0
+            shark = (y, x)
+            graph[shark[0]][shark[1]] = 9
+
+        print(time)
+
+    def find_shark(
+        self,
+        graph: list[list[int]],
+    ) -> tuple[int, int]:
+        for row in range(self.n):
+            for col in range(self.n):
+                if graph[row][col] == 9:
+                    return row, col
+
+    def find_nearest_fish(
+        self,
+        graph: list[list[int]],
+        shark: tuple[int, int],
+        shark_size: int,
+    ) -> tuple[tuple[int, int], int] | None:
+        queue, visited, found = [(shark, 0)], {shark}, []
+        while queue and not found:
+            candidates = []
+            for (y, x), time in queue:
+                for dx, dy in [(-1, 0), (1, 0), (0, -1), (0, 1)]:
+                    if (
+                        (0 <= x + dx < self.n and 0 <= y + dy < self.n)
+                        and graph[y + dy][x + dx] <= shark_size
+                        and (
+                            y + dy,
+                            x + dx,
+                        )
+                        not in visited
+                    ):
+                        candidates.append(((y + dy, x + dx), time + 1))
+                        visited.add((y + dy, x + dx))
+                        if 0 < graph[y + dy][x + dx] < shark_size:
+                            heapq.heappush(
+                                found, ((y + dy, x + dx), ((y + dy, x + dx), time + 1))
+                            )
+
+            queue = candidates
+
+        if found:
+            return heapq.heappop(found)[1]
+
+        return None
+
+
+if __name__ == "__main__":
+    Problem().solve()

baekjoon/python/16236/main.py

@@ -0,0 +1,78 @@
+[
+  {
+    "input": [
+      "3",
+      "0 0 0",
+      "0 0 0",
+      "0 9 0"
+    ],
+    "expected": [
+      "0"
+    ]
+  },
+  {
+    "input": [
+      "3",
+      "0 0 1",
+      "0 0 0",
+      "0 9 0"
+    ],
+    "expected": [
+      "3"
+    ]
+  },
+  {
+    "input": [
+      "4",
+      "4 3 2 1",
+      "0 0 0 0",
+      "0 0 9 0",
+      "1 2 3 4"
+    ],
+    "expected": [
+      "14"
+    ]
+  },
+  {
+    "input": [
+      "6",
+      "5 4 3 2 3 4",
+      "4 3 2 3 4 5",
+      "3 2 9 5 6 6",
+      "2 1 2 3 4 5",
+      "3 2 1 6 5 4",
+      "6 6 6 6 6 6"
+    ],
+    "expected": [
+      "60"
+    ]
+  },
+  {
+    "input": [
+      "6",
+      "6 0 6 0 6 1",
+      "0 0 0 0 0 2",
+      "2 3 4 5 6 6",
+      "0 0 0 0 0 2",
+      "0 2 0 0 0 0",
+      "3 9 3 0 0 1"
+    ],
+    "expected": [
+      "48"
+    ]
+  },
+  {
+    "input": [
+      "6",
+      "1 1 1 1 1 1",
+      "2 2 6 2 2 3",
+      "2 2 5 2 2 3",
+      "2 2 2 4 6 3",
+      "0 0 0 0 0 6",
+      "0 0 0 0 0 9"
+    ],
+    "expected": [
+      "39"
+    ]
+  }
+]

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