Submission #1048189

#	Time	Username	Problem	Language	Result	Execution time	Memory
1048189		FCGVHBN	Knapsack (NOI18_knapsack)	C++14	49 / 100	1094 ms	2396 KiB

knapsack

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

int memo(int index,int wei,int n,int s,vector<vector<int> >&info,vector<vector<int> >&dp){
    if(index==n){
        return 0;
    }
    if(dp[index][wei]!=-1){
        return dp[index][wei];
    }
    int nt=memo(index+1,wei,n,s,info,dp);
    int t=0;
        for(int i=0;i<info[index][2];i++){
            if((i+1)*info[index][1]+wei<=s){
                t=max(t,(i+1)*info[index][0]+memo(index+1,wei+(i+1)*info[index][1],n,s,info,dp));
            }
    }
    return dp[index][wei]=max(t,nt);
}

signed main() {
    int s,n;
    cin>>s>>n;
    vector<vector<int> >info(n);
    for(int i=0;i<n;i++){
        int v,w,k;
        cin>>v>>w>>k;
        info[i].push_back(v);
        info[i].push_back(w);
        info[i].push_back(k);
    }
    vector<vector<int> >dp(n,vector<int>(s+1,-1));
    cout<<memo(0,0,n,s,info,dp)<<endl;
}

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