Language: C++

#include <iostream>
#include <iomanip>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <stack>
#include <queue>
#include <bitset>
#include <numeric>
#include <cassert>
#ifdef DEBUG
#include "./Lib/debug.hpp"
#include "./Lib/Timer.hpp"
#include "./Lib/sample.hpp"
#else
#define dump(...)
template<class T>inline auto d_val(T a, T b) { return a; }
#endif

/* (=＾o＾=) */
#define int ll

/* macro */
#define FOR(i, b, e) for(ll i = (ll)(b); i < (ll)(e); ++i)
#define RFOR(i, b, e) for(ll i = (ll)(e-1); i >= (ll)(b); --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define REPC(x,c) for(const auto& x:(c))
#define REPI2(it,b,e) for(auto it = (b); it != (e); ++it)
#define REPI(it,c) REPI2(it, (c).begin(), (c).end())
#define RREPI(it,c) REPI2(it, (c).rbegin(), (c).rend())
#define REPI_ERACE2(it, b, e) for(auto it = (b); it != (e);)
#define REPI_ERACE(it, c) REPI_ERACE2(it, (c).begin(), (c).end())
#define ALL(x) (x).begin(),(x).end()
#define cauto const auto&
/* macro func */
template<class T>
inline auto sort(T& t) { std::sort(ALL(t)); }
template<class T>
inline auto rsort(T& t) { std::sort((t).rbegin(), (t).rend()); }
template<class T>
inline auto unique(T& t) { (t).erase(unique((t).begin(), (t).end()), (t).end()); }
template<class T, class S>
inline auto chmax(T& t, const S& s) { if (s > t) { t = s; return true; } return false; }
template<class T, class S>
inline auto chmaxE(T& t, const S& s) { if (s >= t) { t = s; return true; } return false; }
template<class T, class S>
inline auto chmin(T& t, const S& s) { if (s < t) { t = s; return true; } return false; }
inline auto BR() { std::cout << "\n"; }

/* type define */
using ll = long long;
using PAIR = std::pair<ll, ll>;
using VS = std::vector<std::string>;
using VL = std::vector<long long>;
using VVL = std::vector<VL>;
using VVVL = std::vector<VVL>;
using VD = std::vector<double>;
template<class T>
using V = std::vector<T>;

/* using std */
using std::cout;
constexpr char endl = '\n';
using std::cin;
using std::pair;
using std::string;
using std::stack;
using std::queue;
using std::vector;
using std::list;
using std::map;
using std::unordered_map;
using std::multimap;
using std::unordered_multimap;
using std::set;
using std::unordered_set;
using std::unordered_multiset;
using std::multiset;
using std::bitset;
using std::priority_queue;

/* constant value */
constexpr ll MOD = 1000000007;
//constexpr ll MOD = 998244353;

/* Initial processing  */
struct Preprocessing { Preprocessing() { std::cin.tie(0); std::ios::sync_with_stdio(0); }; }_Preprocessing;

/* Remove the source of the bug */
inline signed pow(signed, signed) { assert(false); return -1; }

/* define hash */
namespace std { template <>	class hash<std::pair<ll, ll>> { public:	size_t operator()(const std::pair<ll, ll>& x) const { return hash<ll>()(1000000000 * x.first + x.second); } }; }

/* input */
template<class T> std::istream& operator >> (std::istream& is, vector<T>& vec) { for (T& x : vec) is >> x; return is; }

//=============================================================================================


signed main() {
	ll h, w;
	cin >> h >> w;
	VVL red, brue; red.reserve(h); brue.reserve(h);
	REP(i, h) { VL tmp(w); cin >> tmp; red.emplace_back(tmp); }
	REP(i, h) { VL tmp(w); cin >> tmp; brue.emplace_back(tmp); }

	constexpr ll mx = d_val((80 + 80) * 80 + 1, 11);

	V<V<bitset<2 * mx>>> dp(h, V<bitset<2 * mx>>(w));
	dp[0][0][std::abs(red[0][0] - brue[0][0]) + mx] = true;
	dump(dp[0][0]);
	REP(i, h)REP(j, w) if (i > 0 || j > 0) {
		ll val = std::abs(red[i][j] - brue[i][j]);
		if (i - 1 >= 0) {
			dp[i][j] |= (dp[i - 1][j] >> val);
			dp[i][j] |= (dp[i - 1][j] << val);
		}
		if (j - 1 >= 0) {
			dp[i][j] |= (dp[i][j - 1] >> val);
			dp[i][j] |= (dp[i][j - 1] << val);
		}
	}
	ll ans = 1e10;
	REP(i, 2*mx) if (dp[h - 1][w - 1][i]) {
		chmin(ans, std::abs(mx - i));
	}
	cout << ans << endl;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:115:32: error: call to non-'constexpr' function 'auto d_val(T, T) [with T = int]'
  115 |         constexpr ll mx = d_val((80 + 80) * 80 + 1, 11);
      |                           ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
a.cc:23:30: note: 'auto d_val(T, T) [with T = int]' declared here
   23 | template<class T>inline auto d_val(T a, T b) { return a; }
      |                              ^~~~~
a.cc:117:26: error: template argument 1 is invalid
  117 |         V<V<bitset<2 * mx>>> dp(h, V<bitset<2 * mx>>(w));
      |                          ^~
a.cc:117:28: error: template argument 1 is invalid
  117 |         V<V<bitset<2 * mx>>> dp(h, V<bitset<2 * mx>>(w));
      |                            ^
a.cc:117:51: error: template argument 1 is invalid
  117 |         V<V<bitset<2 * mx>>> dp(h, V<bitset<2 * mx>>(w));
      |                                                   ^~
a.cc:117:56: error: expression list treated as compound expression in initializer [-fpermissive]
  117 |         V<V<bitset<2 * mx>>> dp(h, V<bitset<2 * mx>>(w));
      |                                                        ^
a.cc:118:11: error: invalid types 'int[int]' for array subscript
  118 |         dp[0][0][std::abs(red[0][0] - brue[0][0]) + mx] = true;
      |           ^
a.cc:123:27: error: invalid types 'int[ll {aka long long int}]' for array subscript
  123 |                         dp[i][j] |= (dp[i - 1][j] >> val);
      |                           ^
a.cc:123:40: error: invalid types 'int[ll {aka long long int}]' for array subscript
  123 |                         dp[i][j] |= (dp[i - 1][j] >> val);
      |                                        ^
a.cc:124:27: error: invalid types 'int[ll {aka long long int}]' for array subscript
  124 |                         dp[i][j] |= (dp[i - 1][j] << val);
      |                           ^
a.cc:124:40: error: invalid types 'int[ll {aka long long int}]' for array subscript
  124 |                         dp[i][j] |= (dp[i - 1][j] << val);
      |                                        ^
a.cc:127:27: error: invalid types 'int[ll {aka long long int}]' for array subscript
  127 |                         dp[i][j] |= (dp[i][j - 1] >> val);
      |                           ^
a.cc:127:40: error: invalid types 'int[ll {aka long long int}]' for array subscript
  127 |                         dp[i][j] |= (dp[i][j - 1] >> val);
      |                                        ^
a.cc:128:27: error: invalid types 'int[ll {aka long long int}]' for array subscript
  128 |                         dp[i][j] |= (dp[i][j - 1] << val);
      |                           ^
a.cc:128:40: error: invalid types 'int[ll {aka long long int}]' for array subscript
  128 |                         dp[i][j] |= (dp[i][j - 1] << val);
      |                                        ^
a.cc:132:28: error: invalid types 'int[ll {aka long long int}]' for array subscript
  132 |         REP(i, 2*mx) if (dp[h - 1][w - 1][i]) {
      |                            ^