평범한 BFS 그 양배추밭이랑 똑같은 문제다. import sys input = sys.stdin.readline from collections import deque dx = [0,0,1,-1] dy = [1,-1,0,0] def BFS(i,j): queue = deque() queue.append([i,j]) while queue: x,y = queue.popleft() for i in range(4): nx=x+dx[i] ny=y+dy[i] if 0