제출 #1222886

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1222886		ffeyyaae_	Knapsack (NOI18_knapsack)	C++20	100 / 100	65 ms	33544 KiB

knapsack

#include <bits/stdc++.h>

using namespace std;

using ll = long long;

const int N = 2005;
const ll INF = 1e9;

int S, n;
map<int, vector<pair<int,int>>> mp;
ll dp[N][N];

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> S >> n;
    for( int i=0;i<n;i++ )
    {
        int v, w, k;
        cin >> v >> w >> k;
        mp[w].push_back( {v, k} );
    }
    for( int i=0;i<N;i++ )
    {
        for( int j=0;j<N;j++ ) dp[i][j] = -INF;
    }
    dp[0][0] = 0;
    int a = 1;
    for( auto [w, item] : mp )
    {
        sort( item.rbegin(), item.rend() );
        for( int i=0;i<=S;i++ )
        {
            dp[a][i] = dp[a-1][i];
            int cnt = 1, cur = 0, used = 0;
            ll earn = 0;
            while( cnt*w <= i && cur < item.size() )
            {
                auto [val, amnt] = item[cur];
                earn += val;
                if( dp[a-1][ i-cnt*w ] != -INF )
                {
                    dp[a][i] = max(dp[a][i], dp[a-1][i-cnt*w]+earn);
                }
                used++;
                if( used == amnt )
                {
                    used = 0;
                    cur++;
                }
                cnt++;
            }
        }
        a++;
    }
    ll ans = 0;
    for( int i=0;i<=S;i++ ) ans = max( ans, dp[a-1][i] );
    cout << ans << "\n";
}

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