Submission #676843

#	Time	Username	Problem	Language	Result	Execution time	Memory
676843		Toxtaq	Knapsack (NOI18_knapsack)	C++17	37 / 100	1100 ms	25128 KiB

knapsack

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int S, N, sz = 0;
    cin >> S >> N;
    vector<int>values, weights;
    for(int i = 0;i < N;++i){
        int V, W, K;
        cin >> V >> W >> K;
        for(int j = 0;j < K;++j){
            values.push_back(V);
            weights.push_back(W);
        }
        sz += K;
    }
    vector<long long>dp(S + 1, -1e9);
    long long mx = 0;
    dp[0] = 0;

    for(int j = 0;j < sz;++j){
        for(int i = S;i >= 0;--i){
            if(i - weights[j] >= 0)dp[i] = max(dp[i - weights[j]] + 1LL * values[j], dp[i]);
//            cout << j << ", " << i << ": " << dp[i] << '\n';
            mx = max(mx, dp[i]);
        }
    }
    cout << mx;
}

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