[Python] 백준 #2178 미로탐색

www.acmicpc.net/problem/2178

2178번: 미로 탐색

BFS로 해결.

from collections import deque

def dfs(x,y):
    queue=deque()
    queue.append((x,y))
    
    while queue:
        
        x,y=queue.popleft()
        
        for i in range(4):
            nx=x+dx[i]
            ny=y+dy[i]
            
            if(nx<0 or ny<0 or nx>=n or ny >=m):
                continue
                
            if l_list[nx][ny]==0:
                continue
                
            if l_list[nx][ny]==1:
                l_list[nx][ny]=l_list[x][y]+1
                queue.append((nx,ny))
    
    return l_list[n-1][m-1]

n,m=map(int,input().split())
l_list=[]
for i in range(n):
    l_list.append(list(map(int,input())))
    
# 상하좌우로 움직이기
dx=[-1,1,0,0]
dy=[0,0,-1,1] 
           
print(dfs(0,0))