Problem p02839 (C++)

Buggy submission (status: Runtime Error):
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Edge = pair<int, int>;
using Graph = vector<vector<Edge>>;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
const ll MOD = 1000000007;
const ll nmax = 8;
const ll INF = 1e9;
bool graph[nmax][nmax];
vector<vector<ll>> dist = vector<vector<ll>>(nmax, vector<ll>(nmax, INF));
void warshall_floyd(ll n) {
  for (size_t i = 0; i < n; i++) {
    for (size_t j = 0; j < n; j++) {
      for (size_t k = 0; k < n; k++) {
        dist[j][k] = min(dist[j][k], dist[j][i] + dist[i][k]);
      }
    }
  }
}

class UnionFind {
public:
  vector<ll> Parent;

  UnionFind(ll N) { Parent = vector<ll>(N, -1); }
  ll find(ll A) {
    if (Parent[A] < 0)
      return A;
    return Parent[A] = find(Parent[A]);
  }

  ll size(ll A) { return -Parent[find(A)]; }

  bool Union(ll A, ll B) {
    A = find(A);
    B = find(B);
    if (A == B) {
      return false;
    }
    if (size(A) < size(B))
      swap(A, B);

    Parent[A] += Parent[B];
    Parent[B] = A;

    return true;
  }
};

ll gcd(ll a, ll b) {
  if (b == 0)
    return a;
  return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
  ll g = gcd(a, b);
  return a / g * b;
}

ll mulMod(ll a, ll b) { return (((a % MOD) * (b % MOD)) % MOD); }

ll powMod(ll a, ll p) {
  if (p == 0) {
    return 1;
  } else if (p % 2 == 0) {
    ll half = powMod(a, p / 2);
    return mulMod(half, half);
  } else {
    return mulMod(powMod(a, p - 1), a);
  }
}

ll ceil(ll a, ll b) { return (a + b - 1) / b; }

void solve(long long H, long long W, std::vector<std::vector<long long>> A,
           std::vector<std::vector<long long>> B) {}

int main() {
  long long H;
  scanf("%lld", &H);
  long long W;
  scanf("%lld", &W);

  bool dp[H][W][H + W * 80 + 10];
  std::fill(dp[0][0], dp[H][0], false);
  std::vector<std::vector<long long>> sub(H, std::vector<long long>(W));

  for (int i = 0; i < H; i++) {
    for (int j = 0; j < W; j++) {
      ll tmp;
      cin >> tmp;
      sub[i][j] = tmp;
    }
  }
  for (int i = 0; i < H; i++) {
    for (int j = 0; j < W; j++) {
      ll tmp;
      cin >> tmp;
      sub[i][j] = abs(sub[i][j] - tmp);
    }
  }

  dp[0][0][sub[0][0]] = true;
  for (int i = 0; i < H; i++) {
    for (int j = 0; j < W; j++) {
      for (int k = 0; k < (H + W) * 80 + 1; k++) {
        if (dp[i][j][k]) {
          if (i != H - 1) {
            dp[i + 1][j][k + sub[i + 1][j]] = true;
            dp[i + 1][j][abs(k - sub[i + 1][j])] = true;
          }

          if (j != W - 1) {
            dp[i][j + 1][k + sub[i][j + 1]] = true;
            dp[i][j + 1][abs(k - sub[i][j + 1])] = true;
          }
        }
      }
    }
  }

  for (int k = 0; k < 12810; k++) {
    if (dp[H - 1][W - 1][k]) {
      cout << k << endl;
      break;
    }
  }

  return 0;
}


Fixed submission:
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Edge = pair<int, int>;
using Graph = vector<vector<Edge>>;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
const ll MOD = 1000000007;
const ll nmax = 8;
const ll INF = 1e9;
bool graph[nmax][nmax];
vector<vector<ll>> dist = vector<vector<ll>>(nmax, vector<ll>(nmax, INF));
void warshall_floyd(ll n) {
  for (size_t i = 0; i < n; i++) {
    for (size_t j = 0; j < n; j++) {
      for (size_t k = 0; k < n; k++) {
        dist[j][k] = min(dist[j][k], dist[j][i] + dist[i][k]);
      }
    }
  }
}

class UnionFind {
public:
  vector<ll> Parent;

  UnionFind(ll N) { Parent = vector<ll>(N, -1); }
  ll find(ll A) {
    if (Parent[A] < 0)
      return A;
    return Parent[A] = find(Parent[A]);
  }

  ll size(ll A) { return -Parent[find(A)]; }

  bool Union(ll A, ll B) {
    A = find(A);
    B = find(B);
    if (A == B) {
      return false;
    }
    if (size(A) < size(B))
      swap(A, B);

    Parent[A] += Parent[B];
    Parent[B] = A;

    return true;
  }
};

ll gcd(ll a, ll b) {
  if (b == 0)
    return a;
  return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
  ll g = gcd(a, b);
  return a / g * b;
}

ll mulMod(ll a, ll b) { return (((a % MOD) * (b % MOD)) % MOD); }

ll powMod(ll a, ll p) {
  if (p == 0) {
    return 1;
  } else if (p % 2 == 0) {
    ll half = powMod(a, p / 2);
    return mulMod(half, half);
  } else {
    return mulMod(powMod(a, p - 1), a);
  }
}

ll ceil(ll a, ll b) { return (a + b - 1) / b; }

void solve(long long H, long long W, std::vector<std::vector<long long>> A,
           std::vector<std::vector<long long>> B) {}

int main() {
  long long H;
  scanf("%lld", &H);
  long long W;
  scanf("%lld", &W);

  bool dp[80][80][(H + W) * 80 + 10];
  std::fill(dp[0][0], dp[H][0], false);
  std::vector<std::vector<long long>> sub(H, std::vector<long long>(W));

  for (int i = 0; i < H; i++) {
    for (int j = 0; j < W; j++) {
      ll tmp;
      cin >> tmp;
      sub[i][j] = tmp;
    }
  }
  for (int i = 0; i < H; i++) {
    for (int j = 0; j < W; j++) {
      ll tmp;
      cin >> tmp;
      sub[i][j] = abs(sub[i][j] - tmp);
    }
  }

  dp[0][0][sub[0][0]] = true;
  for (int i = 0; i < H; i++) {
    for (int j = 0; j < W; j++) {
      for (int k = 0; k < (H + W) * 80 + 1; k++) {
        if (dp[i][j][k]) {
          if (i != H - 1) {
            dp[i + 1][j][k + sub[i + 1][j]] = true;
            dp[i + 1][j][abs(k - sub[i + 1][j])] = true;
          }

          if (j != W - 1) {
            dp[i][j + 1][k + sub[i][j + 1]] = true;
            dp[i][j + 1][abs(k - sub[i][j + 1])] = true;
          }
        }
      }
    }
  }

  for (int k = 0; k < 12810; k++) {
    if (dp[H - 1][W - 1][k]) {
      cout << k << endl;
      break;
    }
  }

  return 0;
}