제출 #1104343

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1104343		thaibeo123	Knapsack (NOI18_knapsack)	C++14	100 / 100	44 ms	1784 KiB

knapsack

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

#define fi first
#define se second
#define ll long long
#define pb push_back

const int N = 2005;

int s, n;
ll dp[N];
vector<pair<int, int>> item[N];

void input() {
    cin >> s >> n;
    for (int i = 1; i <= n; ++i) {
        int v, w, k;
        cin >> v >> w >> k;
        item[w].pb({v, k});
    }
}

void solve() {
    for (int i = 1; i <= s; ++i) {
        dp[i] = -1e18;
    }
    for (int i = 1; i <= 2000; ++i) {
        sort(item[i].begin(), item[i].end(), greater<pair<int, int>>());
        int val = 0;
        for (auto it : item[i]) {
            int sl = 0;
            while (sl < it.se && val <= s) {
                val += i;
                ++sl;
                for (int j = s; j >= i; --j) {
                    dp[j] = max(dp[j], dp[j - i] + it.fi);
                }
            }
            if (val > s) break;
        }
    }
    ll ans = 0;
    for (int i = 1; i <= s; ++i) {
        ans = max(ans, dp[i]);
    }
    cout << ans;
}

int main() {
    cin.tie(0)->sync_with_stdio(0);

    input();
    solve();

    return 0;
}

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