# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
931542 | tfgs | Commuter Pass (JOI18_commuter_pass) | Pypy 3 | 2074 ms | 175412 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
from heapq import *
def solve():
n, m = map(int, input().split())
s, t = map(int, input().split())
u, v = map(int, input().split())
s -= 1
t -= 1
u -= 1
v -= 1
g = [[] for i in range(n)]
rev = [[] for i in range(n)]
dag = [[] for i in range(n)]
for _ in range(m):
a, b, c = map(int, (input().split()))
a -= 1
b -= 1
g[a].append((c, b))
g[b].append((c, a))
def dijkstra(src):
dist = [float('inf')]*n
dist[src]=0
q=[]
heappush(q, (0, src))
while q:
d,u = heappop(q)
for w,v in g[u]:
if d+w<dist[v]:
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |