Submission #828737

#	Time	Username	Problem	Language	Result	Execution time	Memory
828737		bachhoangxuan	Knapsack (NOI18_knapsack)	C++17	100 / 100	47 ms	4972 KiB

knapsack

// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=998244353;
const int maxn=200005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=1000005;
const int maxl=20;
const int maxa=1000000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=101;

vector<pii> num[2005];
int dp[2005],nw[2005];

void solve(){
    int s,n;cin >> s >> n;
    for(int i=1;i<=n;i++){
        int w,v,k;cin >> v >> w >> k;
        num[w].push_back({v,k});
    }
    auto update = [&](int x,int val){
        for(int i=x;i<=s;i++) nw[i]=max(nw[i],dp[i-x]+val);
    };
    for(int i=1;i<=s;i++){
        if(num[i].empty()) continue;
        sort(num[i].begin(),num[i].end(),greater<pii>());
        int cost=0,p=0,sz=(int)num[i].size();
        for(int j=1;j<=s/i;j++){
            if(!num[i][p].se) p++;
            if(p==sz) break;
            cost+=num[i][p].fi;num[i][p].se--;
            update(i*j,cost);
        }
        for(int j=0;j<=s;j++) dp[j]=max(dp[j],nw[j]);
    }
    int Max=0;
    for(int i=1;i<=s;i++) Max=max(Max,dp[i]);
    cout << Max << '\n';
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

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