제출 #1326378

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1326378		hoangtien69	Knapsack (NOI18_knapsack)	C++20	100 / 100	51 ms	32860 KiB

knapsack

#include<bits/stdc++.h>
using namespace std;
const int MAXN = 2005;
#define pii pair<int,int>

int s, n;
int pre[MAXN][MAXN];
int dp[MAXN][MAXN];

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

    cin >> s >> n;
    vector<vector<pii>> a(s + 1);
    for (int i = 1; i <= n; i++)
    {
        int v, w, k;
        cin >> v >> w >> k;
        a[w].push_back({v, k});
    }
    for (int i = 1; i <= s; i++)
    {
        sort(a[i].rbegin(), a[i].rend());
    }
    for (int i = 1; i <= s; i++)
    {
        if (a.empty())
        {
            continue;
        }
        int cnt = 1;
        int typ = 0;
        int sz = a[i].size();
        int rem = 1;
        while(cnt <= s and typ < sz)
        {
            pre[i][cnt] = pre[i][cnt - 1] + a[i][typ].first;
            ++cnt;
            ++rem;
            if (rem > a[i][typ].second)
            {
                rem = 1;
                ++typ;
            }
        }
    }
    for (int i = 1; i <= s; i++)
    {
        for (int j = 1; j <= s; j++)
        {
            dp[i][j] = dp[i - 1][j];
        }
        for (int j = 1; j <= s; j++)
        {
            for (int k = 1; k * i <= j; k++)
            {
                dp[i][j] = max(dp[i][j], dp[i - 1][j - i * k] + pre[i][k]);
            }
        }
    }
    cout << dp[s][s];
}

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