제출 #1255140

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1255140		_filya_	Knapsack (NOI18_knapsack)	C++20	0 / 100	1 ms	1608 KiB

knapsack

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

const int S = 2001;

// Time complexitty O(nlogn + s^2logs)

int main()
{
// 	ifstream cin("input.txt");
//     ofstream cout("output.txt");
	ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
	int s, n; cin >> s >> n;
    vector<array<int, 3>> items(n);
    vector<vector<int>> items_by_w(S);
    for (int i = 0; i < n; i++) {
        int v, w, k; cin >> v >> w >> k;
        items[i] = {v, w, k};
    }
    sort(items.begin(), items.end());
    reverse(items.begin(), items.end());
    for (auto it : items) {
        while(items_by_w[it[1]].size() < s / it[1] && it[2]) {
            items_by_w[it[1]].push_back(it[0]);
            it[2]--;
        }
    }
    vector<pair<int, int>> n_items(1);
    n_items.reserve(s * 11);
    for (int w = 0; w < s; w++) {
        auto v = items_by_w[w];
        for (auto u : v) n_items.push_back({u, w});
    }
    n = n_items.size();
    ll dp[n + 1][s + 1];
    memset(dp, 0, sizeof dp);
    for (int i = 1; i <= n; i++) {
        for (int cs = 0; cs <= s; cs++) {
            dp[i][cs] = dp[i - 1][cs];
            if (cs >= n_items[i].second) dp[i][cs] = max(dp[i][cs], dp[i - 1][cs - n_items[i].second] + n_items[i].first);
        }
    }
    cout << dp[n][s] << '\n';
}

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