제출 #700192

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
700192		mariacichosz	Knapsack (NOI18_knapsack)	C++17	37 / 100	1086 ms	340 KiB

knapsack

#include <bits/stdc++.h>
using namespace std;

#define ll long long

const int N = 1e5 + 5;
const int S = 2005;

ll dp[S];
ll value[N];
int weight[N];
int amount[N];

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n, s;
    cin >> s >> n;
    for (int i = 0; i < n; i ++) cin >> value[i] >> weight[i] >> amount[i];
    for (int i = 0; i < n; i ++){
        ll v = value[i]; int w = weight[i], a = amount[i];
        for (int j = s; j >= 0; j --){
            for (int k = 1; k <= a; k ++){
                if(j + k * w <= s) dp[j + k * w] = max(dp[j + k * w], dp[j] + k * v);
            }
        }
    }
    ll ans = 0;
    for (int i = 0; i <= s; i ++) ans = max(ans, dp[i]);
    cout << ans << "\n";
}

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