HJ16 购物单

---

代码（首刷看解析 2024年10月16日）

#include <iostream>
#include <vector>
using namespace std;

int main() {
    int N, M;
    cin >> N >> M;

    N /= 10;
    vector<vector<int>> prices(61, vector<int>(3, 0));
    vector<vector<int>> pricesMultiplyImport(61, vector<int>(3, 0));

    for (int i = 1; i <= M; i++) {
        int a, b, c;
        cin >> a >> b >> c;
        a /= 10; b *= a;
        if (c == 0) {
            prices[i][0] = a; pricesMultiplyImport[i][0] = b;
        } else {
            if (prices[c][1] == 0) {
                prices[c][1] = a; pricesMultiplyImport[c][1] = b;
            } else {
                prices[c][2] = a; pricesMultiplyImport[c][2] = b;
            }
        }
    }
    // 01背包：先物品再容量
    vector<vector<int>> dp(M + 1, vector<int>(N + 1, 0));
    for (int i = 1; i <= M; i++) {
        for (int j = 1; j <= N; j++) {
            int a = prices[i][0], b = pricesMultiplyImport[i][0];
            int c = prices[i][1], d = pricesMultiplyImport[i][1];
            int e = prices[i][2], f = pricesMultiplyImport[i][2];
            dp[i][j] = j >= a? max(dp[i - 1][j - a] + b, dp[i - 1][j]) : dp[i - 1][j];
            dp[i][j] = j >= (a + c)? max(dp[i - 1][j - a - c] + b + d, dp[i][j]) : dp[i][j];
            dp[i][j] = j >= (a + e)? max(dp[i - 1][j - a - e] + b + f, dp[i][j]) : dp[i][j];
            dp[i][j] = j >= (a + c + e)? max(dp[i - 1][j - a - c - e] + b + d + f, dp[i][j]) : dp[i][j];

            //cout << dp[i][j] << " ";
        }
        //cout << endl;
    }
    cout << dp[M][N] * 10 << endl;

    return 0;
}
// 64 位输出请用 printf("%lld")