Problem p01065 (C++) — buggy submission, verdict: Time Limit Exceeded

#include <bits/stdc++.h>

#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)

#define _rrep(i, n) _rrange(i, n, 0)
#define _rrange(i, a, b) for (int i = (int)(a)-1; i >= (int)(b); --i)
#define rrep(...) _overload(__VA_ARGS__, _rrange, _rrep, )(__VA_ARGS__)

#define _all(arg) begin(arg), end(arg)
#define uniq(arg) sort(_all(arg)), (arg).erase(unique(_all(arg)), end(arg))
#define getidx(ary, key) lower_bound(_all(ary), key) - begin(ary)
#define clr(a, b) memset((a), (b), sizeof(a))
#define bit(n) (1LL << (n))

// #define DEBUG

#ifdef DEBUG
#define dump(...) fprintf(stderr, __VA_ARGS__)
#else
#define dump(...)
#endif

template <class T> bool chmax(T &a, const T &b) {
  return (a < b) ? (a = b, 1) : 0;
}
template <class T> bool chmin(T &a, const T &b) {
  return (b < a) ? (a = b, 1) : 0;
}

using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;

const double EPS = 1e-10;
const double PI = acos(-1.0);
const ll inf = 1LL << 62;
const ll mod = 1000000007LL;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};

ll extgcd(ll a, ll b, ll &x, ll &y) {
  x = 1, y = 0;
  ll g = a;
  if (b != 0)
    g = extgcd(b, a % b, y, x), y -= a / b * x;
  return g;
}
ll ADD(const ll &a, const ll &b, const ll &mod) { return (a + b) % mod; }
ll SUB(const ll &a, const ll &b, const ll &mod) { return (a - b + mod) % mod; }
ll MUL(const ll &a, const ll &b, const ll &mod) { return (1LL * a * b) % mod; }
ll DIV(const ll &a, const ll &b, const ll &mod) {
  ll x, y;
  extgcd(b, mod, x, y);
  return MUL(a, (x + mod) % mod, mod);
}

random_device rd;
mt19937 mt(rd());
uniform_int_distribution<int> dice(1, 6);
uniform_real_distribution<double> score(0.0, 10.0);

int main(void) {
  int n;
  cin >> n;
  int x, y;
  cin >> x >> y;

  int offset = 150;
  vector<vi> dp[2];
  int d1 = x + 1, d2 = y + 300 + offset;
  rep(i, 2) dp[i] = vector<vi>(d1, vi(d2, -1));
  dp[0][x][y + offset] = 0;

  int i = 0;
  rep(loop, n) {
    int a, b, c, d;
    scanf("%d %d %d %d", &a, &b, &c, &d);

    int pre = i;
    i = !i;
    rep(tako, d1) {
      rep(fuga, d2) { dp[i][tako][fuga] = -1; }
    }

    rep(tako, d1) {
      rep(fuga, d2) {
        if (dp[pre][tako][fuga] == -1)
          continue;
        int buta = dp[pre][tako][fuga];

        chmax(dp[i][tako][fuga], buta);

        if (fuga - c >= 0)
          chmax(dp[i][tako][fuga - c], buta + d);

        if (tako - a >= 0 and fuga + b < d2)
          chmax(dp[i][tako - a][fuga + b], buta);
      }
    }
  }

  int res = 0;
  rep(tako, d1) {
    rep(fuga, d2) {
      int buta = dp[i][tako][fuga];

      if (fuga >= offset) {
        chmax(res, buta);
      }
    }
  }

  cout << res << endl;

  return 0;
}

Error: TLE

Fixed submission:

#include <bits/stdc++.h>

#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)

#define _rrep(i, n) _rrange(i, n, 0)
#define _rrange(i, a, b) for (int i = (int)(a)-1; i >= (int)(b); --i)
#define rrep(...) _overload(__VA_ARGS__, _rrange, _rrep, )(__VA_ARGS__)

#define _all(arg) begin(arg), end(arg)
#define uniq(arg) sort(_all(arg)), (arg).erase(unique(_all(arg)), end(arg))
#define getidx(ary, key) lower_bound(_all(ary), key) - begin(ary)
#define clr(a, b) memset((a), (b), sizeof(a))
#define bit(n) (1LL << (n))

// #define DEBUG

#ifdef DEBUG
#define dump(...) fprintf(stderr, __VA_ARGS__)
#else
#define dump(...)
#endif

template <class T> bool chmax(T &a, const T &b) {
  return (a < b) ? (a = b, 1) : 0;
}
template <class T> bool chmin(T &a, const T &b) {
  return (b < a) ? (a = b, 1) : 0;
}

using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;

const double EPS = 1e-10;
const double PI = acos(-1.0);
const ll inf = 1LL << 62;
const ll mod = 1000000007LL;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};

ll extgcd(ll a, ll b, ll &x, ll &y) {
  x = 1, y = 0;
  ll g = a;
  if (b != 0)
    g = extgcd(b, a % b, y, x), y -= a / b * x;
  return g;
}
ll ADD(const ll &a, const ll &b, const ll &mod) { return (a + b) % mod; }
ll SUB(const ll &a, const ll &b, const ll &mod) { return (a - b + mod) % mod; }
ll MUL(const ll &a, const ll &b, const ll &mod) { return (1LL * a * b) % mod; }
ll DIV(const ll &a, const ll &b, const ll &mod) {
  ll x, y;
  extgcd(b, mod, x, y);
  return MUL(a, (x + mod) % mod, mod);
}

random_device rd;
mt19937 mt(rd());
uniform_int_distribution<int> dice(1, 6);
uniform_real_distribution<double> score(0.0, 10.0);

int main(void) {
  int n;
  cin >> n;
  int x, y;
  cin >> x >> y;

  map<int, map<int, int>> dp[2];
  dp[0][x][y] = 0;

  int i = 0;
  rep(loop, n) {
    int a, b, c, d;
    scanf("%d %d %d %d", &a, &b, &c, &d);

    int pre = i;
    i = !i;
    dp[i].clear();

    for (auto &e1 : dp[pre]) {
      for (auto &e2 : e1.second) {
        int tako = e1.first, fuga = e2.first;
        int buta = e2.second;

        chmax(dp[i][tako][fuga], buta);

        if (fuga - c >= -150)
          chmax(dp[i][tako][fuga - c], buta + d);

        if (tako - a >= 0)
          chmax(dp[i][tako - a][fuga + b], buta);
      }
    }
  }

  int res = 0;
  for (auto &e1 : dp[i]) {
    for (auto &e2 : e1.second) {
      int tako = e1.first, fuga = e2.first;
      int buta = e2.second;

      if (tako >= 0 and fuga >= 0) {
        chmax(res, buta);
      }
    }
  }

  cout << res << endl;

  return 0;
}