Submission #58222530

---

Source Code Expand

import sys

sys.setrecursionlimit(10**6)

n, m = map(int, input().split())
a = [0] * n
adj = [[] for i in range(n)]
edges = []
for i in range(m):
    x, y, w = map(int, input().split())
    edges.append((x, y, w))
    adj[x - 1].append((y - 1, w))
    adj[y-1].append((x-1, -w))

vis = [0] * n

from collections import deque
def bfs(start):
  q=deque([start])
  vis[start]=1
  while q:
      x = q.popleft()
      for y, w in adj[x]:
          if not vis[y]:
              a[y] = a[x] + w
              q.append(y)
              vis[y] = 1

for i in range(n):
    if not vis[i]:
        bfs(i)

print(*a)

Submission Info

Judge Result