Submission #1326728

#	Time	Username	Problem	Language	Result	Execution time	Memory
1326728		rayanry9	Knapsack (NOI18_knapsack)	C++20	12 / 100	2 ms	1848 KiB

knapsack

#include <algorithm>
#include <iostream>

typedef long long int ll;

int main() {
  ll s, n;
  std::cin >> s >> n;
  ll v[n + 1];
  ll w[n + 1];
  ll k[n + 1];
  for (ll i = 1; i <= n; i++) {
    std::cin >> v[i] >> w[i] >> k[i];
  }

  ll dp[n + 1][s + 1];
  for (ll i = 0; i <= n; i++) {
    for (ll j = 0; j <= s; j++) {
      dp[i][j] = 0;
    }
  }

  for (ll i = 1; i <= n; i++) {
    for (ll j = w[i]; j <= s; j++) {
      for (ll m = 0; m <= k[i] && j - m * w[i] >= 0; m++) {
        dp[i][j] = std::max(dp[i][j], dp[i - 1][j - m * w[i]] + m * v[i]);
        dp[i][j] %= (ll)(1e9 + 7);
      }
    }
  }

  std::cout << dp[n][s] << '\n';
}

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