최단거리 - bfs 알고리즘 정답코드 import sys input=sys.stdin.readline from collections import deque dirx=[1,0,-1,0] diry=[0,1,0,-1] def bfs(y,x): visited=[[-1]*N for _ in range(N)] queue=deque() queue.append((y,x)) visited[y][x]=0 while queue: cur=queue.popleft() for i in range(4): ny=cur[0]+diry[i] nx=cur[1]+dirx[i] if 0