Problem p02586 (C++) — buggy submission, verdict: Runtime Error

#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}

long long v[3100][3100], dp[3100][3100][5];
int main() {
  int R, C, K;
  cin >> R >> C >> K;
  memset(v, 0, sizeof(v));
  for (int i = 0; i < K; ++i) {
    long long r, c, t;
    cin >> r >> c >> t;
    v[r][c] = t;
  }
  memset(dp, 0, sizeof(dp));
  for (int i = 0; i <= R; ++i) {
    for (int j = 0; j <= C; ++j) {
      for (int k = 0; k <= 3; ++k) {
        // 上へ行く
        if (i - 1 >= 0) {
          chmax(dp[i][j][0], dp[i - 1][j][k]);
          chmax(dp[i][j][1], dp[i - 1][j][k] + v[i][j]);
        }

        // 右へ行く
        if (j - 1 >= 0) {
          chmax(dp[i][j][k], dp[i][j - 1][k]);
          if (k - 1 >= 0)
            chmax(dp[i][j][k], dp[i][j - 1][k - 1] + v[i][j]);
        }
      }
    }
  }
  long long res = 0;
  for (int k = 0; k <= 3; ++k)
    chmax(res, dp[R][C][k]);
  cout << res << endl;
}

Error: -11

Fixed submission:

#include <bits/stdc++.h>
#define int int64_t
#define REP(i, n) for (int i = 0; (i) < (int)(n); ++(i))
#define REP3(i, m, n) for (int i = (m); (i) < (int)(n); ++(i))
#define REP_R(i, n) for (int i = (int)(n)-1; (i) >= 0; --(i))
#define REP3R(i, m, n) for (int i = (int)(n)-1; (i) >= (int)(m); --(i))
#define REPP(i, n) for (int i = 1; (i) < (int)(n + 1); ++(i))
#define REPR(i, n) for (int i = (int)(n)-1; (i) >= 0; --(i))
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = (m)-1; i >= (n); i--)
#define ALL(v) v.begin(), v.end()
#define SZ(a) int((a).size())
#define SORT(c) sort((c).begin(), (c).end())
#define SORTR(c) sort((c).begin(), (c).end(), greater<int>());
#define BIT(n) (1LL << (n))
#define PCNT(x) __builtin_popcountll(x)
#define GCD(x, y) __gcd(x, y)
#define LCM(x, y) x / __gcd(x, y) * y
#define PB push_back
#define MP make_pair
#define endl "\\n"
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
using namespace std;
using Graph = vector<vector<int>>;
using WeightedGraph = vector<vector<pair<int, int>>>;
typedef long double LD;
typedef vector<int> VI;
typedef vector<vector<int>> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
const int INF = 2000000000;
const long double PI = acosl(-1);
const int MOD = 1000000007;
void print() { cout << endl; }
template <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {
  cout << head;
  if (sizeof...(tail) != 0)
    cout << " ";
  print(forward<Tail>(tail)...);
}
template <class T> void print(vector<T> &vec) {
  for (auto &a : vec) {
    cout << a;
    if (&a != &vec.back())
      cout << " ";
  }
  cout << endl;
}
template <class T> void print(vector<vector<T>> &df) {
  for (auto &vec : df) {
    print(vec);
  }
}
template <class T> inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}

signed main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  cout << fixed << setprecision(10);
  int ans = 0;

  int R, C, K;
  cin >> R >> C >> K;
  long long v[3100][3100], dp[3100][3100][5];
  memset(v, 0, sizeof(v));
  for (int i = 0; i < K; ++i) {
    long long r, c, t;
    cin >> r >> c >> t;
    v[r][c] = t;
  }
  memset(dp, 0, sizeof(dp));
  for (int i = 0; i <= R; ++i) {
    for (int j = 0; j <= C; ++j) {
      for (int k = 0; k <= 3; ++k) {
        // 上へ行く
        if (i - 1 >= 0) {
          chmax(dp[i][j][0], dp[i - 1][j][k]);
          chmax(dp[i][j][1], dp[i - 1][j][k] + v[i][j]);
        }

        // 右へ行く
        if (j - 1 >= 0) {
          chmax(dp[i][j][k], dp[i][j - 1][k]);
          if (k - 1 >= 0)
            chmax(dp[i][j][k], dp[i][j - 1][k - 1] + v[i][j]);
        }
      }
    }
  }
  long long res = 0;
  for (int k = 0; k <= 3; ++k)
    chmax(res, dp[R][C][k]);
  cout << res << endl;
}
/*
cd ~/Desktop/Programming/AtCoder/contest/abc175/abc175_e && sh
shellscripts/test_cpp.sh cd
~/Desktop/Programming/AtCoder/contest/abc175/abc175_e && sh
shellscripts/etest_cpp.sh cd
~/Desktop/Programming/AtCoder/contest/abc175/abc175_e && sh
shellscripts/submit_cpp.sh
*/