제출 #680379

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
680379		sz1218	Knapsack (NOI18_knapsack)	C++14	12 / 100	1 ms	212 KiB

knapsack

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef vector<int> vi;

const int NN = 1e6+3;
int n, S, used[2003];
ll dp[2003];

int main()
{
    //setIO("");
    cin >> S >> n;
    int V, W, K;
    for(int j=0;j<n;j++){
        cin >> V >> W >> K;
        memset(used, 0, sizeof(used));
        for(int i=1;i<=S;i++){
            if(i-W >= 0 && dp[i-W] + V > dp[i] && used[i-W] <= K-1){
                used[i] = used[i-W] + 1;
                dp[i] = dp[i-W] + V;
            }
        }
    }
    ll ans = 0;
    for(int i=0;i<=S;i++){ans = max(ans, dp[i]);}
    cout << ans << endl;
    return 0;
}

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