solved(python): baekjoon 16946

Author: himitery

baekjoon/python/16946/__init__.py

@@ -0,0 +1,59 @@
+import sys
+from collections import deque
+
+read = lambda: sys.stdin.readline().rstrip()
+
+
+class Problem:
+    def __init__(self):
+        self.n, self.m = map(int, read().split())
+        self.matrix = [list(map(int, list(read()))) for _ in range(self.n)]
+
+    def solve(self) -> None:
+        for row in self.update_matrix():
+            print(*row, sep="")
+
+    def update_matrix(self) -> list[list[int]]:
+        for count, walls in self.find_group():
+            for x, y in walls:
+                self.matrix[y][x] += count
+                self.matrix[y][x] %= 10
+
+        return self.matrix
+
+    def find_group(self) -> list[tuple[int, set[tuple[int, int]]]]:
+        group, stack, visited = (
+            [],
+            deque([(1, {(x, y)}, set()) for x in range(self.m) for y in range(self.n) if self.matrix[y][x] == 0]),
+            set(),
+        )
+
+        while stack:
+            count, paths, walls = stack.pop()
+            if len(paths - visited) != len(paths):
+                continue
+
+            new_path = set()
+            for x, y in paths:
+                visited.add((x, y))
+
+                for dx, dy in ((0, 1), (0, -1), (1, 0), (-1, 0)):
+                    nx, ny = x + dx, y + dy
+                    if (nx, ny) in visited or not (0 <= nx < self.m and 0 <= ny < self.n):
+                        continue
+
+                    if self.matrix[ny][nx] == 0:
+                        new_path.add((nx, ny))
+                    else:
+                        walls.add((nx, ny))
+
+            if new_path:
+                stack.append((count + len(new_path), new_path, walls))
+            else:
+                group.append((count, walls))
+
+        return group
+
+
+if __name__ == "__main__":
+    Problem().solve()

baekjoon/python/16946/main.py

@@ -0,0 +1,64 @@
+[
+  {
+    "input": [
+      "3 3",
+      "101",
+      "010",
+      "101"
+    ],
+    "expected": [
+      "303",
+      "050",
+      "303"
+    ]
+  },
+  {
+    "input": [
+      "4 5",
+      "11001",
+      "00111",
+      "01010",
+      "10101"
+    ],
+    "expected": [
+      "46003",
+      "00732",
+      "06040",
+      "50403"
+    ]
+  },
+  {
+    "input": [
+      "5 5",
+      "10000",
+      "10000",
+      "10000",
+      "10000",
+      "11000"
+    ],
+    "expected": [
+      "00000",
+      "00000",
+      "00000",
+      "00000",
+      "10000"
+    ]
+  },
+  {
+    "input": [
+      "5 5",
+      "10000",
+      "10000",
+      "10000",
+      "10000",
+      "10000"
+    ],
+    "expected": [
+      "10000",
+      "10000",
+      "10000",
+      "10000",
+      "10000"
+    ]
+  }
+]

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