Submission #838746

#	Time	Username	Problem	Language	Result	Execution time	Memory
838746		TonyStark_456	Knapsack (NOI18_knapsack)	C++17	100 / 100	52 ms	5320 KiB

knapsack

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#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 ll long long
#define  vll vector<ll>
#define pb push_back
#define vp vector<pll>
#define tc ll t; cin >> t; for(ll i = 0; i < t; i++){solve(i, t);}
#define tc1 solve(1, 1);
#define mpvll map<ll, vll>
#define vfast vll a(n); for (ll i = 0; i < n; i++) { cin >> a[i]; }
#define mpll map<ll,ll>
#define pll pair<ll,ll>
#define vll2 vector<vector<ll>> dp(n, vector<ll>(m));
#define FIXED(A) cout << fixed; cout.precision(20); cout << A << "\n";
#define mp(A, B) make_pair(A, B)
#define all(x) (x).begin(), (x).end()
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define sz(x) (int)(x).size()
#define big __int128
#define F first
#define S second
#define ckmin(a,b) a = min(a,b)
#define ckmax(a,b) a = max(a,b)
template <typename num_t>
using indexed_set = tree<num_t, null_type, less<num_t>, rb_tree_tag, tree_order_statistics_node_update>;
void setIO(string name) {freopen((name+".in").c_str(),"r",stdin);freopen((name+".out").c_str(),"w",stdout);}
ll rd(ll a, ll b){return (a+b-1) / b;}
ll isqrt(ll x){ll ans = 0; for(ll k = 1LL << 30; k != 0; k /= 2){if ((ans + k) * (ans + k) <= x) {ans += k;} } return ans;   }
vll prime(ll x){ll n = x; vll ans; while (n % 2 == 0) {ans.pb(2);n = n/2;} for (int i = 3; i <= sqrt(n); i = i + 2) {while (n % i == 0){ans.pb(i);n = n/i;}}if (n > 2){ans.pb(n);} return ans;}
ll binpow(ll a, ll b, ll m) { a %= m; ll res = 1; while (b > 0) { if (b & 1){res = res * a % m;}a = a * a % m; b >>= 1;} return res;}
ll lg2(ll n){ll cnt=0;while(n){cnt++;n/=2;}return cnt;}
 
 
 
 
 
 
void solve(ll TC, ll TC2){
    ll s,n; cin >> s >> n;
    vector<vp> vals(s+1); vll mx(s+1); for(ll i = 1; i <= s; i++){mx[i] =s/i; mx[i]+=5;}
    for(ll i = 0; i < n; i++){
        ll v,w,k; cin >> v >> w >> k;
        vals[w].pb({v,k});
    }
 
    for(ll i = 1; i <= s; i++){sort(all(vals[i])); reverse(all(vals[i]));}
    vll a,b;
 
    for(ll i = 1; i <= s; i++){
        ll cnt = 0;
        for(pll p: vals[i]){
            for(ll j = 0; j < p.S; j++){
                cnt++;  a.pb(p.F); b.pb(i);
                if(cnt > mx[i]){break;}
            }
            if(cnt > mx[i]){break;}
        }
    }
    vll dp(s+1);
    for(ll i = 0; i < a.size(); i++){
        ll w = b[i], v = a[i];
        for(ll j = s; j >= w; j--){
            ckmax(dp[j], dp[j-w]+v);
        }
    }
    cout << *max_element(all(dp));
 
}
 
 
 
int main() {
    ios::sync_with_stdio(false); cin.tie(nullptr);
    tc1
}

Compilation message (stderr)

knapsack.cpp: In function 'void solve(long long int, long long int)':
knapsack.cpp:65:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |     for(ll i = 0; i < a.size(); i++){
      |                   ~~^~~~~~~~~~
knapsack.cpp: In function 'void setIO(std::string)':
knapsack.cpp:31:33: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   31 | void setIO(string name) {freopen((name+".in").c_str(),"r",stdin);freopen((name+".out").c_str(),"w",stdout);}
      |                          ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
knapsack.cpp:31:73: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   31 | void setIO(string name) {freopen((name+".in").c_str(),"r",stdin);freopen((name+".out").c_str(),"w",stdout);}
      |                                                                  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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