[백준] 1261번_알고스팟

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

1261번: 알고스팟

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

dx = (-1,1,0,0)
dy = (0,0,-1,1)
dist = [[-1]*m for _ in range(n)]
def bfs():
    q = deque()
    q.append((0,0))
    dist[0][0] = 0
    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] == 0 and dist[nx][ny]==-1:
                    q.appendleft((nx,ny))
                    dist[nx][ny] = dist[x][y] 
                elif maze[nx][ny] == 1 and dist[nx][ny]==-1:
                    q.append((nx,ny))
                    dist[nx][ny] = dist[x][y] + 1
    return dist[n-1][m-1]
                    
print(bfs())