이 문제는 bfs를 활용하여 풀었다. 👩🏻‍💻 코드 구현 from collections import deque m, n = map(int, input().split()) graph = [list(map(int, input().split())) for _ in range(n)] queue = deque([]) dx = [-1, 1, 0, 0] dy = [0, 0, -1, 1] day = 0 for i in range(n): for j in range(m): if graph[i][j] == 1: queue.append([i, j]) def bfs(): while queue: x, y = queue.popleft() for i in range(4): nx, ny = dx[i] + x, dy[i] + y if 0