코드 # 가중치 없는 최단거리 -> bfs import sys from collections import deque input = sys.stdin.readline n, m = map(int, input().split()) dx, dy = (1,-1,0,0), (0,0,1,-1) # 상하좌우 이동 graph = [[*map(int, input().split())] for _ in range(n)] visited = [[0]*m for _ in range(n)] # 방문기록 def bfs(i,j): queue = deque([(i,j)]) while queue: px,py = queue.popleft() for i in range(4): nx = px + dx[i] ny = py + dy[i] if 0
