|
| 1 | +import heapq |
| 2 | +import math |
| 3 | +import sys |
| 4 | +from collections import defaultdict |
| 5 | + |
| 6 | +read = lambda: sys.stdin.readline().rstrip() |
| 7 | + |
| 8 | + |
| 9 | +class Problem: |
| 10 | + def __init__(self): |
| 11 | + self.n, self.m = int(read()), int(read()) |
| 12 | + |
| 13 | + self.graph = defaultdict(list[tuple[int, int]]) |
| 14 | + for src, dest, price in [map(int, read().split()) for _ in range(self.m)]: |
| 15 | + self.graph[src].append((dest, price)) |
| 16 | + |
| 17 | + self.start, self.end = map(int, read().split()) |
| 18 | + |
| 19 | + def solve(self) -> None: |
| 20 | + print(self.dijkstra(self.start, self.end)) |
| 21 | + |
| 22 | + def dijkstra(self, start: int, end: int) -> int: |
| 23 | + heap, prices = [(0, start)], [0 if idx == start else math.inf for idx in range(self.n + 1)] |
| 24 | + |
| 25 | + while heap: |
| 26 | + current_price, current_city = heapq.heappop(heap) |
| 27 | + if current_city == end: |
| 28 | + break |
| 29 | + |
| 30 | + if current_price > prices[current_city]: |
| 31 | + continue |
| 32 | + |
| 33 | + for next_city, price in self.graph[current_city]: |
| 34 | + if current_price + price < prices[next_city]: |
| 35 | + prices[next_city] = current_price + price |
| 36 | + heapq.heappush(heap, (current_price + price, next_city)) |
| 37 | + |
| 38 | + return int(prices[end]) |
| 39 | + |
| 40 | + |
| 41 | +if __name__ == "__main__": |
| 42 | + Problem().solve() |
0 commit comments