2024-03-29

Author: tgyuuAn

tgyuuAn/DP/KCM Travel.py

@@ -0,0 +1,30 @@
+from collections import defaultdict, deque
+import sys
+
+def input(): return sys.stdin.readline().rstrip()
+
+T = int(input())
+for _ in range(T):
+    N, M, K = map(int, input().split())
+
+    costs = [[int(1e9) for _ in range(M+1)] for _ in range(N+1)]
+    costs[1][0] = 0
+
+    graph = [[] for _ in range(N+1)]
+    for _ in range(K):
+        start, destination, cost, duration = map(int,input().split())
+        graph[start].append((destination, cost, duration))
+
+    # print(edges)
+
+    for cost in range(M+1):
+        for city in range(1, N):
+            if costs[city][cost] == int(1e9): continue
+
+            for now_destination, now_cost, now_duration in graph[city]:
+
+                if now_cost + cost <= M and costs[now_destination][cost + now_cost] > costs[city][cost] + now_duration: 
+                    costs[now_destination][cost + now_cost] = costs[city][cost] + now_duration
+
+    result = min(costs[N])
+    print(result) if result != int(1e9) else print("Poor KCM")

tgyuuAn/README.md

@@ -47,4 +47,5 @@
 | 43차시 | 2024.03.10 |  이분 탐색  | <a href="https://school.programmers.co.kr/learn/courses/30/lessons/64062">징검다리 건너기</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/157
 | 44차시 | 2023.03.13 |  트라이  | <a href="https://www.acmicpc.net/problem/14725">개미굴</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/159
 | 45차시 | 2023.03.16 |  트라이  | <a href="https://www.acmicpc.net/problem/31413">트라이</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/162
+| 49차시 | 2023.03.29 |  DP  | <a href="https://www.acmicpc.net/problem/10217">KCM Travel</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/174
 ---