Submission #1285193

#	Time	Username	Problem	Language	Result	Execution time	Memory
1285193		xosqedemrufo	Knapsack (NOI18_knapsack)	C++20	73 / 100	1094 ms	588 KiB

knapsack

//Author RufatM
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<vector<pii>> vvp;
typedef vector<bool> vb;
typedef vector<string> vs;
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define endl '\n'
#define pb push_back
#define pf push_front
#define eb emplace_back
#define ff first
#define ss second
#define all(x) begin(x),end(x)
#define rall(x) rbegin(x),rend(x)
#define mt19937_64 mt_rand(chrono::steady_clock::now().time_since_epoch().count())
//#define ordered_set tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
template<typename T> bool isPrime(T n){if(n<=1)return false;if(n<=3)return true;if(n%2==0 or n%3==0)return false;for(T i=5;i*i<=n;i+=6)if(n%i==0 or n%(i+2)==0)return false;return true;}
const int MOD=1e9+7;
const int INF=1000000007;
const ll LINF=1e18+7;
const int LOG=21;
const int MAXN=105;
const int MAXM=200005;
signed main(){
    fastio;
    #ifndef ONLINE_JUDGE
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    #endif
    int t=1;
    //cin >> t;
    while(t--){
        ll s,n;
        cin >> s >> n;
        vll dp(s+1,0);
        while(n--){
            ll v,w,k;
            cin >> v >> w >> k;
            ll mx = min(k,s/w);
            for(ll b=1;mx>0;b<<=1){
                ll cnt = min(b,mx);
                mx-=cnt;
                ll weight = w*cnt;
                ll val = v*cnt;
                for(ll j=s;j>=weight;j--){
                    dp[j] = max(dp[j],dp[j-weight]+val);
                }
            }
        }
        ll ans = 0;
        for(int i=0;i<=s;i++){
            ans = max(ans,dp[i]);
        }
        cout << ans << endl;
    }
}

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