Submission #849063

#	Time	Username	Problem	Language	Result	Execution time	Memory
849063		AbdalrhmanMohammad	Knapsack (NOI18_knapsack)	C++14	0 / 100	2 ms	348 KiB

knapsack

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

#define FAST                                                                   \
  ios_base::sync_with_stdio(false);                                            \
  cin.tie(nullptr);                                                            \
  cout.tie(nullptr);

#define ll long long
#define yn(tf) cout << (tf ? "YES\n" : "NO\n")
#define Endl endl
#define ld long double

const ld PI = 3.14159265359;
const ll MOD = 998244353;
const ll N = 1e5 + 7;

int s, n;
ll v[N], w[N], k[N];
vector<vector<ll>> mem;
ll fun(int i, int rem) {
  if (rem < 0)
    return -1e15;
  if (i == n || rem == 0)
    return 0;
  ll &res = mem[i][rem];
  if (res != -1)
    return res;
  res = fun(i + 1, rem);
  for (ll j = 1; j <= min(2000LL, k[i]); j++)
    res = max(res, fun(i + 1, rem - j * w[i]) + v[i] * j);
  return res;
}
int main() {
  FAST
#ifndef ONLINE_JUDGE
      freopen("in.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
#endif
  cin >> s >> n;
  mem = vector<vector<ll>>(n + 1, vector<ll>(s + 1));
  for (int i = 0; i < n; i++)
    cin >> v[i] >> w[i] >> k[i];

  for (int i = 0; i <= n; i++)
    for (int j = 0; j <= s; j++)
      mem[i][j] = -1;
  cout << fun(0, s);
  return 0;
}

/*

*/

// BEFORE coding are you sure you understood the statement correctly?
// PLEASE do not forget to read the sample explanation carefully.
// WATCH out for overflows & RTs in general.
// TEST your idea or code on the corner cases.
// ANALYZE each idea you have thoroughly.

Compilation message (stderr)

knapsack.cpp: In function 'int main()':
knapsack.cpp:38:14: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |       freopen("in.txt", "r", stdin);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

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