Problem p03732 (C++)

Buggy submission (status: Runtime Error):
#include <bits/stdc++.h>
// #include "ane.cpp"

const int INF = 1e9;
const long long INFLL = 1e18;
const int NMAX = 120;
const int MMAX = 100005;
const int KMAX = 1005;
const int MOD = 1e9 + 7;
using namespace std;

// comment to disable debug functions
// #define DEBUG

// frequently used macros

#if __cplusplus >= 201103L
#define ALL(v) begin(v), end(v)
#define SORT(v) sort(begin(v), end(v))
#define FIND(v, x) find(begin(v), end(v), (x))
#else
#define ALL(v) (v).begin(), (v).end()
#define SORT(v) sort(v.begin(), v.end())
#define FIND(v, x) find(v.begin(), v.end(), (x))
#endif

#define MEMNEXT(from, to)                                                      \
  do {                                                                         \
    memmove((to), (from), sizeof(from));                                       \
    memset((from), 0, sizeof(from));                                           \
  } while (0)
#ifdef DEBUG
#define DUMP(x)                                                                \
  do {                                                                         \
    std::cerr << (#x) << ": " << x << std::endl;                               \
  } while (0)
#else
#define DUMP(x)                                                                \
  do {                                                                         \
  } while (0)
#endif

// frequent used aliases
typedef long long ll;
typedef pair<int, int> p;
typedef pair<ll, int> lp;
typedef pair<ll, ll> llp;
typedef vector<int> vec;
typedef vector<ll> vecll;
typedef vector<vec> mat;
typedef vector<vecll> matll;

// frequently used constants
static const int di[] = {-1, 0, 1, -1, 1, -1, 0, 1};
static const int dj[] = {-1, -1, -1, 0, 0, 1, 1, 1};

// frequently used structs
struct edge {
  int to, cost;
};

// printf for debug
#ifndef DEBUG
void debug(const char *format, ...) {}
#else
void debug(const char *format, ...) {
  va_list arg;
  va_start(arg, format);
  vprintf(format, arg);
  va_end(arg);
}
#endif

// dump vector
#ifdef DEBUG
#define DUMPV(v, c)                                                            \
  do {                                                                         \
    printf("%s: ", #v);                                                        \
    for (int i = 0; i < (c); ++i) {                                            \
      cout << (v)[i] << " ";                                                   \
    }                                                                          \
    cout << endl;                                                              \
  } while (0)
#else
#define DUMPV(v, c)
#endif

// std::fill of multi dimensions
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
  std::fill((T *)array, (T *)(array + N), val);
}

// binary search
ll BSearch(ll _begin, ll _end, bool (*f)(int)) {
  ll mid;
  while (_end - _begin > 1LL) {
    mid = (_begin + _end) / 2LL;
    if (f(mid)) {
      debug("BSearch: f(%d) == true\n", mid);
      _end = mid;
    } else {
      debug("BSearch: f(%d) == false\n", mid);
      _begin = mid;
    }
  }
  return _end;
}

ll N, M, K, A[NMAX], B[NMAX], C, D, E;
ll dp[NMAX][3 * NMAX][NMAX];

string S;
vec v;

ll ans = 0;

void solve() {
  // main algorithm
  dp[0][0][0] = 0;
  for (ll i = 0; i < N; ++i) {
    for (ll j = 0; j <= i * 3; ++j) {
      for (ll k = 0; k <= i; ++k) {
        if (dp[i][j][k] != -1) {
          dp[i + 1][j][k] = max(dp[i + 1][j][k], dp[i][j][k]);
          ll jj = j + A[i] - A[0];
          if (jj <= 300)
            dp[i + 1][jj][k + 1] =
                max(dp[i + 1][jj][k + 1], dp[i][j][k] + B[i]);
        }
      }
    }
  }
  for (ll i = 0; i <= N; ++i) {
    for (ll j = 0; j <= M - A[0] * i; ++j) {
      ans = max(ans, dp[N][j][i]);
    }
  }
}
void debug() {
  // output debug information
  for (int i = 0; i <= N; ++i) {
    DUMP(i);
    for (int j = 0; j <= 3 * i; ++j) {
      for (int k = 0; k <= i; ++k) {
        cout << dp[i][j][k] << " ";
      }
      cout << endl;
    }
  }
}
void answer() {
  // output answer
  cout << ans << endl;
}
int main(int argc, char const *argv[]) {
  // operate inputs

  Fill(dp, -1);
  cin >> N >> M;
  for (int i = 0; i < N; ++i) {
    scanf("%lld%lld", &A[i], &B[i]);
  }
  solve();
#ifdef DEBUG
  debug();
#endif
  answer();

  return 0;
}

Fixed submission:
#include <bits/stdc++.h>
// #include "ane.cpp"

const int INF = 1e9;
const long long INFLL = 1e18;
const int NMAX = 120;
const int MMAX = 100005;
const int KMAX = 1005;
const int MOD = 1e9 + 7;
using namespace std;

// comment to disable debug functions
// #define DEBUG

// frequently used macros

#if __cplusplus >= 201103L
#define ALL(v) begin(v), end(v)
#define SORT(v) sort(begin(v), end(v))
#define FIND(v, x) find(begin(v), end(v), (x))
#else
#define ALL(v) (v).begin(), (v).end()
#define SORT(v) sort(v.begin(), v.end())
#define FIND(v, x) find(v.begin(), v.end(), (x))
#endif

#define MEMNEXT(from, to)                                                      \
  do {                                                                         \
    memmove((to), (from), sizeof(from));                                       \
    memset((from), 0, sizeof(from));                                           \
  } while (0)
#ifdef DEBUG
#define DUMP(x)                                                                \
  do {                                                                         \
    std::cerr << (#x) << ": " << x << std::endl;                               \
  } while (0)
#else
#define DUMP(x)                                                                \
  do {                                                                         \
  } while (0)
#endif

// frequent used aliases
typedef long long ll;
typedef pair<int, int> p;
typedef pair<ll, int> lp;
typedef pair<ll, ll> llp;
typedef vector<int> vec;
typedef vector<ll> vecll;
typedef vector<vec> mat;
typedef vector<vecll> matll;

// frequently used constants
static const int di[] = {-1, 0, 1, -1, 1, -1, 0, 1};
static const int dj[] = {-1, -1, -1, 0, 0, 1, 1, 1};

// frequently used structs
struct edge {
  int to, cost;
};

// printf for debug
#ifndef DEBUG
void debug(const char *format, ...) {}
#else
void debug(const char *format, ...) {
  va_list arg;
  va_start(arg, format);
  vprintf(format, arg);
  va_end(arg);
}
#endif

// dump vector
#ifdef DEBUG
#define DUMPV(v, c)                                                            \
  do {                                                                         \
    printf("%s: ", #v);                                                        \
    for (int i = 0; i < (c); ++i) {                                            \
      cout << (v)[i] << " ";                                                   \
    }                                                                          \
    cout << endl;                                                              \
  } while (0)
#else
#define DUMPV(v, c)
#endif

// std::fill of multi dimensions
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
  std::fill((T *)array, (T *)(array + N), val);
}

// binary search
ll BSearch(ll _begin, ll _end, bool (*f)(int)) {
  ll mid;
  while (_end - _begin > 1LL) {
    mid = (_begin + _end) / 2LL;
    if (f(mid)) {
      debug("BSearch: f(%d) == true\n", mid);
      _end = mid;
    } else {
      debug("BSearch: f(%d) == false\n", mid);
      _begin = mid;
    }
  }
  return _end;
}

ll N, M, K, A[NMAX], B[NMAX], C, D, E;
ll dp[NMAX][3 * NMAX][NMAX];

string S;
vec v;

ll ans = 0;

void solve() {
  // main algorithm
  dp[0][0][0] = 0;
  for (ll i = 0; i < N; ++i) {
    for (ll j = 0; j <= i * 3; ++j) {
      for (ll k = 0; k <= i; ++k) {
        if (dp[i][j][k] != -1) {
          dp[i + 1][j][k] = max(dp[i + 1][j][k], dp[i][j][k]);
          ll jj = j + A[i] - A[0];
          if (jj <= 300)
            dp[i + 1][jj][k + 1] =
                max(dp[i + 1][jj][k + 1], dp[i][j][k] + B[i]);
        }
      }
    }
  }
  for (ll i = 0; i <= N; ++i) {
    for (ll j = 0; j <= 300; ++j) {
      if (j + A[0] * i > M)
        continue;
      ans = max(ans, dp[N][j][i]);
    }
  }
}
void debug() {
  // output debug information
  for (int i = 0; i <= N; ++i) {
    DUMP(i);
    for (int j = 0; j <= 3 * i; ++j) {
      for (int k = 0; k <= i; ++k) {
        cout << dp[i][j][k] << " ";
      }
      cout << endl;
    }
  }
}
void answer() {
  // output answer
  cout << ans << endl;
}
int main(int argc, char const *argv[]) {
  // operate inputs

  Fill(dp, -1);
  cin >> N >> M;
  for (int i = 0; i < N; ++i) {
    scanf("%lld%lld", &A[i], &B[i]);
  }
  solve();
#ifdef DEBUG
  debug();
#endif
  answer();

  return 0;
}