Problem p02586 (C++)

Buggy submission (status: Runtime Error):
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <utility>
#include <vector>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = ll(a); i < ll(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define rrep(i, a) for (ll i = ll(a - 1); i >= 0; --i)
#define all(x) (x).begin(), (x).end()
#define PRINT(V) cout << V << "\n"
#define SORT(V) sort((V).begin(), (V).end())
#define RSORT(V) sort((V).rbegin(), (V).rend())
using namespace std;
using ll = long long;
template <class T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
inline void Yes(bool condition) {
  if (condition)
    PRINT("Yes");
  else
    PRINT("No");
}
template <class itr> void cins(itr first, itr last) {
  for (auto i = first; i != last; i++) {
    cin >> (*i);
  }
}
template <class itr> void array_output(itr start, itr goal) {
  string ans = "", k = " ";
  for (auto i = start; i != goal; i++)
    ans += to_string(*i) + k;
  if (!ans.empty())
    ans.pop_back();
  PRINT(ans);
}
ll gcd(ll a, ll b) { return a ? gcd(b % a, a) : b; }

const ll INF = 1e15;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
const ll EPS = 1e-10;
int sgn(const double a) { return (a < -EPS ? -1 : (a > EPS ? +1 : 0)); }
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> tri;
typedef pair<double, double> point;
typedef complex<double> Point;
const ll MAX = 30000;
constexpr ll nx[8] = {1, 0, -1, 0, 1, -1, 1, -1};
constexpr ll ny[8] = {0, 1, 0, -1, 1, 1, -1, -1};

ll dp[3005][3005][4] = {0};
ll it[3005][3005] = {0};

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  ll r, c, k;
  cin >> r >> c >> k;
  rep(i, k) {
    ll rr, cc, v;
    cin >> rr >> cc >> v;
    it[rr][cc] = v;
  }
  rep(i, r + 1) {
    rep(j, c + 1) {
      rep(s, 4) {
        if (i < r && it[i + 1][j]) {
          chmax(dp[i + 1][j][1], dp[i][j][s] + it[i + 1][j]);
        }
        chmax(dp[i + 1][j][0], dp[i][j][k]);
        if (j < c && s < 3 && it[i][j + 1]) {
          chmax(dp[i][j + 1][s + 1], dp[i][j][s] + it[i][j + 1]);
        }
        chmax(dp[i][j + 1][s], dp[i][j][s]);
      }
    }
  }
  ll ans = 0;
  rep(i, 4) {
    chmax(ans, dp[r + 1][c][i]);
    chmax(ans, dp[r][c + 1][i]);
  }
  PRINT(ans);
}


Fixed submission:
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <utility>
#include <vector>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = ll(a); i < ll(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define rrep(i, a) for (ll i = ll(a - 1); i >= 0; --i)
#define all(x) (x).begin(), (x).end()
#define PRINT(V) cout << V << "\n"
#define SORT(V) sort((V).begin(), (V).end())
#define RSORT(V) sort((V).rbegin(), (V).rend())
using namespace std;
using ll = long long;
template <class T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
inline void Yes(bool condition) {
  if (condition)
    PRINT("Yes");
  else
    PRINT("No");
}
template <class itr> void cins(itr first, itr last) {
  for (auto i = first; i != last; i++) {
    cin >> (*i);
  }
}
template <class itr> void array_output(itr start, itr goal) {
  string ans = "", k = " ";
  for (auto i = start; i != goal; i++)
    ans += to_string(*i) + k;
  if (!ans.empty())
    ans.pop_back();
  PRINT(ans);
}
ll gcd(ll a, ll b) { return a ? gcd(b % a, a) : b; }

const ll INF = 1e15;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
const ll EPS = 1e-10;
int sgn(const double a) { return (a < -EPS ? -1 : (a > EPS ? +1 : 0)); }
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> tri;
typedef pair<double, double> point;
typedef complex<double> Point;
const ll MAX = 30000;
constexpr ll nx[8] = {1, 0, -1, 0, 1, -1, 1, -1};
constexpr ll ny[8] = {0, 1, 0, -1, 1, 1, -1, -1};

ll dp[3005][3005][4] = {0};
ll it[3005][3005] = {0};

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  ll r, c, k;
  cin >> r >> c >> k;
  rep(i, k) {
    ll rr, cc, v;
    cin >> rr >> cc >> v;
    it[rr][cc] = v;
  }
  rep(i, r + 1) {
    rep(j, c + 1) {
      rep(s, 4) {
        if (i < r && it[i + 1][j]) {
          chmax(dp[i + 1][j][1], dp[i][j][s] + it[i + 1][j]);
        }
        chmax(dp[i + 1][j][0], dp[i][j][s]);
        if (j < c && s < 3 && it[i][j + 1]) {
          chmax(dp[i][j + 1][s + 1], dp[i][j][s] + it[i][j + 1]);
        }
        chmax(dp[i][j + 1][s], dp[i][j][s]);
      }
    }
  }
  ll ans = 0;
  rep(i, 4) {
    chmax(ans, dp[r + 1][c][i]);
    chmax(ans, dp[r][c + 1][i]);
  }
  PRINT(ans);
}