solved(python): programmers

- PCCP 기출문제 / 석유 시추

Author: himitery

programmers/PCCP_기출문제/python/석유_시추/__init__.py

@@ -0,0 +1,46 @@
+from collections import deque
+from typing import List, Tuple
+
+
+def solution(land: List[List[int]]) -> int:
+    n, m = len(land), len(land[0])
+    graph = find_graph(n, m, land)
+
+    maximum = 0
+    for col in range(m):
+        amount, visited = 0, set()
+
+        for row in range(n):
+            group_id, value = graph[row][col]
+            if group_id != 0 and group_id not in visited:
+                visited.add(group_id)
+                amount += value
+
+        maximum = max(maximum, amount)
+
+    return maximum
+
+
+def find_graph(n: int, m: int, land: List[List[int]]) -> List[List[Tuple[int, int]]]:
+    graph, visited, count = [[(0, 0) for _ in range(m)] for _ in range(n)], set(), 0
+
+    for y in range(n):
+        for x in range(m):
+            if land[y][x] == 1 and (x, y) not in visited:
+                stack, cached, count = deque([(x, y)]), set(), count + 1
+
+                while stack:
+                    c, r = stack.pop()
+                    visited.add((c, r))
+                    cached.add((c, r))
+
+                    for dx, dy in [(0, -1), (0, 1), (-1, 0), (1, 0)]:
+                        nx, ny = c + dx, r + dy
+                        if (0 <= nx < m) and (0 <= ny < n) and land[ny][nx] == 1 and (nx, ny) not in visited:
+                            stack.append((nx, ny))
+
+                group_id, amount = count, len(cached)
+                for c, r in cached:
+                    graph[r][c] = (group_id, amount)
+
+    return graph

programmers/PCCP_기출문제/python/석유_시추/main.py

@@ -0,0 +1,122 @@
+[
+  {
+    "params": [
+      [
+        [
+          0,
+          0,
+          0,
+          1,
+          1,
+          1,
+          0,
+          0
+        ],
+        [
+          0,
+          0,
+          0,
+          0,
+          1,
+          1,
+          0,
+          0
+        ],
+        [
+          1,
+          1,
+          0,
+          0,
+          0,
+          1,
+          1,
+          0
+        ],
+        [
+          1,
+          1,
+          1,
+          0,
+          0,
+          0,
+          0,
+          0
+        ],
+        [
+          1,
+          1,
+          1,
+          0,
+          0,
+          0,
+          1,
+          1
+        ]
+      ]
+    ],
+    "expected": 9
+  },
+  {
+    "params": [
+      [
+        [
+          1,
+          0,
+          1,
+          0,
+          1,
+          1
+        ],
+        [
+          1,
+          0,
+          1,
+          0,
+          0,
+          0
+        ],
+        [
+          1,
+          0,
+          1,
+          0,
+          0,
+          1
+        ],
+        [
+          1,
+          0,
+          0,
+          1,
+          0,
+          0
+        ],
+        [
+          1,
+          0,
+          0,
+          1,
+          0,
+          1
+        ],
+        [
+          1,
+          0,
+          0,
+          0,
+          0,
+          0
+        ],
+        [
+          1,
+          1,
+          1,
+          1,
+          1,
+          1
+        ]
+      ]
+    ],
+    "expected": 16
+  }
+]

programmers/PCCP_기출문제/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: any):
+        # When
+        result = solution(*params)
+
+        # Then
+        self.assertEqual(expected, result)
+
+
+if __name__ == "__main__":
+    unittest.main()