Submission #1104217

#	Time	Username	Problem	Language	Result	Execution time	Memory
1104217		KasymK	Knapsack (NOI18_knapsack)	C++17	0 / 100	1 ms	504 KiB

knapsack

#include "bits/stdc++.h"
using namespace std;
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define tr(i, c) for(auto i = c.begin(); i != c.end(); ++i)
#define wr puts("----------------")
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int N = 2005;
ll dp[N];
vector<pii> Q[N];

int main(){
    int s, n;
    scanf("%d%d", &s, &n);
    for(int i = 1; i <= n; ++i){
        int w, v, k;
        scanf("%d%d%d", &v, &w, &k);
        Q[w].pb({v, k});
    }
    for(int ad = 1; ad <= s; ++ad){
        sort(all(Q[ad]));
        reverse(all(Q[ad]));
        int sz = (int)Q[ad].size(), w = 0;
        ll v = 0;
        for(int i = 0; i < sz;){
            if(Q[ad][i].ss == 0){
                i++;
                continue;
            }
            w += ad, v += Q[ad][i].ff, Q[ad][i].ss--;
            if(w > s)
                break;
            for(int i = s; i >= w; --i)
                umax(dp[i], dp[i-w]+v);
        }
    }
    printf("%lld\n", dp[s]);
    return 0;
}

Compilation message (stderr)

knapsack.cpp: In function 'int main()':
knapsack.cpp:21:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |     scanf("%d%d", &s, &n);
      |     ~~~~~^~~~~~~~~~~~~~~~
knapsack.cpp:24:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   24 |         scanf("%d%d%d", &v, &w, &k);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~

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