Submission #1082889

#	Time	Username	Problem	Language	Result	Execution time	Memory
1082889		timmyli3481	Knapsack (NOI18_knapsack)	C++14	37 / 100	1045 ms	444 KiB

knapsack

#include <bits/stdc++.h>
// #include "stdc++.h"
using namespace std;
struct grass{
    int v,w,c;
};
long long dp[10000001];
grass a[10001];
int main(){
    int T,m;
    cin>>T>>m;
    for(int i=1;i<=m;i++){
        int temp1,temp2,temp3;
        cin>>temp1>>temp2>>temp3;
        a[i]={temp1,temp2,temp3};
    }
    for(int i=1;i<=m;i++){
        for(int j=T;j>=a[i].w;j--){
            for(int z=0;z<=a[i].c;z++){
                if (a[i].w*z<=j){
                    dp[j]=max(dp[j],dp[j-a[i].w*z]+a[i].v*z);
                }
            }    
        }
    }
    cout<<dp[T];
}

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