[백준/파이썬] #17836
오랜만에 답을 안 보고 30분 안에 풀었다. BFS와 heap을 사용해서 풀었다. import heapqINF = 1e9dx = [-1, 1, 0, 0]dy = [0, 0, -1, 1]def direct_path(end_x, end_y): start_x, start_y = 0, 0 visited = [[False] * M for _ in range(N)] visited[start_x][start_y] = True heap = [] heapq.heappush(heap, (0, start_x, start_y)) while heap: dist, cur_x, cur_y = heapq.heappop(heap) if cur_x == end_x and cur_..
2025. 5. 20.