Submission #1091265

#	Time	Username	Problem	Language	Result	Execution time	Memory
1091265		diponkinu	Knapsack (NOI18_knapsack)	C++14	37 / 100	1066 ms	444 KiB

knapsack

#include<bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 1e9+7;
const int MAXN1 = 2e5 + 5;
const int MAXN2 = 1e6 + 5;
const int MAXN3 = 1e3 + 5;
void add_self(int &x, int y){
    x = x+ y;
    // return x;
}

int dp[2005], check[2005];
signed main () {
    int s,n ;
    cin >> s >> n;
    dp[0] = 0;
    for(int i = 0; i < n; i++){
        int a,b,c;
        cin >> a >> b >> c;
        while(c--){
            for(int j = 2000; j >= 0; j--){
                if(j + b > 2000 )continue;

                dp[j+b] = max(dp[j+b], dp[j] + a);
            }


        }
    }
    int ans = 0;
    for(int i = 0; i <= s; i++){
        // cout << dp[i] <<  "\n";
        ans = max(ans, dp[i]);

    }
    cout <<ans;

}

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