백준 2178번 미로 탐색 파이썬 - bfs

from collections import deque import sys n, m = map(int, sys.stdin.readline().split()) X = [[0] * m for i in range(n)] for i in range(n): line = sys.stdin.readline() for j in range(m): X[i][j] = int(line[j]) dr = [-1, 1, 0, 0] dc = [0, 0, -1, 1] queue = deque() queue.append((0, 0)) while queue: x, y = queue.popleft() for i in range(4): nx = x + dr[i] ny = y + dc[i] if 0