제출 #500262

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
500262		MohamedFaresNebili	Knapsack (NOI18_knapsack)	C++14	73 / 100	601 ms	19436 KiB

knapsack

#include <bits/stdc++.h>

        using namespace std;

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

        #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];
        ll dp[1005][2005];
        ll solve(ll i, ll t_left) {
            if(i == n || t_left == 0) return 0;
            if(dp[i][t_left] != -1) return dp[i][t_left];
            ll best = solve(i + 1, t_left);
            for(ll l = 1; l <= k[i]; l++) {
                if(w[i] * l > t_left) break;
                best = max(best, v[i] * l + solve(i + 1, t_left - w[i] * l));
            }
            return dp[i][t_left] = best;
        }

        int32_t main()
        {
            ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
            cin >> s >> n;
            memset(dp, -1, sizeof dp);
            for(ll l = 0; l < n; l++) cin >> v[l] >> w[l] >> k[l];
            cout << solve(0, s) << "\n";
            return 0;
        }

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