Submission #824200

#	Time	Username	Problem	Language	Result	Execution time	Memory
824200		VMaksimoski008	Knapsack (NOI18_knapsack)	C++14	29 / 100	1 ms	1876 KiB

knapsack

#include <bits/stdc++.h>

#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define rall(x) x.rbegin(), x.rend()

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;

void setIO() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

struct Item { int v, w, k; };

int32_t main() {
    setIO();

    int s, n;
    cin >> s >> n;
    int mx = 0;

    vector<Item> v(n);
    for(Item &it : v) cin >> it.v >> it.w >> it.k, mx = max(mx, it.k);

    if(n == 1) {
        cout << min(s / v[0].w, v[0].k) * v[0].v << '\n';
        return 0;
    }

    if(mx == 1) {
        ll dp[n+1][s+1];
        memset(dp, 0, sizeof(dp));

        for(int i=1; i<=n; i++) {
            for(int j=1; j<=s; j++) {
                dp[i][j] = dp[i-1][j];
                if(j >= v[i-1].w)
                    dp[i][j] = max(dp[i][j], dp[i-1][j-v[i-1].w] + v[i-1].v);
            }
        }

        cout << dp[n][s] << '\n';
        return 0;
    }

    return 0;
}

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