Problem p01842 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>

using namespace std;

#ifdef DEBUG_MODE
#define DBG(n) n;
#else
#define DBG(n) ;
#endif
#define REP(i, n) for (ll(i) = (0); (i) < (n); ++i)
#define rep(i, s, g) for (ll(i) = (s); (i) < (g); ++i)
#define rrep(i, s, g) for (ll(i) = (s); i >= (g); --(i))
#define PB push_back
#define MP make_pair
#define FI first
#define SE second
#define SHOW1d(v, n)                                                           \
  {                                                                            \
    for (int WWW = 0; WWW < (n); WWW++)                                        \
      cerr << v[WWW] << ' ';                                                   \
    cerr << endl << endl;                                                      \
  }
#define SHOW2d(v, i, j)                                                        \
  {                                                                            \
    for (int aaa = 0; aaa < i; aaa++) {                                        \
      for (int bbb = 0; bbb < j; bbb++)                                        \
        cerr << v[aaa][bbb] << ' ';                                            \
      cerr << endl;                                                            \
    }                                                                          \
    cerr << endl;                                                              \
  }
#define ALL(v) v.begin(), v.end()
#define Decimal fixed << setprecision(20)
#define INF 1000000000
#define LLINF 1000000000000000000LL
#define MOD 1000000007

typedef long long ll;
typedef pair<ll, ll> P;

ll dp[4][55][55][55][55];
ll n, m;
vector<ll> a;
vector<ll> b;

ll check(ll hoge, ll x1, ll y1, ll x2, ll y2) {
  ll ret = 0;
  for (ll i = x1 - 1; i >= x2; i--) {
    if (a[i] != -1)
      ret += a[i];
  }
  for (ll i = y1 - 1; i >= y2; i--) {
    if (b[i] != -1)
      ret -= b[i];
  }
  DBG(cout << "check " << hoge << ' ' << x1 << ' ' << y1 << ' ' << x2 << ' '
           << y2 << endl;
      cout << ret << endl;)
  return ret;
}

ll dfs(ll type, ll x1, ll y1, ll x2, ll y2) {
  DBG(cout << "IN " << type << ' ' << x1 << ' ' << y1 << ' ' << x2 << ' ' << y2
           << endl;)
  ll ret;
  // A
  if (type % 2 == 0) {
    ret = -LLINF;
    // 置く
    if (x1 < n) {
      if (a[x1] == -1) {
        ret = max(ret, dfs(1, x1 + 1, y1, x2, y1));
      } else {
        ret = max(ret, dfs(1, x1 + 1, y1, x2, y2));
      }
    }
    // 置かない
    if (type == 2)
      ret = max(ret, 0LL);
    else if (x1 == x2 && y1 == y2) {
      ret = max(ret, dfs(3, x1, y1, x2, y2));
    } else {
      ll tmp = check(type, x1, y1, x2, y2);
      ret = max(ret, dfs(1, x1, y1, x1, y1) + tmp);
    }
  }
  // B
  else {
    ret = LLINF;
    // 置く
    if (y1 < m) {
      if (b[y1] == -1) {
        ret = min(ret, dfs(0, x1, y1 + 1, x1, y2));
      } else {
        ret = min(ret, dfs(0, x1, y1 + 1, x2, y2));
      }
    }
    // 置かない
    if (type == 3)
      ret = min(ret, 0LL);
    else if (x1 == x2 && y1 == y2) {
      ret = min(ret, dfs(2, x1, y1, x2, y2));
    } else {
      ll tmp = check(type, x1, y1, x2, y2);
      ret = min(ret, dfs(0, x1, y1, x1, y1) + tmp);
    }
  }

  DBG(cout << "OUT " << type << ' ' << x1 << ' ' << y1 << ' ' << x2 << ' ' << y2
           << ' ' << ret << endl;)
  return dp[type][x1][y1][x2][y2] = ret;
}

int main() {

  cin >> n >> m;
  REP(i, n) {
    ll tmp;
    cin >> tmp;
    a.PB(tmp);
  }
  REP(i, m) {
    ll tmp;
    cin >> tmp;
    b.PB(tmp);
  }

  REP(i, 55) REP(j, 55) REP(k, 55) REP(l, 55) {
    dp[0][i][j][k][l] = LLINF;
    dp[2][i][j][k][l] = LLINF;
    dp[1][i][j][k][l] = LLINF;
    dp[3][i][j][k][l] = LLINF;
  }

  cout << dfs(0, 0, 0, 0, 0) << endl;

  return 0;
}


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

using namespace std;

#ifdef DEBUG_MODE
#define DBG(n) n;
#else
#define DBG(n) ;
#endif
#define REP(i, n) for (ll(i) = (0); (i) < (n); ++i)
#define rep(i, s, g) for (ll(i) = (s); (i) < (g); ++i)
#define rrep(i, s, g) for (ll(i) = (s); i >= (g); --(i))
#define PB push_back
#define MP make_pair
#define FI first
#define SE second
#define SHOW1d(v, n)                                                           \
  {                                                                            \
    for (int WWW = 0; WWW < (n); WWW++)                                        \
      cerr << v[WWW] << ' ';                                                   \
    cerr << endl << endl;                                                      \
  }
#define SHOW2d(v, i, j)                                                        \
  {                                                                            \
    for (int aaa = 0; aaa < i; aaa++) {                                        \
      for (int bbb = 0; bbb < j; bbb++)                                        \
        cerr << v[aaa][bbb] << ' ';                                            \
      cerr << endl;                                                            \
    }                                                                          \
    cerr << endl;                                                              \
  }
#define ALL(v) v.begin(), v.end()
#define Decimal fixed << setprecision(20)
#define INF 1000000000
#define LLINF 1000000000000000000LL
#define MOD 1000000007

typedef long long ll;
typedef pair<ll, ll> P;

ll dp[4][55][55][55][55];
ll n, m;
vector<ll> a;
vector<ll> b;

ll check(ll hoge, ll x1, ll y1, ll x2, ll y2) {
  ll ret = 0;
  for (ll i = x1 - 1; i >= x2; i--) {
    if (a[i] != -1)
      ret += a[i];
  }
  for (ll i = y1 - 1; i >= y2; i--) {
    if (b[i] != -1)
      ret -= b[i];
  }
  DBG(cout << "check " << hoge << ' ' << x1 << ' ' << y1 << ' ' << x2 << ' '
           << y2 << endl;
      cout << ret << endl;)
  return ret;
}

ll dfs(ll type, ll x1, ll y1, ll x2, ll y2) {
  DBG(cout << "IN " << type << ' ' << x1 << ' ' << y1 << ' ' << x2 << ' ' << y2
           << endl;)
  if (dp[type][x1][y1][x2][y2] != LLINF)
    return dp[type][x1][y1][x2][y2];
  ll ret;
  // A
  if (type % 2 == 0) {
    ret = -LLINF;
    // 置く
    if (x1 < n) {
      if (a[x1] == -1) {
        ret = max(ret, dfs(1, x1 + 1, y1, x2, y1));
      } else {
        ret = max(ret, dfs(1, x1 + 1, y1, x2, y2));
      }
    }
    // 置かない
    if (type == 2)
      ret = max(ret, 0LL);
    else if (x1 == x2 && y1 == y2) {
      ret = max(ret, dfs(3, x1, y1, x2, y2));
    } else {
      ll tmp = check(type, x1, y1, x2, y2);
      ret = max(ret, dfs(1, x1, y1, x1, y1) + tmp);
    }
  }
  // B
  else {
    ret = LLINF;
    // 置く
    if (y1 < m) {
      if (b[y1] == -1) {
        ret = min(ret, dfs(0, x1, y1 + 1, x1, y2));
      } else {
        ret = min(ret, dfs(0, x1, y1 + 1, x2, y2));
      }
    }
    // 置かない
    if (type == 3)
      ret = min(ret, 0LL);
    else if (x1 == x2 && y1 == y2) {
      ret = min(ret, dfs(2, x1, y1, x2, y2));
    } else {
      ll tmp = check(type, x1, y1, x2, y2);
      ret = min(ret, dfs(0, x1, y1, x1, y1) + tmp);
    }
  }

  DBG(cout << "OUT " << type << ' ' << x1 << ' ' << y1 << ' ' << x2 << ' ' << y2
           << ' ' << ret << endl;)
  return dp[type][x1][y1][x2][y2] = ret;
}

int main() {

  cin >> n >> m;
  REP(i, n) {
    ll tmp;
    cin >> tmp;
    a.PB(tmp);
  }
  REP(i, m) {
    ll tmp;
    cin >> tmp;
    b.PB(tmp);
  }

  REP(i, 55) REP(j, 55) REP(k, 55) REP(l, 55) {
    dp[0][i][j][k][l] = LLINF;
    dp[2][i][j][k][l] = LLINF;
    dp[1][i][j][k][l] = LLINF;
    dp[3][i][j][k][l] = LLINF;
  }

  cout << dfs(0, 0, 0, 0, 0) << endl;

  return 0;
}