[PGS] 블록 이동하기 / lv3 / 60분 실패

https://school.programmers.co.kr/learn/courses/30/lessons/60063

Author: YoonYn9915

YoonYn9915/Graph/2024-09-09-[프로그래머스]-#60063-블록 이동하기.py

@@ -0,0 +1,54 @@
+from collections import deque
+
+dx = [1, 0, -1, 0]
+dy = [0, 1, 0, -1]
+
+MAX = float('inf')
+
+
+def solution(board):
+    N = len(board)
+    answer = 0
+    visited = set()
+    q = deque([(0, 0, 0, 0)])
+
+    while q:
+        x, y, r, t = q.popleft()
+        if (x, y) == (N - 1, N - 1) or (x + dx[r], y + dy[r]) == (N - 1, N - 1):
+            answer = t
+            break
+        if (x, y, r) in visited or (x + dx[r], y + dy[r], (r + 2) % 4) in visited:
+            continue
+        visited.add((x, y, r))
+
+        for i in range(4):
+            ax, ay = x + dx[i], y + dy[i]
+            if not -1 < ax < N or not -1 < ay < N or board[ay][ax] == 1:
+                continue
+            _ax, _ay = ax + dx[r], ay + dy[r]
+            if not -1 < _ax < N or not -1 < _ay < N or board[_ay][_ax] == 1:
+                continue
+            q.append((ax, ay, r, t + 1))
+
+        for i in [-1, 1]:
+            _r = (r + i) % 4
+            ax, ay = x + dx[_r], y + dy[_r]
+            if not -1 < ax < N or not -1 < ay < N or board[ay][ax] == 1:
+                continue
+            cx, cy = ax + dx[r], ay + dy[r]
+            if board[cy][cx] == 1:
+                continue
+            q.append((x, y, _r, t + 1))
+
+        x, y, r = x + dx[r], y + dy[r], (r + 2) % 4
+        for i in [-1, 1]:
+            _r = (r + i) % 4
+            ax, ay = x + dx[_r], y + dy[_r]
+            if not -1 < ax < N or not -1 < ay < N or board[ay][ax] == 1:
+                continue
+            cx, cy = ax + dx[r], ay + dy[r]
+            if board[cy][cx] == 1:
+                continue
+            q.append((x, y, _r, t + 1))
+
+    return answer