#1753 최단경로 https://www.acmicpc.net/problem/1753 import sysimport heapqINF = sys.maxsizen, e = map(int, input().split())target = int(input())# 0번 인덱스는 사용하지 않음. 1~nmaps = [[] for _ in range(n + 1)]# visited = [[False] * (n + 1) for _ in range(n + 1)]for i in range(e): start, end, weight = map(int, input().split()) # 방향그래프 maps[start].append((end, weight))q = []heapq.heappush(q, (0, target..