Submission #765569

#	Time	Username	Problem	Language	Result	Execution time	Memory
765569		orcslop	Knapsack (NOI18_knapsack)	C++17	73 / 100	1083 ms	340 KiB

knapsack

#include <bits/stdc++.h>
using namespace std;
#define sz(x) (int)(x).size() 

const long long MAXN = 1e5; 
const int MAXS = 2000; 

long long s, n; 
long long dp[MAXS + 1]; 

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
    cin >> s >> n; 
    for(int i = 0; i < n; i++){
        long long val, weight, cnt; 
        cin >> val >> weight >> cnt; 
        for(int j = s; j >= 0; j--){
            for(int k = 1; k <= min(cnt, (s - j) / weight); k++){
                // if(j + k * weight > s) break; 
                dp[j + k * weight] = max(dp[j + k * weight], dp[j] + k * val); 
            }
        }
    }
    cout << *max_element(dp, dp + s + 1); 
    return 0; 
}

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