제출 #982446

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
982446		a_l_i_r_e_z_a	Knapsack (NOI18_knapsack)	C++17	73 / 100	116 ms	262144 KiB

knapsack

// In the name of God
// Hope is last to die

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

#pragma GCC optimize("O3,unroll-loops")
// #pragma GCC optimize("avx2")

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define pb push_back
#define int long long
#define S second
#define F first
#define mp make_pair
#define smax(xyxy, yxy) (xyxy) = max((xyxy), (yxy))
#define smin(xyxy, yxy) (xyxy) = min((xyxy), (yxy))
#define all(xyxy) (xyxy).begin(), (xyxy).end()
#define len(xyxy) ((int)(xyxy).size())

const int maxn = 1e5 + 5, maxs = 2e3 + 5;
const int inf = 1e9 + 7;
int s, n, dp[maxs];
vector<int> vec[maxs];

int32_t main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    
    cin >> s >> n;
    for(int i = 0; i < n; i++){
        int v, w, k; cin >> v >> w >> k;
        smin(k, s);
        for(int i = 1; i <= k && i * w <= s; i++) vec[w].pb(v);
    }
    for(int i = 1; i <= s; i++){
        sort(all(vec[i]));
        reverse(all(vec[i]));
        while((int)vec[i].size() * i > s) vec[i].pop_back();
        for(auto v: vec[i]){
            for(int j = s; j >= 1; j--){
                if(j - i >= 0) smax(dp[j], v + dp[j - i]);
            }
        }
    }
    cout << dp[s] << '\n';

    return 0;
}

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