제출 #925479

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
925479		Youssif_Elkadi	Knapsack (NOI18_knapsack)	C++17	0 / 100	2 ms	1368 KiB

knapsack

#include <bits/stdc++.h>
using namespace std;
const int N = 5e2 + 5, inf = 1e9, mod = 998244353;
int dp[106][2005], s, n;
pair<int, pair<int, int>> arr[105];
int main()
{
    cin >> s >> n;
    for (int i = 1; i <= n; i++)
        cin >> arr[i].first >> arr[i].second.first >> arr[i].second.second;
    for (int i = 0; i <= s; i++)
        for (int j = 0; j <= n; j++)
            dp[i][j] = -inf;
    dp[0][0] = 0;
    for (int i = 1; i <= n; i++)
        for (int j = 0; j <= s; j++)
            for (int k = 0; k <= arr[i].second.second && k * arr[i].second.first <= j; k++)
                dp[i][j] = max(dp[i][j], dp[i - 1][j - k * arr[i].second.first] + arr[i].first * k);
    cout << dp[n][s] << "\n";
}

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