명환 백준 숙제(20210428)

mhkim/baekjoon/11265.py

@@ -0,0 +1,30 @@
+"""
+@file 11265.py
+@brief 끝나지 않는 파티
+@desc 플로이드 워셜
+"""
+import sys
+input = sys.stdin.readline
+
+n, m = map(int, input().split())
+parties = []
+for i in range(n):
+    parties.append(list(map(int, input().split())))
+
+
+def floyd_warshall():
+    for k in range(n):
+        for i in range(n):
+            for j in range(n):
+                parties[i][j] = min(
+                    parties[i][j], parties[i][k] + parties[k][j])
+
+
+floyd_warshall()
+
+for i in range(m):
+    a, b, c = map(int, input().split())
+    if parties[a-1][b-1] <= c:
+        print("Enjoy other party")
+    else:
+        print("Stay here")

mhkim/baekjoon/1446.py

@@ -0,0 +1,29 @@
+"""
+@file 1446.py
+@brief 지름길
+@desc 다잌스트라
+
+DP로도 풀 수 있을 것 같음
+"""
+import sys
+import heapq
+input = sys.stdin.readline
+INF = int(1e9)
+
+n, d = map(int, input().split())
+graph = [[] for _ in range(d+1)]
+distance = [i for i in range(d+1)]
+
+for _ in range(n):
+    start, dest, shortcut = map(int, input().split())
+    if dest <= d:
+        graph[start].append((dest, shortcut))
+
+for i in range(d+1):
+    if i > 0:
+        distance[i] = min(distance[i], distance[i-1]+1)
+    for j in graph[i]:
+        if distance[i]+j[1] < distance[j[0]]:
+            distance[j[0]] = distance[i]+j[1]
+
+print(distance[d])