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

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

using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using LL = long long;
using VL = vector<LL>;
using VVL = vector<VL>;
using PLL = pair<LL, LL>;
using VS = vector<string>;

#define ALL(a) begin((a)), end((a))
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SORT(c) sort(ALL((c)))
#define RSORT(c) sort(RALL((c)))
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))

#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)

#define FF first
#define SS second
template <class S, class T> istream &operator>>(istream &is, pair<S, T> &p) {
  return is >> p.FF >> p.SS;
}
template <class S, class T>
ostream &operator<<(ostream &os, const pair<S, T> &p) {
  return os << p.FF << " " << p.SS;
}
template <class T> void maxi(T &x, T y) {
  if (x < y)
    x = y;
}
template <class T> void mini(T &x, T y) {
  if (x > y)
    x = y;
}

const double EPS = 1e-10;
const double PI = acos(-1.0);
const LL MOD = 1e9 + 7;
const LL INF = 1e15;

LL dp[2][3010];

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

  int N, T, S;
  cin >> N >> T >> S;
  VL xs(N), ys(N);
  REP(i, N) cin >> xs[i] >> ys[i];

  int crt = 0, nxt = 1;
  fill((LL *)dp, (LL *)dp + 2 * 3010, -INF);
  dp[crt][0] = 0;
  REP(i, N) {
    REP(t, T + 1)
    maxi(dp[nxt][t], dp[crt][t]);
    for (int t = 0; t <= T; ++t) {
      int nt = t + ys[i];
      if (nt <= T && !(t < S && S < nt))
        maxi(dp[nxt][nt], dp[crt][t] + xs[i]);
    }
    FOR(t, 1, T + 1)
    maxi(dp[nxt][t], dp[nxt][t - 1]);
    swap(crt, nxt);
  }

  cout << *max_element(dp[crt], dp[crt] + T + 1) << endl;

  return 0;
}

Error: MLE

Fixed submission:

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

using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using LL = long long;
using VL = vector<LL>;
using VVL = vector<VL>;
using PLL = pair<LL, LL>;
using VS = vector<string>;

#define ALL(a) begin((a)), end((a))
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SORT(c) sort(ALL((c)))
#define RSORT(c) sort(RALL((c)))
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))

#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)

#define FF first
#define SS second
template <class S, class T> istream &operator>>(istream &is, pair<S, T> &p) {
  return is >> p.FF >> p.SS;
}
template <class S, class T>
ostream &operator<<(ostream &os, const pair<S, T> &p) {
  return os << p.FF << " " << p.SS;
}
template <class T> void maxi(T &x, T y) {
  if (x < y)
    x = y;
}
template <class T> void mini(T &x, T y) {
  if (x > y)
    x = y;
}

const double EPS = 1e-10;
const double PI = acos(-1.0);
const LL MOD = 1e9 + 7;
const LL INF = 1e15;

// dp[i][t]
LL dp[3010][3010];

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

  int N, T, S;
  cin >> N >> T >> S;
  VL xs(N), ys(N);
  REP(i, N) cin >> xs[i] >> ys[i];

  fill((LL *)dp, (LL *)dp + 3010 * 3010, -INF);
  dp[0][0] = 0;
  REP(i, N) {
    REP(t, T + 1)
    maxi(dp[i + 1][t], dp[i][t]);
    for (int t = 0; t <= T; ++t) {
      int nt = t + ys[i];
      if (nt <= T && !(t < S && S < nt))
        maxi(dp[i + 1][nt], dp[i][t] + xs[i]);
    }
    FOR(t, 1, T + 1)
    maxi(dp[i + 1][t], dp[i + 1][t - 1]);
  }

  cout << *max_element(dp[N], dp[N] + T + 1) << endl;
  ;

  return 0;
}