Submission #640318

#	Time	Username	Problem	Language	Result	Execution time	Memory
640318		htphong0909	Knapsack (NOI18_knapsack)	C++17	0 / 100	2 ms	340 KiB

knapsack

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

int DP[10001][10001] = {0};

map<int, vector<pair<int, int>>> byWeight;

int main() {
    int n, m;
    //freopen("caykhe.inp", "r", stdin);
    //freopen("caykhe.out", "w", stdout);
    cin >> n >> m;
    vector <pair<int, int>> arr;
    for (int i = 0; i < n; i++)
    {
        int v, w, num;
        cin >> w >> v >> num;
        byWeight[w].push_back({v, num});
    }
    int t = 1;
    for (auto [w, num] : byWeight)
    {
        sort(num.begin(), num.end(), greater<pair<int, int>>());
        for (int j = m; j >= 0; j--)
        {
            DP[t][j] = DP[t - 1][j];
            int typeAt = 0;
            int copies = 1;
            int sum = 0;
            int cur_used = 1;
            while (copies * w <= j && typeAt < int(num.size()))
            {
                sum += num[typeAt].first;
                DP[t][j] = max(DP[t - 1][j - copies * w] + sum, DP[t][j]);
                copies++;
                cur_used++;
                if (cur_used > num[typeAt].second)
                {
                    cur_used = 1;
                    typeAt++;
                }
            }
        }
        t++;
    }
    int ans = 0;
    for (int i = 1; i < t; i++)
    {
        for (int j = 0; j <= m; j++)
        {
            if (DP[i][j] > ans) ans = DP[i][j];
        }
    }
    cout << ans;
    return 0;
}

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