Submission #1111995

#	Time	Username	Problem	Language	Result	Execution time	Memory
1111995		vjudge1	Knapsack (NOI18_knapsack)	C++17	12 / 100	8 ms	19536 KiB

knapsack

#include <bits/stdc++.h>
using namespace std;
#define int long long
const int S=2005;
const int N=1e5+5;

int s,n,value[N],weight[N],stock[N],dp[S][N];

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> s >> n;
    for(int i=1;i<=n;i++) cin >> value[i] >> weight[i] >> stock[i];
    for(int i=1;i<=s;i++){
        for(int j=1;j<=n;j++){
            dp[i][j]=dp[i-1][j];
            for(int k=1;k<=stock[j] && k*weight[j]<=i;k++){
                if(k*weight[j]<=i) dp[i][j]=max(dp[i][j],dp[i-k*weight[j]][j-1]+value[j]*k);
            }
        }
    }
    cout << dp[s][n];
}

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