洛谷 python P1064 [NOIP2006 提高组] 金明的预算方案

有别的事情，懒得调整了，ac了直接拍上来。

from collections import defaultdict
def main():
    n, m = map(int, input().split())
    cv = [[] for _ in range(m)]
    mp = defaultdict(list)
    for i in range(m):
        c, v, p = map(int, input().split())
        cv[i] = [c // 10, v * c]
        if p != 0:
            mp[p - 1].append(i)
        elif mp.get(i) is None:
            mp[i] = []
            
    t = n // 10
    dp = [0] * (t + 1)
    for i in mp.keys():
        c = cv[i][0]
        for j in range(t, c - 1, -1):
            base = j - c
            allCost, allValue = c, cv[i][1]
            f = dp[base] + cv[i][1]
            for p in mp[i]:
                allCost += cv[p][0]
                allValue += cv[p][1]
                if base >= cv[p][0]:
                    f = max(f, dp[base - cv[p][0]] + cv[p][1] + cv[i][1])
            if len(mp[i]) > 1 and j >= allCost:
                f = max(f, dp[j - allCost] + allValue)
            dp[j] = max(f, dp[j])
    print(dp[-1])
main()