[코드트리] 메두사와 전사들

풀이 코드 from collections import deque N, M = map(int, input().split()) sy, sx, ey, ex = map(int, input().split()) m_f_list = list(map(int, input().split())) m_list = [] board=[] for i in range(M): m_list.append((m_f_list[2*i], m_f_list[2*i+1])) for _ in range(N): board.append(list(map(int, input().split()))) dy=[-1,1,0,0] dx=[0,0,-1,1] s_min_list = 0 # print(m_list) visited = [[False] * N for _ in range(N)] d = deque() d.append((sy,sx,[])) visited[sy][sx] = True while d: y, x, now_list = d.popleft...