Problem p02839 (C++)

Buggy submission (status: Runtime Error):
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define dbg(...)                                                               \
  do {                                                                         \
    cerr << __LINE__ << ": ";                                                  \
    dbgprint(#__VA_ARGS__, __VA_ARGS__);                                       \
  } while (0);

using namespace std;

namespace std {
template <class S, class T> struct hash<pair<S, T>> {
  size_t operator()(const pair<S, T> &p) const {
    return ((size_t)1e9 + 7) * hash<S>()(p.first) + hash<T>()(p.second);
  }
};
template <class T> struct hash<vector<T>> {
  size_t operator()(const vector<T> &v) const {
    size_t h = 0;
    for (auto i : v)
      h = h * ((size_t)1e9 + 7) + hash<T>()(i) + 1;
    return h;
  }
};
} // namespace std
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
  os << "[ ";
  rep(i, v.size()) os << v[i] << (i == v.size() - 1 ? " ]" : ", ");
  return os;
}
template <class T> ostream &operator<<(ostream &os, const set<T> &v) {
  os << "{ ";
  for (const auto &i : v)
    os << i << ", ";
  return os << "}";
}
template <class T, class U>
ostream &operator<<(ostream &os, const map<T, U> &v) {
  os << "{";
  for (const auto &i : v)
    os << " " << i.first << ": " << i.second << ",";
  return os << "}";
}
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
  return os << "(" << p.first << ", " << p.second << ")";
}
void dbgprint(const string &fmt) { cerr << endl; }
template <class H, class... T>
void dbgprint(const string &fmt, const H &h, const T &...r) {
  cerr << fmt.substr(0, fmt.find(",")) << "= " << h << " ";
  dbgprint(fmt.substr(fmt.find(",") + 1), r...);
}
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
const int inf = (int)1e9;
const double INF = 1e12, EPS = 1e-9;

int main() {
  cin.tie(0);
  cin.sync_with_stdio(0);
  int h, w;
  cin >> h >> w;
  vector<vi> d(h, vi(w));
  rep(it, 2) rep(i, h) rep(j, w) {
    d[i][j] *= -1;
    int x;
    cin >> x;
    d[i][j] += x;
  }

  const int MX = 13000;
  const int GETA = MX / 2;
  vector<vector<bitset<MX>>> dp(h, vector<bitset<MX>>(w));
  dp[0][0][d[0][0] + GETA] = 1;
  dp[0][0][-d[0][0] + GETA] = 1;

  rep(i, h) rep(j, w)
      rep(k, MX) if (dp[i][j][k]) for (int s = -1; s < 2; s += 2) {
    if (i + 1 < h)
      dp[i + 1][j][k + s * d[i + 1][j]] = 1;
    if (j + 1 < w)
      dp[i][j + 1][k + s * d[i][j + 1]] = 1;
  }
  int ans = inf;
  rep(i, MX) if (dp[h - 1][w - 1][i]) ans = min(ans, abs(i - GETA));
  cout << ans << endl;

  return 0;
}

Fixed submission:
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define dbg(...)                                                               \
  do {                                                                         \
    cerr << __LINE__ << ": ";                                                  \
    dbgprint(#__VA_ARGS__, __VA_ARGS__);                                       \
  } while (0);

using namespace std;

namespace std {
template <class S, class T> struct hash<pair<S, T>> {
  size_t operator()(const pair<S, T> &p) const {
    return ((size_t)1e9 + 7) * hash<S>()(p.first) + hash<T>()(p.second);
  }
};
template <class T> struct hash<vector<T>> {
  size_t operator()(const vector<T> &v) const {
    size_t h = 0;
    for (auto i : v)
      h = h * ((size_t)1e9 + 7) + hash<T>()(i) + 1;
    return h;
  }
};
} // namespace std
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
  os << "[ ";
  rep(i, v.size()) os << v[i] << (i == v.size() - 1 ? " ]" : ", ");
  return os;
}
template <class T> ostream &operator<<(ostream &os, const set<T> &v) {
  os << "{ ";
  for (const auto &i : v)
    os << i << ", ";
  return os << "}";
}
template <class T, class U>
ostream &operator<<(ostream &os, const map<T, U> &v) {
  os << "{";
  for (const auto &i : v)
    os << " " << i.first << ": " << i.second << ",";
  return os << "}";
}
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
  return os << "(" << p.first << ", " << p.second << ")";
}
void dbgprint(const string &fmt) { cerr << endl; }
template <class H, class... T>
void dbgprint(const string &fmt, const H &h, const T &...r) {
  cerr << fmt.substr(0, fmt.find(",")) << "= " << h << " ";
  dbgprint(fmt.substr(fmt.find(",") + 1), r...);
}
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
const int inf = (int)1e9;
const double INF = 1e12, EPS = 1e-9;

int main() {
  cin.tie(0);
  cin.sync_with_stdio(0);
  int h, w;
  cin >> h >> w;
  vector<vi> d(h, vi(w));
  rep(it, 2) rep(i, h) rep(j, w) {
    d[i][j] *= -1;
    int x;
    cin >> x;
    d[i][j] += x;
  }

  const int MX = 26000;
  const int GETA = MX / 2;
  vector<vector<bitset<MX>>> dp(h, vector<bitset<MX>>(w));
  dp[0][0][d[0][0] + GETA] = 1;
  dp[0][0][-d[0][0] + GETA] = 1;

  rep(i, h) rep(j, w)
      rep(k, MX) if (dp[i][j][k]) for (int s = -1; s < 2; s += 2) {
    if (i + 1 < h)
      dp[i + 1][j][k + s * d[i + 1][j]] = 1;
    if (j + 1 < w)
      dp[i][j + 1][k + s * d[i][j + 1]] = 1;
  }
  int ans = inf;
  rep(i, MX) if (dp[h - 1][w - 1][i]) ans = min(ans, abs(i - GETA));
  cout << ans << endl;

  return 0;
}