제출 #1116290

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1116290		TAFH	Knapsack (NOI18_knapsack)	C++17	73 / 100	1071 ms	3920 KiB

knapsack

#include <bits/stdc++.h>

#define forn(i, n) for (int i = 0; i < n; i++)
#define ull unsigned long long
#define ll long long
#define SPEED                         \
    ios_base::sync_with_stdio(false); \
    cin.tie(0);                       \
    cout.tie(0)

using namespace std;
const int N = 1000 + 13;
const int maxa = 1e6 + 13;
const ll mod = 998244353;

void prestart() {}

ll dp[maxa];
void start()
{
    int s, n;
    cin >> s >> n;

    ll v[n], w[n], k[n];
    forn(i, n) {
        cin >> v[i];
        cin >> w[i];
        cin >> k[i];
    }

    for (int i = 0; i < n; i++)
    {
        for (int j = s; j >= 0; j--)
        {
            for(int l = 0; l <= min(k[i], j / w[i]); l++) {
                dp[j] = max(dp[j], dp[j - w[i] * l] + v[i] * l);
            }
        }
    }

    cout << dp[s] << "\n";
}

signed main()
{
    SPEED;
    int t = 1;
    prestart();
    // cin >> t;
    while (t--)
    {
        start();
    }
}

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