solved(python): programmers

- 2025 프로그래머스 코드챌린지 1차 예선 / 지게차와 크레인

Author: himitery

programmers/2025_프로그래머스_코드챌린지_1차_예선/python/지게차와_크레인/__init__.py

@@ -0,0 +1,54 @@
+import itertools
+from collections import deque
+from typing import List, Tuple, Set
+
+
+def solution(storage: List[str], requests: List[str]):
+    rows, cols = len(storage), len(storage[0])
+
+    sides, visited = init_sides(rows, cols), set()
+
+    for request in requests:
+        selected = {
+            (x, y)
+            for x, y in (sides if len(request) == 1 else set(itertools.product(range(cols), range(rows)))) - visited
+            if storage[y][x] == request[0]
+        }
+        visited |= selected
+        sides |= find_nested_sides(rows, cols, selected if len(request) == 0 else selected & sides, sides, visited)
+
+    return rows * cols - len(visited)
+
+
+def init_sides(rows: int, cols: int) -> Set[Tuple[int, int]]:
+    return (
+        {(x, 0) for x in range(cols)}
+        | {(x, rows - 1) for x in range(cols)}
+        | {(0, y) for y in range(rows)}
+        | {(cols - 1, y) for y in range(rows)}
+    )
+
+
+def find_nested_sides(
+    rows: int,
+    cols: int,
+    selected: Set[Tuple[int, int]],
+    sides: Set[Tuple[int, int]],
+    visited: Set[Tuple[int, int]],
+) -> Set[Tuple[int, int]]:
+    stack, nested = deque(list(selected)), set()
+
+    while stack:
+        x, y = stack.pop()
+
+        for dx, dy in [(0, -1), (0, 1), (-1, 0), (1, 0)]:
+            if 0 <= x + dx < cols and 0 <= y + dy < rows and (x + dx, y + dy) not in sides | nested:
+                nested.add((x + dx, y + dy))
+                if (x + dx, y + dy) in visited:
+                    stack.append((x + dx, y + dy))
+
+    return nested
+
+
+if __name__ == "__main__":
+    solution(list(input()), list(input()))

programmers/2025_프로그래머스_코드챌린지_1차_예선/python/지게차와_크레인/main.py

@@ -0,0 +1,61 @@
+[
+  {
+    "params": [
+      [
+        "AZWQY",
+        "CAABX",
+        "BBDDA",
+        "ACACA"
+      ],
+      [
+        "A",
+        "BB",
+        "A"
+      ]
+    ],
+    "expected": "11"
+  },
+  {
+    "params": [
+      [
+        "HAH",
+        "HBH",
+        "HHH",
+        "HAH",
+        "HBH"
+      ],
+      [
+        "C",
+        "B",
+        "B",
+        "B",
+        "B",
+        "H"
+      ]
+    ],
+    "expected": "4"
+  },
+  {
+    "params": [
+      [
+        "AAAAA",
+        "ABCDA",
+        "AGAEA",
+        "AZAFA",
+        "ZYAAA"
+      ],
+      [
+        "BB",
+        "DD",
+        "Z",
+        "Y",
+        "Z",
+        "G",
+        "C",
+        "E",
+        "F"
+      ]
+    ],
+    "expected": "16"
+  }
+]

programmers/2025_프로그래머스_코드챌린지_1차_예선/python/지게차와_크레인/sample.json

@@ -0,0 +1,28 @@
+import json
+import os
+import unittest
+
+from parameterized import parameterized
+
+from .main import solution
+
+
+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["params"], case["expected"]) for case in json.load(file)]
+
+
+class TestCase(unittest.TestCase):
+    @parameterized.expand(load_sample("sample.json"))
+    def test_case(self, params: list, expected: str):
+        # When
+        result = solution(*params)
+
+        # Then
+        self.assertEqual(expected, str(result))
+
+
+if __name__ == "__main__":
+    unittest.main()