[BOJ] 뱀 / 골드 4 / 100분 실패

https://www.acmicpc.net/problem/3190

Author: YoonYn9915

YoonYn9915/implementation/2024-11-17-[백준]-#3190-뱀.py

@@ -0,0 +1,61 @@
+from collections import deque
+
+n = int(input())
+k = int(input())
+
+graph = [[0] * n for _ in range(n)]
+dx = [0, 1, 0, -1]
+dy = [1, 0, -1, 0]
+
+for i in range(k):
+    a, b = map(int, input().split())
+    graph[a - 1][b - 1] = 2
+
+l = int(input())
+dirDict = dict()
+queue = deque()
+queue.append((0, 0))
+
+for i in range(l):
+    x, c = input().split()
+    dirDict[int(x)] = c
+
+x, y = 0, 0
+graph[x][y] = 1
+cnt = 0
+direction = 0
+
+def turn(alpha):
+    global direction
+    if alpha == 'L':
+        direction = (direction - 1) % 4
+    else:
+        direction = (direction + 1) % 4
+
+
+while True:
+    cnt += 1
+    x += dx[direction]
+    y += dy[direction]
+
+    if x < 0 or x >= n or y < 0 or y >= n:
+        break
+
+    if graph[x][y] == 2:
+        graph[x][y] = 1
+        queue.append((x, y))
+        if cnt in dirDict:
+            turn(dirDict[cnt])
+
+    elif graph[x][y] == 0:
+        graph[x][y] = 1
+        queue.append((x, y))
+        tx, ty = queue.popleft()
+        graph[tx][ty] = 0
+        if cnt in dirDict:
+            turn(dirDict[cnt])
+
+    else:
+        break
+
+print(cnt)