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

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = n; i > -1; --i)
#define ALL(a) (a).begin(), (a).end()
#define FILL(a, n, x)                                                          \\
  ;                                                                            \\
  REP(i, (n)) { (a)[i] = (x); }
#define CINA(a, n)                                                             \\
  ;                                                                            \\
  REP(i, (n)) { cin >> (a)[i]; }
#define FILL2(a, n, m, x)                                                      \\
  ;                                                                            \\
  REP(i, (n)) {                                                                \\
    REP(j, (m)) { (a)[i][j] = (x); }                                           \\
  }
#define CINA2(a, n, m)                                                         \\
  ;                                                                            \\
  REP(i, (n)) {                                                                \\
    REP(j, (m)) { cin >> (a)[i][j]; }                                          \\
  }
#define Liny "Yes\\n"
#define Linn "No\\n"
#define LINY "YES\\n"
#define LINN "NO\\n"

// cout << setfill('0') << right << setw(4) << 12; // "0012"
int keta(ll x) {
  if (x < 10) {
    return 1;
  } else {
    return keta(x / 10) + 1;
  }
}
int keta_wa(ll x) {
  if (x < 10) {
    return x;
  } else {
    return keta_wa(x / 10) + x % 10;
  }
}
int ctoi(char c) { return ((c >= '0' && c <= '9') ? c - '0' : 0); }
int __stoi(string s) { return atoi(s.c_str()); }
ll sum(ll a[], ll N) { return accumulate(a, a + N, 0LL); }
ll gcd(ll a, ll b) {
  if (a < b)
    swap(a, b);
  return b ? gcd(b, a % b) : a;
}
ll lcm(ll a, ll b) {
  if (a < b) {
    swap(a, b);
  }
  return a / gcd(a, b) * b;
}
template <class T> void chmax(T &a, T b) {
  if (a < b) {
    a = b;
  }
}
template <class T> void chmin(T &a, T b) {
  if (a > b) {
    a = b;
  }
}
template <class T> bool isIn(T a, vector<T> v) {
  for (T x : v) {
    if (a == x) {
      return true;
    }
  }
  return false;
}
string strReplace(string s, string target, string replacement) {
  if (!target.empty()) {
    std::string::size_type pos = 0;
    while ((pos = s.find(target, pos)) != std::string::npos) {
      s.replace(pos, target.length(), replacement);
      pos += replacement.length();
    }
  }
  return s;
}
const ll MOD = 1e9 + 7;
#define pii pair<int, int>
#define pll pair<ll, ll>
#define MP make_pair

bool DEBUG = 0;
template <class T> void dprint(T s) {
  if (DEBUG) {
    cout << s << "\\n";
  }
}

ll board[3005][3005];
ll dp[3005][3005][4];

int main(int argc, char *argv[]) {
  if (argc > 1 && argv[1][0] == 'D') {
    DEBUG = 1;
  }

  int R, C, K;
  cin >> R >> C >> K;
  FILL2(board, R, C, 0LL);
  REP(i, K) {
    ll r, c, v;
    cin >> r >> c >> v;
    --r;
    --c;
    board[r][c] = v;
  }
  if (DEBUG) {
    REP(i, R) {
      REP(j, C) { cout << board[i][j] << " "; }
      cout << endl;
    }
  }

  REP(i, R) {
    REP(j, C) {
      REP(k, 4) { dp[i][j][k] = 0LL; }
    }
  }

  REP(i, R) {
    REP(j, C) {
      for (int k = 2; k >= 0; --k) {
        chmax(dp[i][j][k + 1], dp[i][j][k] + board[i][j]);
      }
      REP(k, 4) {
        chmax(dp[i + 1][j][0], dp[i][j][k]);
        chmax(dp[i][j + 1][k], dp[i][j][k]);
      }
    }
  }
  ll ans = dp[R - 1][C - 1][0];
  REP(k, 4) { chmax(ans, dp[R - 1][C - 1][k]); }
  cout << ans << "\\n";
}

Error: 0

Fixed submission:

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = n; i > -1; --i)
#define ALL(a) (a).begin(), (a).end()
#define FILL(a, n, x)                                                          \\
  ;                                                                            \\
  REP(i, (n)) { (a)[i] = (x); }
#define CINA(a, n)                                                             \\
  ;                                                                            \\
  REP(i, (n)) { cin >> (a)[i]; }
#define FILL2(a, n, m, x)                                                      \\
  ;                                                                            \\
  REP(i, (n)) {                                                                \\
    REP(j, (m)) { (a)[i][j] = (x); }                                           \\
  }
#define CINA2(a, n, m)                                                         \\
  ;                                                                            \\
  REP(i, (n)) {                                                                \\
    REP(j, (m)) { cin >> (a)[i][j]; }                                          \\
  }
#define Liny "Yes\\n"
#define Linn "No\\n"
#define LINY "YES\\n"
#define LINN "NO\\n"

// cout << setfill('0') << right << setw(4) << 12; // "0012"
int keta(ll x) {
  if (x < 10) {
    return 1;
  } else {
    return keta(x / 10) + 1;
  }
}
int keta_wa(ll x) {
  if (x < 10) {
    return x;
  } else {
    return keta_wa(x / 10) + x % 10;
  }
}
int ctoi(char c) { return ((c >= '0' && c <= '9') ? c - '0' : 0); }
int __stoi(string s) { return atoi(s.c_str()); }
ll sum(ll a[], ll N) { return accumulate(a, a + N, 0LL); }
ll gcd(ll a, ll b) {
  if (a < b)
    swap(a, b);
  return b ? gcd(b, a % b) : a;
}
ll lcm(ll a, ll b) {
  if (a < b) {
    swap(a, b);
  }
  return a / gcd(a, b) * b;
}
template <class T> void chmax(T &a, T b) {
  if (a < b) {
    a = b;
  }
}
template <class T> void chmin(T &a, T b) {
  if (a > b) {
    a = b;
  }
}
template <class T> bool isIn(T a, vector<T> v) {
  for (T x : v) {
    if (a == x) {
      return true;
    }
  }
  return false;
}
string strReplace(string s, string target, string replacement) {
  if (!target.empty()) {
    std::string::size_type pos = 0;
    while ((pos = s.find(target, pos)) != std::string::npos) {
      s.replace(pos, target.length(), replacement);
      pos += replacement.length();
    }
  }
  return s;
}
const ll MOD = 1e9 + 7;
#define pii pair<int, int>
#define pll pair<ll, ll>
#define MP make_pair

bool DEBUG = 0;
template <class T> void dprint(T s) {
  if (DEBUG) {
    cout << s << "\\n";
  }
}

int main(int argc, char *argv[]) {
  if (argc > 1 && argv[1][0] == 'D') {
    DEBUG = 1;
  }

  int R, C, K;
  cin >> R >> C >> K;
  ll board[R][C];
  FILL2(board, R, C, 0LL);
  REP(i, K) {
    ll r, c, v;
    cin >> r >> c >> v;
    --r;
    --c;
    board[r][c] = v;
  }
  if (DEBUG) {
    REP(i, R) {
      REP(j, C) { cout << board[i][j] << " "; }
      cout << endl;
    }
  }

  ll dp[R + 1][C + 1][4];
  REP(i, R) {
    REP(j, C) {
      REP(k, 4) { dp[i][j][k] = 0LL; }
    }
  }

  REP(i, R) {
    REP(j, C) {
      for (int k = 2; k >= 0; --k) {
        chmax(dp[i][j][k + 1], dp[i][j][k] + board[i][j]);
      }
      REP(k, 4) {
        chmax(dp[i + 1][j][0], dp[i][j][k]);
        chmax(dp[i][j + 1][k], dp[i][j][k]);
      }
    }
  }
  ll ans = dp[R - 1][C - 1][0];
  REP(k, 4) {
    dprint(dp[R - 1][C - 1][k]);
    chmax(ans, dp[R - 1][C - 1][k]);
  }
  cout << ans << "\\n";
}