Merge pull request #58 from AlgoLeadMe/12-fnzksxl

12-fnzksxl

fnzksxl/README.md

@@ -13,4 +13,5 @@
 | 9차시 | 2024-02-23 | 그래프 | [순위](https://school.programmers.co.kr/learn/courses/30/lessons/49191) | [#37](https://github.com/AlgoLeadMe/AlgoLeadMe-6/pull/37) |
 | 10차시 | 2024-03-07 | 구현 | [나무 재테크](https://www.acmicpc.net/problem/16235) | [#52](https://github.com/AlgoLeadMe/AlgoLeadMe-6/pull/52) |
 | 11차시 | 2024-03-10 | 투포인터 | [보석 쇼핑](https://school.programmers.co.kr/learn/courses/30/lessons/67258) | [#56](https://github.com/AlgoLeadMe/AlgoLeadMe-6/pull/56) |
+| 12차시 | 2024-03-13 | 벨만포드 | [타임머신](https://www.acmicpc.net/problem/11657) | [#](https://github.com/AlgoLeadMe/AlgoLeadMe-6/pull/58) |
 ---

fnzksxl/벨만포드/타임머신.py

@@ -0,0 +1,38 @@
+import sys
+
+input = sys.stdin.readline
+
+
+def func():
+    distances[1] = 0
+
+    for i in range(N):
+        for j in range(M):
+            cur_node, next_node, weight = edges[j]
+            if distances[cur_node] != float('inf') and distances[next_node] > distances[cur_node] + weight:
+                distances[next_node] = distances[cur_node] + weight
+                if i == N-1:
+                    return False
+
+    return True
+
+
+N, M = map(int, input().split())
+
+edges = []
+distances = [float('inf')] * (N+1)
+q = []
+
+for _ in range(M):
+    start, end, weight = map(int, input().split())
+    edges.append((start, end, weight))
+
+
+if func():
+    for weight in distances[2:]:
+        if weight == float('inf'):
+            print(-1)
+        else:
+            print(weight)
+else:
+    print(-1)