import sys # sys.stdin.readline() from collections import deque sys.setrecursionlimit(100000000) import heapq INF = int(1e9) def bfs(graph,x,y): dx = [1,0,-1,0] dy = [0,1,0,-1] index = 2 nx = 0 ny = 0 queue = deque() queue.append((x,y)) while queue: flag = 0 a,b = queue.popleft() # 큐에서 원소 2개를 빼오고 graph[a][b] = -1 # 방문 처리해준다 for i in range(4): nx = a + dx[i] # x와 y의 방향 점검 ny = b + dy[i] if nx < 0..