commit

picky/picky.py

@@ -0,0 +1,80 @@
+import math
+import sys
+
+sys.setrecursionlimit(100000)
+
+
+def inputs():
+    return map(int, input().strip().split(" "))
+
+
+n, wet_c, dry_c = inputs()
+
+costs = [[(math.inf, -1)] * (dry_c + 1) for _ in range(wet_c + 1)]
+costs[0][0] = (0, -1)
+
+bundles = []
+for i in range(n):
+    wet, dry, cost = inputs()
+    bundles.append((wet, dry, cost))
+    if wet <= wet_c and dry <= dry_c:
+        costs[wet][dry] = (cost, i)
+
+
+def get_cost(w, d) -> float:
+    if w == 0 and d == 0:
+        return 0
+
+    if w < 0 or d < 0:
+        return math.inf
+
+    if costs[w][d][1] != -1:
+        print("reusing: ", w, d)
+        return costs[w][d][0]
+
+    print(w, d)
+
+    for i in range(len(bundles)):
+        wet, dry, cost = bundles[i]
+        new_cost = get_cost(w - wet, d - dry) + cost
+        if costs[w][d][0] > new_cost:
+            costs[w][d] = (new_cost, i)
+    return costs[w][d][0]
+
+
+def bottom_up() -> float:
+    for w in range(wet_c + 1):
+        for d in range(dry_c + 1):
+            for i in range(len(bundles)):
+                wet, dry, cost = bundles[i]
+                if wet > w or dry > d:
+                    continue
+                new_cost = costs[w - wet][d - dry][0] + cost
+                if costs[w][d][0] > new_cost:
+                    costs[w][d] = (new_cost, i)
+
+    return costs[wet_c][dry_c][0]
+
+
+def backtrack(w, d) -> list[int]:
+    counter = [0] * n
+    b = costs[w][d][1]
+    while b != -1:
+        counter[b] += 1
+        wet, dry, _ = bundles[b]
+        w -= wet
+        d -= dry
+        b = costs[w][d][1]
+    return counter
+
+
+# c = get_cost(wet_c, dry_c)
+c = bottom_up()
+# print(costs)
+if math.isinf(c):
+    print(-1)
+else:
+    print(c)
+
+    for c in backtrack(wet_c, dry_c):
+        print(c)