Merge pull request #124 from AlgoLeadMe/32-Munbin-Lee

32-Munbin-Lee

Munbin-Lee/README.md

@@ -32,6 +32,7 @@
 | 29차시 | 2024.01.19 |  유니온파인드  | <a href="https://www.acmicpc.net/problem/1043">거짓말</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/114 |
 | 30차시 | 2024.01.23 |  정수론  | <a href="https://www.acmicpc.net/problem/17425">약수의 합</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/118 |
 | 31차시 | 2024.01.27 |  이분탐색  | <a href="https://www.acmicpc.net/problem/2143">두 배열의 합</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/122 |
+| 32차시 | 2024.01.30 |  백트래킹  | <a href="https://www.acmicpc.net/problem/17114">하이퍼 토마토</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/124 |
 | 33차시 | 2024.02.04 |  정수론  | <a href="https://www.acmicpc.net/problem/14905">소수 4개의 합</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/128 |
 | 34차시 | 2024.02.06 |  구현  | <a href="https://www.acmicpc.net/problem/1756">피자 굽기</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/133 |
 ---

Munbin-Lee/백트래킹/32-하이퍼 토마토.py

@@ -0,0 +1,71 @@
+from math import prod
+from collections import deque
+
+stdin = open(0)
+sizes = list(map(int, stdin.readline().split()))
+totalSize = prod(sizes)
+board = []
+unripe = 0
+index = 0
+deq = deque()
+
+for line in stdin.read().splitlines():
+    for num in map(int, line.split()):
+        board.append(num)
+
+        if num == 0:
+            unripe += 1
+
+        if num == 1:
+            deq.append(index)
+
+        index += 1
+
+if unripe == 0:
+    print('0')
+    exit()
+
+def extract(x):
+    answer = [0] * 11
+    divisor = totalSize
+
+    for i in range(10, -1, -1):
+        divisor //= sizes[i]
+        answer[i] = x // divisor
+        x %= divisor
+
+    return answer
+
+def compress(ls):
+    answer = 0
+    coefficient = 1
+
+    for i in range(0, 11):
+        answer += ls[i] * coefficient
+        coefficient *= sizes[i]
+
+    return answer
+
+while deq:
+    cur = deq.popleft()
+    positions = extract(cur)
+
+    for i in range(0, 11):
+        for offset in (-1, 1):
+            positions[i] += offset
+
+            if 0 <= positions[i] < sizes[i]:
+                next = compress(positions)
+
+                if board[next] == 0:
+                    board[next] = board[cur] + 1
+                    unripe -= 1
+                    deq.append(next)
+
+            positions[i] -= offset
+
+        if unripe == 0:
+            print(board[cur])
+            exit()
+
+print('-1')