Problem p02863 (C++)

Buggy submission (status: Runtime Error):
#include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0, i##_max = (N); i < i##_max; ++i)
#define repp(i, l, r) for (int i = (l), i##_max = (r); i < i##_max; ++i)
#define per(i, N) for (int i = (N)-1; i >= 0; --i)
#define perr(i, l, r) for (int i = r - 1, i##_min(l); i >= i##_min; --i)
#define all(arr) (arr).begin(), (arr).end()
#define SP << " " <<
#define SPF << " "
#define SPEEDUP                                                                \
  cin.tie(0);                                                                  \
  ios::sync_with_stdio(false);
#define MAX_I INT_MAX      // 1e9
#define MIN_I INT_MIN      //-1e9
#define MAX_UI UINT_MAX    // 1e9
#define MAX_LL LLONG_MAX   // 1e18
#define MIN_LL LLONG_MIN   //-1e18
#define MAX_ULL ULLONG_MAX // 1e19
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<char, char> PCC;
typedef pair<ll, ll> PLL;
typedef pair<char, int> PCI;
typedef pair<int, char> PIC;
typedef pair<ll, int> PLI;
typedef pair<int, ll> PIL;
typedef pair<ll, char> PLC;
typedef pair<char, ll> PCL;

inline void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
inline void YESNO(bool b) { cout << (b ? "YES" : "NO") << endl; }
inline void Yay(bool b) { cout << (b ? "Yay!" : ":(") << endl; }

const int NMAX = 3010, TMAX = 3010;

ll dp1[NMAX][TMAX];
ll dp2[NMAX][TMAX];

int solve() {
  int N, T;
  cin >> N >> T;
  vector<PII> v(N);
  rep(i, N) cin >> v[i].first >> v[i].second;

  rep(i, N) {
    int j = N - 1 - i;
    rep(t, T) {
      dp1[i + 1][t] = max(dp1[i + 1][t], dp1[i][t]);
      dp2[j][t] = max(dp2[j][t], dp2[j + 1][t]);
      int t_;
      t_ = t + v[i].first;
      if (t_ < T)
        dp1[i + 1][t_] = max(dp1[i + 1][t_], dp1[i][t] + v[i].second);
      t_ = t + v[j].first;
      if (t_ < T)
        dp2[j][t_] = max(dp2[j][t_], dp2[j - 1][t] + v[j].second);
    }
  }

  ll ans = 0;
  rep(i, N) {
    rep(t, T) {
      ans = max(ans, dp1[i][t] + dp2[i + 1][T - 1 - t] + v[i].second);
    }
  }
  cout << ans << endl;
  return 0;
}

int main(void) {
  SPEEDUP
  cout << setprecision(15);
  solve();
  return 0;
}


Fixed submission:
#include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0, i##_max = (N); i < i##_max; ++i)
#define repp(i, l, r) for (int i = (l), i##_max = (r); i < i##_max; ++i)
#define per(i, N) for (int i = (N)-1; i >= 0; --i)
#define perr(i, l, r) for (int i = r - 1, i##_min(l); i >= i##_min; --i)
#define all(arr) (arr).begin(), (arr).end()
#define SP << " " <<
#define SPF << " "
#define SPEEDUP                                                                \
  cin.tie(0);                                                                  \
  ios::sync_with_stdio(false);
#define MAX_I INT_MAX      // 1e9
#define MIN_I INT_MIN      //-1e9
#define MAX_UI UINT_MAX    // 1e9
#define MAX_LL LLONG_MAX   // 1e18
#define MIN_LL LLONG_MIN   //-1e18
#define MAX_ULL ULLONG_MAX // 1e19
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<char, char> PCC;
typedef pair<ll, ll> PLL;
typedef pair<char, int> PCI;
typedef pair<int, char> PIC;
typedef pair<ll, int> PLI;
typedef pair<int, ll> PIL;
typedef pair<ll, char> PLC;
typedef pair<char, ll> PCL;

inline void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
inline void YESNO(bool b) { cout << (b ? "YES" : "NO") << endl; }
inline void Yay(bool b) { cout << (b ? "Yay!" : ":(") << endl; }

const int NMAX = 3010, TMAX = 3010;

ll dp1[NMAX][TMAX];
ll dp2[NMAX][TMAX];

int solve() {
  int N, T;
  cin >> N >> T;
  vector<PII> v(N);
  rep(i, N) cin >> v[i].first >> v[i].second;

  rep(i, N) {
    int j = N - 1 - i;
    rep(t, T) {
      dp1[i + 1][t] = max(dp1[i + 1][t], dp1[i][t]);
      dp2[j][t] = max(dp2[j][t], dp2[j + 1][t]);
      int t_;
      t_ = t + v[i].first;
      if (t_ < T)
        dp1[i + 1][t_] = max(dp1[i + 1][t_], dp1[i][t] + v[i].second);
      t_ = t + v[j].first;
      if (t_ < T)
        dp2[j][t_] = max(dp2[j][t_], dp2[j + 1][t] + v[j].second);
    }
  }

  ll ans = 0;
  rep(i, N) {
    rep(t, T) {
      ans = max(ans, dp1[i][t] + dp2[i + 1][T - 1 - t] + v[i].second);
    }
  }
  cout << ans << endl;
  return 0;
}

int main(void) {
  SPEEDUP
  cout << setprecision(15);
  solve();
  return 0;
}