Submission #1308220

#	Time	Username	Problem	Language	Result	Execution time	Memory
1308220		iamsazidh	Knapsack (NOI18_knapsack)	C++20	100 / 100	37 ms	2140 KiB

knapsack

//ᴇᴀᴄʜ ᴘᴇʀꜱᴏɴ ᴡɪʟʟ ᴏɴʟʏ ʜᴀᴠᴇ ᴡʜᴀᴛ ᴛʜᴇʏ ᴇɴᴅᴇᴀᴠᴏᴜʀᴇᴅ ᴛᴏᴡᴀʀᴅꜱ [53:39]
//Author: Sazid Hasan
#include <bits/stdc++.h>
using namespace std;

typedef long long              ll;
typedef double                 dl;
typedef vector<int>            vi;
typedef vector<vector<int>>    vii;
typedef vector<ll>             vl;
typedef vector<bool>           vb;
typedef pair<int,int>         pii;
typedef pair<ll, ll>          pll;

#define ff                first
#define ss                second
#define all(a)            a.begin(),a.end()
#define gcd(a,b)          __gcd(a,b)
#define lcm(a,b)          (a*(b/gcd(a,b)))
#define file();           freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
#define spc               " "

#ifdef ONLINE_JUDGE
    #define debarr(array)
    #define deb(x)
    #define del
    #define debug(...)
#else
    #define debarr(array)  for(int w = 0; w < array.size(); w++) cerr << #array << "-" << w << " = " << array[w] << endl;
    #define deb(x)         cerr << #x << " = " << x << endl;
    #define del cerr << '\n';
    #define debug(...) _debug(#__VA_ARGS__, __VA_ARGS__);
    
    template <class X, class Y>
    ostream& operator<<(ostream& os, const pair<X, Y>& p) {
        return os << "(" << p.first << ", " << p.second << ")";
    }
    
    template <class Ch, class Tr, class Container>
    basic_ostream<Ch, Tr>& operator<<(basic_ostream<Ch, Tr>& os, const Container& x) {
        int i = 0, n = distance(x.begin(), x.end());
        os << "{ ";
        for (const auto& y : x)
            os << y << (++i < n ? ", " : "");
        return os << " }";
    }
    
    template <typename... Args>
    void _debug(const char* names, Args&&... args) {
        string_view s(names);
        cerr << "{ ";
        size_t i = 0, cnt = 0, n = sizeof...(args);
    
        auto next = [&]() {
            while (i < s.size() && (s[i] == ' ' || s[i] == ',')) ++i;
            size_t st = i;
            while (i < s.size() && s[i] != ',') ++i;
            return s.substr(st, i - st);
        };
    
        ((cerr << next() << ": " << args << (++cnt < n ? ", " : "")), ...);
        cerr << " }" << '\n';
    }
#endif


const double PI =         acos(-1);
const int MOD =           1000000007;
const int inf =           (2147483647);
const double EPS =        1e-6;
const int MAXN =          1e5+10;



bool solve(){
    int s, n; cin >> s >> n;
    vector<pll> arr; // value, weight
    vector<vector<pii>> brr(s+10);
    while(n--){
        int v, w, k; cin >> v >> w  >> k;
        brr[w].push_back({v, k});
    }
    for(ll i = 0; i < s+5; i++){
        sort(all(brr[i]), greater<pii>());
        int cnt = 0;
        for(auto x: brr[i]){
            if(cnt*i>s) break;
            int v = x.ff, w = i, k = x.ss;
            cnt += k;
            if(k>s+20) k = s+20;
            ll p = 1;
            while(k-p>0){
                k -= p;
                arr.push_back({v*p, w*p});
                p <<= 1;
            }
            if(k>0){
                arr.push_back({v*k, w*k});
            }
        }
    }

    vl bag(s+10, -(1LL<<62));
    bag[0] = 0;
    for(auto x: arr){
        vl newBag = bag;
        for(int i = x.ss; i <= s; i++){
            if (bag[i - x.ss] != -(1LL<<62)) {
                newBag[i] = max(newBag[i], bag[i - x.ss] + x.ff);
            }
        }
        bag = newBag;
    }
    cout << *max_element(all(bag)) << endl;
    // cout << bag[s] << endl;
    

    return 1;
}

int main(){
    ios::sync_with_stdio(false); cin.tie(nullptr);
    int testcase = 1;
    // cin >> testcase;
    for(int tc = 1; tc <= testcase; tc++){
        //cerr << "TESTCASE - " << tc << endl;
        solve();
        //cout << (solve() ? "YES" : "NO") << '\n';
        cerr << endl;
    }

    return 0;
}

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