하루하루는 성실하게 인생 전체는 되는대로

from collections import deque n, m = map(int, input().split()) graph = [list(map(int, input())) for i in range(n)] def bfs(x,y): que = deque() que.append((x, y)) while que: x, y = que.popleft() for i in range(4): nx = x + dx[i] ny = y + dy[i] if nx=n or ny=m: continue if graph[nx][ny]==0: continue if graph[nx][ny]==1: graph[nx][ny]=graph[x][y]+1 que.append((nx, ny)) dx = [-1,1,0,0] dy = [0,0,-1,..