Submission #1298837

#	Time	Username	Problem	Language	Result	Execution time	Memory
1298837		Euclid73	Knapsack (NOI18_knapsack)	C++20	73 / 100	1094 ms	2580 KiB

knapsack

#include <bits/stdc++.h>
using namespace std;

#define ll long long

const ll MAXN=1e5+5;
const ll MAXS=2005;

ll s, n, v[MAXN], w[MAXN], k[MAXN], dp[MAXS], ans;

void dodp(ll vx, ll wx)
{
    for (int i=s; i>=wx; i--)
    {
        dp[i]=max(dp[i], dp[i-wx]+vx);
    }
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin >> s >> n;
    for (int i=0; i<n; i++)
    {
        cin >> v[i] >> w[i] >> k[i];
        k[i]=min(k[i], s/w[i]);
        ll m=1;
        while (k[i]>0)
        {
            m=min(m, k[i]);
            dodp(v[i]*m, w[i]*m);
            k[i]-=m;
            m*=2;
        }
    }
    for (int i=1; i<=s; i++)
    {
        ans=max(ans, dp[i]);
    }
    cout << ans << "\n";
}

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