코드 from collections import deque import sys input = sys.stdin.readline column, row = map(int, input().split()) zido = [list(input().rstrip()) for _ in range(column)] def bfs(x, y, graph): queue = deque([(x,y)]) dx = [1,-1,0,0] dy = [0,0,1,-1] visited = [[0]* row for _ in range(column)] visited[x][y] = 1 while queue: popx, popy = queue.popleft() for i in range(4): nx = popx + dx[i] ny = popy + dy..
