[백준] 2178번_미로탐색

문제 링크 : https://www.acmicpc.net/problem/2178

2178번: 미로 탐색

from collections import deque

n,m = map(int,input().split())
maze = [list(map(int,input())) for _ in range(n)]

dx = (-1,1,0,0)
dy = (0,0,1,-1)

def bfs():
    q = deque()
    q.append((0,0))
    visited = []
    visited.append((0,0))
    global dist
    dist = [[0]*m for _ in range(n)]
    dist[0][0] = 1
    while q:
        x,y = q.popleft()
        for i in range(4):
            nx,ny = x+dx[i], y+dy[i]
            if 0<=nx<n and 0<=ny<m:
                if maze[nx][ny] == 1 and (nx,ny) not in visited:
                    visited.append((nx,ny))
                    q.append((nx,ny))
                    dist[nx][ny] = dist[x][y] +1
    
bfs()
print(dist[n-1][m-1])