2024-09-04

AlgoLeadMe · Sep 4, 2024 · bfd887e · bfd887e
1 parent 39a3ee2
commit bfd887e
Show file tree

Hide file tree

Showing 2 changed files with 42 additions and 4 deletions.
diff --git a/H0ngJu/README.md b/H0ngJu/README.md
@@ -24,9 +24,11 @@
 | 20차시 | 2024.06.03 | 백트래킹 |                [스타트와 링크](https://www.acmicpc.net/problem/14889)                 | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/206 |
 | 21차시 | 2024.06.07 |  그리디  |                 [행복 유치원](https://www.acmicpc.net/problem/13164)                  | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/208 |
 | 22차시 | 2024.08.06 |   해시   |        [의상](https://school.programmers.co.kr/learn/courses/30/lessons/42578)        | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/224 |
-| 23차시 | 2024.08.10 | 해시 | [베스트앨범](https://school.programmers.co.kr/learn/courses/30/lessons/42579) | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/227 |
-| 24차시 | 2024.08.17 | BFS | [아기상어](https://www.acmicpc.net/problem/16236) | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/233 |
-| 25차시 | 2024.08.17 | DFS | [친구비](https://www.acmicpc.net/problem/16562) | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/234 |
-| 26차시 | 2024.08.24 | 그리디 | [신입사원](https://www.acmicpc.net/problem/1946) | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/237 |
+| 23차시 | 2024.08.10 |   해시   |     [베스트앨범](https://school.programmers.co.kr/learn/courses/30/lessons/42579)     | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/227 |
+| 24차시 | 2024.08.17 |   BFS    |                   [아기상어](https://www.acmicpc.net/problem/16236)                   | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/233 |
+| 25차시 | 2024.08.17 |   DFS    |                    [친구비](https://www.acmicpc.net/problem/16562)                    | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/234 |
+| 26차시 | 2024.08.24 |  그리디  |                   [신입사원](https://www.acmicpc.net/problem/1946)                    | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/237 |
+
+| 28차시 | 2024.09.04 | 벨만포드 | [타임머신](https://www.acmicpc.net/problem/11657) | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/244 |
 
 ---
diff --git a/H0ngJu/벨만포드/타임머신.py b/H0ngJu/벨만포드/타임머신.py
@@ -0,0 +1,36 @@
+import sys
+
+INF = 1e8
+
+def input() : return sys.stdin.readline().rstrip()
+
+N, M = map(int, input().split())
+bus = [[] for _ in range(N+1)]
+distance = [INF] * (N+1)
+
+for i in range(M):
+    A, B, C = map(int, input().split())
+    bus[A].append([B, C])
+
+def BellmanFord(start):
+    distance[start] = 0
+
+    for i in range(N):
+        for j in range(1, N+1):
+            for n, w in bus[j]:
+                if distance[j] != INF and distance[n] > distance[j] + w:
+                    distance[n] = distance[j] + w
+                    if i == N-1:
+                        return True
+    return False
+
+check_negative = BellmanFord(1)
+
+if check_negative:
+    print("-1")
+else:
+    for i in range(2, N+1):
+        if distance[i] == INF:
+            print("-1")
+        else:
+            print(distance[i])