Problem p02006 (C++) — buggy submission, verdict: Memory Limit Exceeded

#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
template <class S, class T>
ostream &operator<<(ostream &out, const pair<S, T> &o) {
  out << "(" << o.first << "," << o.second << ")";
  return out;
}
template <class T> ostream &operator<<(ostream &out, const vector<T> &V) {
  for (int i = 0; i < V.size(); i++) {
    out << V[i];
    if (i != V.size() - 1)
      out << " ";
  }
  return out;
}
template <class T>
ostream &operator<<(ostream &out, const vector<vector<T>> &Mat) {
  for (int i = 0; i < Mat.size(); i++) {
    if (i != 0)
      out << endl;
    out << Mat[i];
  }
  return out;
}
template <class S, class T>
ostream &operator<<(ostream &out, const map<S, T> &mp) {
  out << "{ ";
  for (auto it = mp.begin(); it != mp.end(); it++) {
    out << it->first << ":" << it->second;
    if (mp.size() - 1 != distance(mp.begin(), it))
      out << ", ";
  }
  out << " }";
  return out;
}
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
  return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
  t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
  for (auto &e : t)
    fill_v(e, v);
}
/*
 <url:>
 問題文============================================================
 =================================================================
 解説=============================================================
 ================================================================
 */

template <class Type> Type solve(Type res = Type()) { return res; }
int main(void) {
  cin.tie(0);
  ios_base::sync_with_stdio(false);
  // solve(0);
  // cout << fixed << setprecision(15) << solve<vector<vector<int>>>() << endl;
  ll C, N, M;
  cin >> C >> N >> M;
  vector<ll> s(N), p(N);
  for (int i = 0; i < N; i++)
    cin >> s[i] >> p[i];

  vector<vector<ll>> dp(2, vector<ll>(C + 1));
  for (int i = 0; i < N; i++) {
    for (int j = 0; j <= C; j++) {
      dp[(i + 1) & 1][j] = max(dp[(i + 1) & 1][j], dp[i & 1][j]);
      if (j + s[i] <= C) {
        dp[(i + 1) & 1][j + s[i]] =
            max(dp[(i + 1) & 1][j + s[i]], dp[i & 1][j] + p[i]);
      }
      dp[i & 1][j] = 0;
    }
  }
  for (int i = 1; i <= M; i++) {
    cout << dp[N & 1][C / i] * i << endl;
  }
  return 0;
}


Error: MLE

Fixed submission:

#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
template <class S, class T>
ostream &operator<<(ostream &out, const pair<S, T> &o) {
  out << "(" << o.first << "," << o.second << ")";
  return out;
}
template <class T> ostream &operator<<(ostream &out, const vector<T> &V) {
  for (int i = 0; i < V.size(); i++) {
    out << V[i];
    if (i != V.size() - 1)
      out << " ";
  }
  return out;
}
template <class T>
ostream &operator<<(ostream &out, const vector<vector<T>> &Mat) {
  for (int i = 0; i < Mat.size(); i++) {
    if (i != 0)
      out << endl;
    out << Mat[i];
  }
  return out;
}
template <class S, class T>
ostream &operator<<(ostream &out, const map<S, T> &mp) {
  out << "{ ";
  for (auto it = mp.begin(); it != mp.end(); it++) {
    out << it->first << ":" << it->second;
    if (mp.size() - 1 != distance(mp.begin(), it))
      out << ", ";
  }
  out << " }";
  return out;
}
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
  return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
  t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
  for (auto &e : t)
    fill_v(e, v);
}
/*
 <url:>
 問題文============================================================
 =================================================================
 解説=============================================================
 ================================================================
 */

template <class Type> Type solve(Type res = Type()) { return res; }
int main(void) {
  cin.tie(0);
  ios_base::sync_with_stdio(false);
  // solve(0);
  // cout << fixed << setprecision(15) << solve<vector<vector<int>>>() << endl;
  ll C, N, M;
  cin >> C >> N >> M;
  vector<ll> s(N), p(N);
  for (int i = 0; i < N; i++)
    cin >> s[i] >> p[i];

  vector<vector<ll>> dp(N + 1, vector<ll>(C + 1));
  for (int i = 0; i < N; i++) {
    for (int j = 0; j <= C; j++) {
      dp[i + 1][j] = max(dp[i + 1][j], dp[i][j]);
      if (j + s[i] <= C) {
        dp[i + 1][j + s[i]] = max(dp[i + 1][j + s[i]], dp[i][j] + p[i]);
      }
    }
  }
  for (int i = 1; i <= M; i++) {
    cout << dp[N][C / i] * i << endl;
  }
  return 0;
}