Kcm boj (#87)

* 찬민 백준 숙제

* 저번주 백준숙제

Author: bsyzch

cmkim/이것이 취업을 위한 코딩 테스트다/연구소_341p.py

@@ -0,0 +1,61 @@
+n, m = map(int, input().split())
+
+arr = []
+temp = [[0] * m for _ in range(n)]
+result = 0
+
+dx = [-1, 1, 0, 0]
+dy = [0, 0, -1, 1]
+
+for i in range(n):
+    arr.append(list(map(int, input().split())))
+
+
+
+def dfs(count):
+    global result
+
+    if count == 3:
+        for i in range(n):
+            for j in range(m):
+                temp[i][j] = arr[i][j]
+
+        for i in range(n):
+            for j in range(m):
+                if temp[i][j] == 2:
+                    virus(i, j)
+
+        result = max(result, get_score())
+        return
+
+    for i in range(n):
+        for j in range(m):
+            if arr[i][j] == 0:
+                arr[i][j] = 1
+                count += 1
+                dfs(count)
+                arr[i][j] = 0
+                count -= 1
+
+
+def virus(x, y):
+    for i in range(4):
+        nx = x + dx[i]
+        ny = y + dy[i]
+        if 0 <= nx < n and 0 <= ny < m:
+            if temp[nx][ny] == 0:
+                temp[nx][ny] = 2
+                virus(nx, ny)
+
+
+def get_score():
+    score = 0
+    for i in range(n):
+        for j in range(m):
+            if temp[i][j] == 0:
+                score += 1
+    return score
+
+
+dfs(0)
+print(result)