Submission #500292

#	Time	Username	Problem	Language	Result	Execution time	Memory
500292		MohamedFaresNebili	Knapsack (NOI18_knapsack)	C++14	100 / 100	88 ms	38480 KiB

knapsack

#include <bits/stdc++.h>

        using namespace std;

        using ll = long long;
        using ii = pair<ll, ll>;
        using vi = vector<ll>;

        #define ff first
        #define ss second
        #define pb push_back
        #define all(x) x.begin(), x.end()
        #define lb lower_bound
        #define ub upper_bound

        ll s, n; ll v[2 * 100005], w[2 * 100005], k[2 * 100005];
        vector<ii> arr[2005]; ll dp[2005][2005];

        int32_t main()
        {
            ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
            cin >> s >> n;
            for(ll l = 0; l < n; l++) {
                cin >> v[l] >> w[l] >> k[l];
                arr[w[l]].pb({v[l], k[l]});
            }
            int last = 0; ll res = 0;
            for(int l = 1; l <= s; l++) {
                if(!(int)arr[l].size()) continue;
                sort(all(arr[l]), greater<ii>());
                for(int i = 0; i <= s; i++) {
                    dp[l][i] = dp[last][i];
                    ll curr = 0, ind = 0, profit = 0;
                    for(int j = 1, k = 0; j <= i; j++, k++) {
                        if(k == arr[l][ind].ss) k = 0, ind++;
                        profit += arr[l][ind].ff;
                        if(j * l > i || ind == (int)arr[l].size()) break;
                        dp[l][i] = max(dp[l][i], dp[last][i - j * l] + profit);
                    }
                    res = max(res, dp[l][i]);
                }
                last = l;
            }
            cout << res << "\n";
            return 0;
        }

Compilation message (stderr)

knapsack.cpp: In function 'int32_t main()':
knapsack.cpp:33:24: warning: unused variable 'curr' [-Wunused-variable]
   33 |                     ll curr = 0, ind = 0, profit = 0;
      |                        ^~~~

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