코드 from collections import deque import sys input = sys.stdin.readline m,n = map(int, input().split()) box = [list(map(int,input().split())) for _ in range(n)] dx, dy = [1,-1,0,0], [0,0,1,-1] startpoint = [] for i in range(n): for j in range(m): if box[i][j] == 1: startpoint.append((i,j)) # 토마토가 있는 위치 기록 및 큐에 삽입. def bfs(graph): queue = deque(startpoint) while queue: popx, popy = queue.popleft()..
