2019.03.14) 백준 최단경로 특집 3편 - 1504, 2606(PyPy3)
컴퓨터를 바꿨더니 깃이 꼬였다..... 망할 1504번1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556from heapq import heappop, heappush INF = 1e9 N, E = map(int, input().split(' ')) graph = {i: dict() for i in range(1, N + 1)} for i in range(E): a, b, c = map(int, input().split(' ')) if graph[a].get(b, False): graph[a][b] = min(c, graph[a][b]) else: graph[a][b] =..
2019.03.14