Submission #780215

#	Time	Username	Problem	Language	Result	Execution time	Memory
780215		makanhulia	Knapsack (NOI18_knapsack)	C++17	73 / 100	1060 ms	368 KiB

knapsack

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
const ll MAXN = 1e5 + 5;
const ll MAXT = 2e3 + 5;

ll n, t, li, ei, ki, dp[MAXT];

void update(ll a, ll b) {
  // {Spread, Energi}
  for (int i = t; i >= 0; --i)
  {
    if (i < b)
    {
      break;
    }
    dp[i] = max(dp[i], dp[i-b] + a);
  }
}

void update2(ll a, ll b) {
  // {Spread, Energi}
  for (int i = b; i <= t; ++i)
  {
    dp[i] = max(dp[i], dp[i-b] + a);
  }
}

int main(){
  ios_base::sync_with_stdio(false); cin.tie(0);
  cin >> t >> n;

  for (int i = 0; i < n; ++i)
  {
    cin >> li >> ei >> ki;

    if (ki >= t / ei)
    {
      update2(li, ei);
      continue ;
    }

    ki = min(ki, t / ei);

    while(ki--) {
      update(li, ei);
    }
  }

  cout << dp[t] << "\n";
  return 0;
}

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