제출 #471839

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
471839		CodeChamp_SS	Knapsack (NOI18_knapsack)	C++17	100 / 100	114 ms	36352 KiB

knapsack

#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;

#define ff                  first
#define ss                  second
#define pb                  push_back
#define eb                  emplace_back
#define mp                  make_pair
#define lb                  lower_bound
#define ub                  upper_bound
#define setbits(x)          __builtin_popcountll(x)
#define zrobits(x)          __builtin_ctzll(x)
#define sz(v)               (int)v.size()
#define ps(y)               cout << fixed << setprecision(y)
#define ms(arr, v)          memset(arr, v, sizeof(arr))
#define all(v)              v.begin(), v.end()
#define rall(v)             v.rbegin(), v.rend()
#define trav(x, v)          for(auto &x: v)
#define w(t)                int t; cin >> t; while(t--)
#define rep(i, a, b)        for(int i = a; i <= b; i++)
#define rrep(i, a, b)       for(int i = a; i >= b; i--)
#define rep0(i, n)          rep(i, 0, n - 1)
#define rrep0(i, n)         rrep(i, n - 1, 0)
#define rep1(i, n)          rep(i, 1, n)
#define rrep1(i, n)         rrep(i, n, 1)
#define inp(arr, n)         rep0(i, n) cin >> arr[i];

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pii;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef map<ll, ll> mii;
typedef map<char, ll> mci;
typedef priority_queue<ll> pq_mx;
typedef priority_queue<ll, vi, greater<>> pq_mn;
typedef tree<ll, null_type, less<>, rb_tree_tag, tree_order_statistics_node_update> pbds;
/*
 * find_by_order(i) -> returns an iterator to the element at ith position (0 based)
 * order_of_key(i)  -> returns the position of element i (0 based)
 */

const int N = 2e3 + 5;
const int mod = 1e9 + 7;
//const int mod = 998244353;
const ll inf = 1e18;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void fio() {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
}

int n, s;
ll dp[N][N];
vp wt[N];

int main() {
    fio();

    cin >> s >> n;
    rep0(x, n) {
        ll v, w, k;
        cin >> v >> w >> k;
        wt[w].eb(v, k);
    }

    ms(dp, -1);
    dp[0][0] = 0;
    rep1(x, s) {
        sort(rall(wt[x]));
        rep0(i, s + 1) {
            dp[x][i] = dp[x - 1][i];
            ll cur = 0, pre = 0;
            int j = 0, ki = 0;
            while ((cur + 1) * x <= i and j < sz(wt[x])) {
                ++cur, pre += wt[x][j].ff;
                if (dp[x - 1][i - cur * x] != -1) dp[x][i] = max(dp[x][i], pre + dp[x - 1][i - cur * x]);
                ++ki;
                if (ki == wt[x][j].ss) ki = 0, ++j;
            }
        }
    }
    ll res = 0;
    rep0(x, s + 1) res = *max_element(dp[x], dp[x] + s + 1);
    cout << res;

    return 0;
}

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