AI025. 双资源模型部署

import sys


def solve() -> None:
    data = sys.stdin.buffer.read().split()
    if not data:
        return
    it = iter(data)
    n = int(next(it)); W = int(next(it)); C = int(next(it))
    dp = [[0] * (C + 1) for _ in range(W + 1)]
    base = 0
    for _ in range(n):
        w = int(next(it)); c = int(next(it)); v = int(next(it))
        if v <= 0:
            continue
        if w == 0 and c == 0:
            base += v
            continue
        if w > W or c > C:
            continue
        for wi in range(W, w - 1, -1):
            row = dp[wi]
            old = dp[wi - w]
            if c == 0:
                row[:] = [y + v if y + v > x else x for x, y in zip(row, old)]
            else:
                row[c:] = [y + v if y + v > x else x for x, y in zip(row[c:], old[:C + 1 - c])]
    print(base + dp[W][C])


if __name__ == "__main__":
    solve()