Problem p03451 (C++)

Buggy submission (status: Runtime Error):
/*
これを入れて実行
g++ code.cpp
./a.out
 */

#include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <utility>
#include <vector>

using namespace std;
typedef long long ll;
typedef long double ld;

int dy4[4] = {-1, 0, +1, 0};
int dx4[4] = {0, +1, 0, -1};
int dy8[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dx8[8] = {0, 1, 1, 1, 0, -1, -1, -1};

const long long INF = 1LL << 60;
const ll MOD = 1e9 + 7;

bool greaterSecond(const pair<int, int> &f, const pair<int, int> &s) {
  return f.second > s.second;
}

ll gcd(ll a, ll b) {
  if (b == 0)
    return a;
  return gcd(b, a % b);
}

ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }

ll nCr(ll n, ll r) {
  if (r == 0 || r == n) {
    return 1;
  } else if (r == 1) {
    return n;
  }
  return (nCr(n - 1, r) + nCr(n - 1, r - 1));
}

ll nPr(ll n, ll r) {
  r = n - r;
  ll ret = 1;
  for (ll i = n; i >= r + 1; i--)
    ret *= i;
  return ret;
}

//-----------------------ここから-----------
int n;
vector<vector<int>> a;
ll memo[3][100];
ll dp(int i, int j) {
  if (i == 0 && j == 0)
    return a[0][0];
  if (memo[i][j] != -1)
    return memo[i][j];

  ll res = 0;
  if (i - 1 >= 0) {
    res = max(res, dp(i - 1, j) + a[i][j]);
  }
  if (j - 1 >= 0) {
    res = max(res, dp(i, j - 1) + a[i][j]);
  }

  return memo[i][j] = res;
}

int main(void) {
  cin >> n;
  a.resize(2);
  for (int i = 0; i < 2; i++) {
    a[i].resize(n);
    for (int j = 0; j < n; j++) {
      cin >> a[i][j];
    }
  }

  for (int i = 0; i < 3; i++) {
    for (int j = 0; j <= n; j++) {
      memo[i][j] = -1;
    }
  }

  cout << dp(1, n - 1) << endl;
}

Fixed submission:
/*
これを入れて実行
g++ code.cpp
./a.out
 */

#include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <utility>
#include <vector>

using namespace std;
typedef long long ll;
typedef long double ld;

int dy4[4] = {-1, 0, +1, 0};
int dx4[4] = {0, +1, 0, -1};
int dy8[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dx8[8] = {0, 1, 1, 1, 0, -1, -1, -1};

const long long INF = 1LL << 60;
const ll MOD = 1e9 + 7;

bool greaterSecond(const pair<int, int> &f, const pair<int, int> &s) {
  return f.second > s.second;
}

ll gcd(ll a, ll b) {
  if (b == 0)
    return a;
  return gcd(b, a % b);
}

ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }

ll nCr(ll n, ll r) {
  if (r == 0 || r == n) {
    return 1;
  } else if (r == 1) {
    return n;
  }
  return (nCr(n - 1, r) + nCr(n - 1, r - 1));
}

ll nPr(ll n, ll r) {
  r = n - r;
  ll ret = 1;
  for (ll i = n; i >= r + 1; i--)
    ret *= i;
  return ret;
}

//-----------------------ここから-----------
int n;
vector<vector<int>> a;
ll memo[3][110];
ll dp(int i, int j) {
  if (i == 0 && j == 0)
    return a[0][0];
  if (memo[i][j] != -1)
    return memo[i][j];

  ll res = 0;
  if (i - 1 >= 0) {
    res = max(res, dp(i - 1, j) + a[i][j]);
  }
  if (j - 1 >= 0) {
    res = max(res, dp(i, j - 1) + a[i][j]);
  }

  return memo[i][j] = res;
}

int main(void) {
  cin >> n;
  a.resize(2);
  for (int i = 0; i < 2; i++) {
    a[i].resize(n);
    for (int j = 0; j < n; j++) {
      cin >> a[i][j];
    }
  }

  for (int i = 0; i < 3; i++) {
    for (int j = 0; j <= n; j++) {
      memo[i][j] = -1;
    }
  }

  cout << dp(1, n - 1) << endl;
}