Submission #975423

#	Time	Username	Problem	Language	Result	Execution time	Memory
975423		vjudge1	Knapsack (NOI18_knapsack)	C++98	37 / 100	155 ms	262144 KiB

knapsack

#include <bits/stdc++.h>
using  namespace std;
int main(){
    int s,n;
    cin>>s>>n;
    vector<int>v,w;
    int banyak=0;
    int tv,tw,tk;
    v.push_back(0);
    w.push_back(0);
    for (int i = 1; i <= n; i++)
    {
       
       cin>>tv>>tw>>tk;
        banyak+=tk;
       while (tk--)
       {
        v.push_back(tv);
        w.push_back(tw);
       }
    }
    
    int dp[banyak+1][s+1];
    for (int i = 0; i <= s; i++)
    {
        dp[0][i]=0;
    }
    for (int i = 0; i <= banyak; i++)
    {
        dp[i][0]=0;
    }
    for (int i = 1; i <= banyak; i++)
    {
        for (int j = 1; j <= s; j++)
        {
            if(w[i]>j){
                dp[i][j]=dp[i-1][j];
            }else{
                dp[i][j]=max(dp[i-1][j],dp[i-1][j-w[i]]+v[i]);
            }
        }
    }
    cout<<dp[banyak][s];
    
}

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