[백준] 2178: 미로 탐색

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

 

from collections import deque
import sys
n, m = map(int, sys.stdin.readline().split())
graph = [ list(map(int, sys.stdin.readline().strip())) for _ in range(n) ]
visited = [ [0]*m for _ in range(n) ]
dx = [ 0, 0, -1, 1 ]
dy = [ -1, 1, 0, 0 ]
def bfs():
    visited[0][0] = 1
    q = deque()
    q.append([0, 0])
    while q:
        x, y = q.popleft()
        if x == n-1 and y == m-1:
            return visited[x][y]
        for i in range(4):
            nx = x + dx[i]
            ny = y + dy[i]
            if 0 <= nx < n and 0 <= ny < m:
                if graph[nx][ny] == 1 and not visited[nx][ny]:
                    visited[nx][ny] = visited[x][y] + 1
                    q.append([nx, ny])
print(bfs())

visited가 아닌 graph에 직접 +1을 추가해가며 return graph[x-1][y-1]을 해줘도 괜찮습니다.

토마토, 나이트의 이동