Submission #876422

#	Time	Username	Problem	Language	Result	Execution time	Memory
876422		arkash707	Knapsack (NOI18_knapsack)	C++17	37 / 100	2 ms	464 KiB

knapsack

#include<iostream>
#include<vector>
using namespace std;

int s, n;

//good: {price, weight, quantity}
int a[100001][3];

long long solve() {

    long long dp[s+1];
    for (int i=0; i<=s; i++) dp[i] = -1;
    dp[0] = 0;
    long long res = 0;
    for (int i=0; i<n; i++) {
        int p = a[i][0], w = a[i][1], q = a[i][2];
        for (int j=s; j>=0; j--) {
            if (dp[j] == -1) continue;
            for (int k=0; k<=q; k++) {
                if (1L*j+w*k > s) continue;
                dp[j+w*k] = max(dp[j+w*k], dp[j] + p*k);
                res = max(res, dp[j+w*k]);
            }
        }
    }

    return res;



}



int main() {
	
    cin >> s >> n;
    for (int i=0; i<n; i++) {
        for (int j=0; j<3; j++) {
            cin >> a[i][j];
        }
    }
    cout << solve() << "\n";
}

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