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

#include <bits/stdc++.h>
using namespace std;

// エイリアス
using ll = long signed long;
using ull = long unsigned long;
using ld = long double;
using P = pair<int, int>;
using llP = pair<ll, ll>;
using DoP = pair<double, double>;

// 汎用マクロ
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define FOREACH(i, q) for (auto &i : q)
#define UNIQUE(v)                                                              \\
  do {                                                                         \\
    sort((v).begin(), (v).end());                                              \\
    (v).erase(unique((v).begin(), (v).end()), (v).end());                      \\
  } while (false)
#define SZ(x) ((int)(x).size())
template <class T> inline bool chmin(T &a, const T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T> inline bool chmax(T &a, const T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T> inline void line_out(const vector<T> vec) {
  int n = SZ(vec);
  rep(i, n) {
    cout << vec[i];
    if (i < n - 1)
      cout << " ";
  }
  cout << endl;
}
const int di[] = {0, 1, 0, -1, 1, 1, -1, -1};
const int dj[] = {1, 0, -1, 0, 1, -1, 1, -1};
const int INF = 1 << 28;
const ll INF64 = 1ll << 62;
const int mod = 1000000007;
// const int mod = 998244353;
struct mint {
  ll x; // typedef long long ll;
  mint(ll x = 0) : x((x % mod + mod) % mod) {}
  mint operator-() const { return mint(-x); }
  mint &operator+=(const mint a) {
    if ((x += a.x) >= mod)
      x -= mod;
    return *this;
  }
  mint &operator-=(const mint a) {
    if ((x += mod - a.x) >= mod)
      x -= mod;
    return *this;
  }
  mint &operator*=(const mint a) {
    (x *= a.x) %= mod;
    return *this;
  }
  mint operator+(const mint a) const {
    mint res(*this);
    return res += a;
  }
  mint operator-(const mint a) const {
    mint res(*this);
    return res -= a;
  }
  mint &operator++() {
    if ((x += 1) >= mod)
      x -= mod;
    return *this;
  }
  mint &operator--() {
    if ((x += mod - 1) >= mod)
      x -= mod;
    return *this;
  }
  mint operator*(const mint a) const {
    mint res(*this);
    return res *= a;
  }
  mint pow(ll t) const {
    if (!t)
      return 1;
    mint a = pow(t >> 1);
    a *= a;
    if (t & 1)
      a *= *this;
    return a;
  }

  // for prime mod
  mint inv() const { return pow(mod - 2); }
  mint &operator/=(const mint a) { return (*this) *= a.inv(); }
  mint operator/(const mint a) const {
    mint res(*this);
    return res /= a;
  }
};

int main() {
  int h, w, k;
  cin >> h >> w >> k;
  vector<vector<ll>> g(3005, vector<ll>(3005));
  rep(i, k) {
    int r, c;
    ll v;
    cin >> r >> c >> v;
    g[r][c] = v;
  }
  vector<vector<vector<ll>>> dp(3005,
                                vector<vector<ll>>(3005, vector<ll>(5, 0)));
  for (int i = 1; i <= h; ++i) {
    for (int j = 1; j <= w; ++j) {
      for (int c = 0; c <= 3; ++c) {
        chmax(dp[i][j][0], dp[i - 1][j][c]);
        if (g[i][j] > 0)
          chmax(dp[i][j][1], dp[i - 1][j][c] + g[i][j]);

        chmax(dp[i][j][c], dp[i][j - 1][c]);
        if (g[i][j] > 0)
          chmax(dp[i][j][c + 1], dp[i][j - 1][c] + g[i][j]);
      }
    }
  }
  ll ans = 0;
  for (int c = 0; c <= 3; ++c)
    chmax(ans, dp[h][w][c]);
  cout << ans << endl;
}


Error: 0

Fixed submission:

#include <bits/stdc++.h>
using namespace std;

// エイリアス
using ll = long signed long;
using ull = long unsigned long;
using ld = long double;
using P = pair<int, int>;
using llP = pair<ll, ll>;
using DoP = pair<double, double>;

// 汎用マクロ
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define FOREACH(i, q) for (auto &i : q)
#define UNIQUE(v)                                                              \\
  do {                                                                         \\
    sort((v).begin(), (v).end());                                              \\
    (v).erase(unique((v).begin(), (v).end()), (v).end());                      \\
  } while (false)
#define SZ(x) ((int)(x).size())
template <class T> inline bool chmin(T &a, const T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T> inline bool chmax(T &a, const T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T> inline void line_out(const vector<T> vec) {
  int n = SZ(vec);
  rep(i, n) {
    cout << vec[i];
    if (i < n - 1)
      cout << " ";
  }
  cout << endl;
}
const int di[] = {0, 1, 0, -1, 1, 1, -1, -1};
const int dj[] = {1, 0, -1, 0, 1, -1, 1, -1};
const int INF = 1 << 28;
const ll INF64 = 1ll << 62;
const int mod = 1000000007;
// const int mod = 998244353;
struct mint {
  ll x; // typedef long long ll;
  mint(ll x = 0) : x((x % mod + mod) % mod) {}
  mint operator-() const { return mint(-x); }
  mint &operator+=(const mint a) {
    if ((x += a.x) >= mod)
      x -= mod;
    return *this;
  }
  mint &operator-=(const mint a) {
    if ((x += mod - a.x) >= mod)
      x -= mod;
    return *this;
  }
  mint &operator*=(const mint a) {
    (x *= a.x) %= mod;
    return *this;
  }
  mint operator+(const mint a) const {
    mint res(*this);
    return res += a;
  }
  mint operator-(const mint a) const {
    mint res(*this);
    return res -= a;
  }
  mint &operator++() {
    if ((x += 1) >= mod)
      x -= mod;
    return *this;
  }
  mint &operator--() {
    if ((x += mod - 1) >= mod)
      x -= mod;
    return *this;
  }
  mint operator*(const mint a) const {
    mint res(*this);
    return res *= a;
  }
  mint pow(ll t) const {
    if (!t)
      return 1;
    mint a = pow(t >> 1);
    a *= a;
    if (t & 1)
      a *= *this;
    return a;
  }

  // for prime mod
  mint inv() const { return pow(mod - 2); }
  mint &operator/=(const mint a) { return (*this) *= a.inv(); }
  mint operator/(const mint a) const {
    mint res(*this);
    return res /= a;
  }
};

int main() {
  int h, w, k;
  cin >> h >> w >> k;
  vector<vector<ll>> g(h + 1, vector<ll>(w + 1));
  rep(i, k) {
    int r, c;
    ll v;
    cin >> r >> c >> v;
    g[r][c] = v;
  }

  ll dp[h + 2][w + 2][6];
  rep(i, h + 1) rep(j, w + 1) rep(c, 6) dp[i][j][c] = 0;

  for (int i = 1; i <= h; ++i) {
    for (int j = 1; j <= w; ++j) {
      for (int c = 0; c <= 3; ++c) {
        chmax(dp[i][j][0], dp[i - 1][j][c]); // 上遷移
        if (g[i][j] > 0)
          chmax(dp[i][j][1], dp[i - 1][j][c] + g[i][j]);

        chmax(dp[i][j][c], dp[i][j - 1][c]); // 右遷移
        if (g[i][j] > 0)
          chmax(dp[i][j][c + 1], dp[i][j - 1][c] + g[i][j]);
      }
    }
  }
  ll ans = 0;
  for (int c = 0; c <= 3; ++c)
    chmax(ans, dp[h][w][c]);
  cout << ans << endl;
}