2. [re] 구슬 탈출 2

아현·2021년 9월 14일
0

Algorithm

목록 보기
319/400
post-custom-banner

백준


1. 시뮬레이션


# '.', '#', 'O', 'R', 'B
# 빈칸, 장애물 or 벽, 구멍, 빨강, 파랑
import sys
from collections import deque
input = sys.stdin.readline
n, m = map(int, input().split())
board = [list(input().rstrip()) for _ in range(n)]

for i in range(n):
    for j in range(n):
        if board[i][j] == "R":
            rx, ry = i, j
        elif board[i][j] == "B":
            bx, by = i, j

dx = [0, 0, -1, 1]
dy = [-1, 1, 0, 0]

def roll(rx, ry, bx, by):
    q = deque()
    q.append((rx, ry, bx, by))
    visit = []
    visit.append((rx, ry, bx, by))
    count = 0
    while q:
        for _ in range(len(q)):
            rx, ry, bx, by = q.popleft()
            if count > 10:
                print(-1)
                return
            if board[rx][ry] == "O":
                print(count)
                return
            
            for i in range(4):
                nrx, nry = rx, ry
                while True:
                    nrx += dx[i]
                    nry += dy[i]
                    if board[nrx][nry] == "#":
                        nrx -= dx[i]
                        nry -= dy[i]
                        break
                    if board[nrx][nry] == "O":
                        break
                
                nbx, nby = bx, by
                while True:
                    nbx += dx[i]
                    nby += dy[i]
                    if board[nbx][nby] == "#":
                        nbx -= dx[i]
                        nby -= dy[i]
                        break
                    if board[nbx][nby] == "O":
                        break
                
                if board[nbx][nby] == "O":
                    continue
                
                if nrx == nbx and nry == nby:
                    if abs(nrx - rx) + abs(nry - ry) > abs(nbx - bx) + abs(nby - by):
                        nrx -= dx[i]
                        nry -= dy[i]
                    else:
                        nbx -= dx[i]
                        nby -= dy[i]
                
                if (nrx, nry, nbx, nby) not in visit:
                    q.append((nrx, nry, nbx, nby))
                    visit.append((nrx, nry, nbx, nby))
        count += 1
    print(-1)


roll(rx, ry, bx, by)




profile
For the sake of someone who studies computer science
post-custom-banner

0개의 댓글