[백준온라인저지] 2178 - 미로탐색

---

 

 

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

2178번: 미로 탐색

import sys

n, m = map(int, sys.stdin.readline().split())

v = [ sys.stdin.readline().rstrip() for i in range(n) ]
visit = [ [0] * (m) for i in range(n) ]

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

queue = [(0, 0)]
visit[0][0] = 1

while queue:
    x, y = queue.pop(0)

    if x == n-1 and y == m-1:
        print(visit[x][y])
        break

    for i in range(4):
        nx = x + dx[i]
        ny = y + dy[i]

        if 0 <= nx < n and 0 <= ny < m:
            if visit[nx][ny] == 0 and v[nx][ny] == '1':
                queue.append((nx, ny))
                visit[nx][ny] = visit[x][y] + 1