제출 #942490

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
942490		AtabayRajabli	Knapsack (NOI18_knapsack)	C++17	100 / 100	50 ms	9820 KiB

knapsack

#include <bits/stdc++.h>

// author : a1abay

#define all(v)      v.begin(), v.end()
#define GCD(a, b)   __gcd(a, b)
#define int         ll 
#define LCM(a, b)   (a*b / (__gcd(a, b)))
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>

typedef long long           ll;
const int inf =             1e9 + 7;
const int inff =            (int)1e18 + 7;
const int sz =              1e5 + 5;
using namespace             std;

int s, n;
int v[sz], w[sz], f[sz], dp[sz];
vector<array<int, 2>> g[sz];

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

    // freopen("in.in", "r", stdin); freopen("out.out", "w", stdout);
    
    cin >> s >> n;
    for(int i = 1; i <= n; i++)
    {
        cin >> v[i] >> w[i] >> f[i];
        g[w[i]].push_back({v[i], f[i]});
    }
    for(int i = 1; i <= s; i++)
    {
        sort(all(g[i]));
        
        int mx = s / i, last = -1;
        while(!g[i].empty())
        {
            int x = g[i].back()[1], v = g[i].back()[0];
            if(mx - x >= 0)
            {
                mx -= x;
                g[i].pop_back();
            }
            else 
            {
                last = v;
                break;
            }
            for(int j = 1; j <= x; j++)
            {
                for(int k = s; k >= i; k--)
                {
                    dp[k] = max(dp[k - i] + v, dp[k]);
                }
            }
        }
        for(int j = 1; j <= mx; j++)
        {
            for(int k = s; k >= i; k--)
            {
                dp[k] = max(dp[k - i] + last, dp[k]);
            }
        }
        
    }
    int mx = -1;
    for(int i = 0; i <= s; i++)mx = max(mx, dp[i]);
    
    cout << mx;
}

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