Submission #1190416

#	Time	Username	Problem	Language	Result	Execution time	Memory
1190416		laplace_daemonium	Knapsack (NOI18_knapsack)	C++20	100 / 100	58 ms	2888 KiB

knapsack

#include <iostream>
#include <fstream>
#include <vector>
#include <cmath>
#include <unordered_map>
#include <map>
#include <unordered_set>
#include <set>
#include <queue>
#include <assert.h>
#include <deque>
#include <stack>
#include <bitset>
#include <cassert>
#include <cstddef>
#include <algorithm>
#include <numeric>
#include <list>
#define ll long long int
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ppii pair<pair<int, int>, int>
#define MOD 998'244'353
#define MOD1 1'000'000'007
#define YES { cout << "YES\n"; return; }
#define NO { cout << "NO\n"; return; }
#define what_is(x) cerr << #x << " is " << x << endl;
#define bit(x) cout << bitset<64>(x) << "\n"
#define inf 1e9
#define INF 1e18
#define CUBE(x) (x*x*x)


using namespace std;

void solve() {
    int S, n; cin >> S >> n;
    vector<vector<pll>> a(S+1);
    for (int i = 1; i <= n; i++) {
        ll d1, d2, d3; cin >> d1 >> d2 >> d3;
        a[d2].push_back({d1, d3});
    }
    
    vector<ll> dp(S+1);
    for (int i = 1; i <= S; i++) {
        sort(a[i].rbegin(), a[i].rend());
        
        vector<pll> b;
        int sum = 0;
        int price = 0;
        for (auto [v, k] : a[i]) {
            while (sum < S && k > 0) {
                sum += i;
                price += v;
                b.push_back({sum, price});
                k--;
            }
        }
        
        for (int s = S; s >= 0; s--) {
            for (auto& [w, v] : b) {
                if (s < w)  continue;
                dp[s] = max(dp[s], dp[s-w]+v);
            }
        }
        
    }
    cout << dp[S] << "\n";
}

int32_t main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int tt = 1; //cin >> tt;
    while (tt--) solve();
    
    return 0;
}

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