2019.03.16) 백준 최단경로 특집 5편 - 10159(PyPy3)
최적화를 안하는것 같지만 한거다. 12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455from heapq import heappush, heappop INF = 1e9 N = int(input())M = int(input()) # 작은쪽 저장graph1 = {i: list() for i in range(1, N + 1)}# 큰쪽 저장graph2 = {i: list() for i in range(1, N + 1)} for _ in range(M): a, b = map(int, input().split(' ')) graph1[a].append(b) graph2[b].append(a..
2019.03.16