제출 #528404

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
528404		louiskwok	Knapsack (NOI18_knapsack)	C++17	29 / 100	4 ms	1868 KiB

knapsack

#include <bits/stdc++.h>
using namespace std;
long long v[100005],w[100005],k[100005];
long long dp[100005][2005],ans;
int main() {
    long long s,n;
    cin >> s >> n;
    for (int i=1;i<=n;i++) cin >> v[i] >> w[i] >> k[i];
    for (int i=0;i<=n;i++) {
        int mx = 0;
        for (int j=0;j<=s;j++) {
            if (dp[i][j]>mx) mx = dp[i][j];
            dp[i][j] = mx;
        }
        if (i==n) continue;
        for (int j=0;j<=s;j++) {
            dp[i+1][j] = max(dp[i+1][j],dp[i][j]);
            long long num = min(k[i+1],(s-j)/w[i+1]);
            if (j+num*w[i+1]<=s) {
                dp[i+1][j+num*w[i+1]] = max(dp[i+1][j+num*w[i+1]],dp[i][j]+v[i+1]*num);
            }
        }
    }
    for (int i=1;i<=n;i++) {
        for (int j=0;j<=s;j++) ans = max(ans,dp[i][j]);
    }
    cout << ans << endl;
    return 0;
}

• Subtask 1: 12 / 12
• Subtask 2: 17 / 17
• Subtask 3: 0 / 20
• Subtask 4: 0 / 24
• Subtask 5: 0 / 27