Submission #595347

#	Time	Username	Problem	Language	Result	Execution time	Memory
595347		yaroslav06	Knapsack (NOI18_knapsack)	C++14	73 / 100	1051 ms	2124 KiB

knapsack

#include <iostream>

const int N = 2001, M = 1e5;

using namespace std;
typedef long long ll;

int s, n, v[M], w[M], k[M];

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int dp[N][2]{};
    cin >> s >> n;
    for(int i = 0; i < n; ++i)
        cin >> v[i] >> w[i] >> k[i];
    for(int i = 0; i < n; ++i){
        for(int j = 1; j <= k[i] && j * w[i] <= s; ++j)
            for(int t = s; t - j * w[i] >= 0; --t)
                dp[t][1] = max(dp[t][1], dp[t - j * w[i]][0] + j * v[i]);
        for(int j = 0; j <= s; ++j)
            dp[j][0] = dp[j][1];
    }
    cout << dp[s][0] << '\n';
}

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