Submission #1112069

#	Time	Username	Problem	Language	Result	Execution time	Memory
1112069		vjudge1	Knapsack (NOI18_knapsack)	C++17	12 / 100	1 ms	508 KiB

knapsack

#include<bits/stdc++.h>
using namespace std;

typedef long long int lli;

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    lli s, n;
    cin >> s >> n;

    lli item[n+5][3];// V, W, K
    for(lli i = 0; i < n; i++){
        cin >> item[i][0] >> item[i][1] >> item[i][2];
    }   
    
    lli dp[s+5];
    for(lli i = 0; i <= s; i++) dp[i] = 0;

    lli used[s+5];
    for(lli i = 0; i < n; i++){
        for(lli j = 0; j < item[i][1]; j++){
            used[j] = 0;
        }
        for(lli j = item[i][1]; j <= s; j++){
            //cout << j << " : " << used[j - item[i][1]] + 1 << " <= " << item[i][2] << " && " << dp[j] << " < " << dp[j-item[i][1]] << " + " << item[i][0] << "\n";
            if(used[j - item[i][1]] + 1 <= item[i][2] && max(dp[j], dp[j-1]) < dp[j-item[i][1]] + item[i][0]){
                used[j] = used[j - item[i][1]] + 1;
                dp[j] = dp[j-item[i][1]] + item[i][0];
            }
            else{
                if(dp[j] >= dp[j-1]){
                    used[j] = 0;
                }
                else{
                    dp[j] = dp[j-1];
                    used[j] = used[j-1];
                }
            }
        }
        
        /*for(lli j = 0; j <= s; j++){
            cout << dp[j] << " ";
        }
        cout << "\n";*/
    }

    cout << dp[s];

}

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