문제https://www.acmicpc.net/problem/1012문제 풀이(정답)from collections import dequeT = int(input())dx = [0, 0, -1, 1]dy = [1, -1, 0, 0]def bfs(x, y):    queue = deque([(x,y)])    matrix[x][y] = 0    while queue:        x, y = queue.popleft()      # 방문 좌표 제거        for i in range(4):            nx = x + dx[i]            ny = y + dy[i]            if nx 0 or nx >= m or ny 0 or ny >= n:                cont..