-
Notifications
You must be signed in to change notification settings - Fork 0
/
1916.py
60 lines (47 loc) ยท 1.38 KB
/
1916.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
import sys
import math
import heapq
input = sys.stdin.readline
INF = math.inf
n = int(input().strip())
m = int(input().strip())
graph = [[] for _ in range(n + 1)]
for _ in range(m):
this_node, next_node, weight = map(int, input().strip().split())
graph[this_node].append((weight, next_node))
start, end = map(int, input().strip().split())
dist = [INF] * (n + 1)
heap = []
def dijkstra(start):
dist[start] = 0
heapq.heappush(heap, (0, start))
while heap:
weight, now = heapq.heappop(heap)
if dist[now] < weight:
continue
else:
for w, next_node in graph[now]:
next_weight = weight + w
if next_weight < dist[next_node]:
dist[next_node] = next_weight
heapq.heappush(heap, (next_weight, next_node))
dijkstra(start)
print(dist[end])
# n = int(input().strip())
# m = int(input().strip())
# arr = [[0] * (n + 1) for _ in range(n + 1)]
# for _ in range(m):
# a, b, c = map(int, input().strip().split())
# arr[a][b] = c
# start, end = map(int, input().strip().split())
# def dijkstra(arr, start, end, n):
# distance = [math.inf] * (n + 1)
# distance[start] = 0
# for _ in range(n - 1):
# for i in range(1, n + 1):
# for j in range(1, n + 1):
# if j != start:
# if arr[i][j] != 0:
# distance[j] = min(distance[j], distance[i] + arr[i][j])
# print(distance)
# dijkstra(arr, start, end, n)