Language: C++

#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define FORX(i, a, b, x) for (int i = (a); i <= (b); i+=x)
#define debug(x) cerr << #x << " is= " << x << endl; //use for debugging
#define read(a) int a; cin >> a;
#define reads(s) string s; cin >> s;
#define readb(a, b) int a, b; cin >> a >> b;
#define readc(a, b, c) int a, b, c; cin >> a >> b >> c;
#define readarr(a, n) int a[(n) + 5] = {}; FOR(i, 1, (n)) {cin >> a[i];}
#define readmat(a, n, m) int a[n + 1][m + 1] = {}; FOR(i, 1, n) {FOR(j, 1, m) cin >> a[i][j];}
 
#define printarr(a, n) FOR (i, 1, n) cout << a[i] << " "; cout << endl;
#define printv(v) for (int i: v) cout << i << " "; cout << endl;
#define printmat(a, n, m) FOR (i, 1, n) {FOR (j, 1, m) cout << a[i][j] << " "; cout << endl;}
 
#define FORD(i, a, b) for(int i = (a); i >= (b); i--)
#define pb(a) push_back(a)
#define pf(a) push_front(a)
#define mp(a,b) make_pair(a,b)
#define fast_io ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
#define ll long long int
#define vi         vector<int>
#define vll        vector<ll>
#define vpii       vector<pair<int,int>>
#define vov        vector<vector<int>> 
#define pr         pair<int,int>
#define vpll       vector<pair<ll,ll>>
#define all(v)     v.begin(),v.end()
#define rall(v)    v.rbegin(),v.rend()  //reverse of above;
#define sz(container) int((container).size())
#define cut(x) {cout<<x<<"\n"; return;}
#define setprec(x) cout << fixed << showpoint << setprecision(8)<<x<<endl;
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) a*b/__gcd(a,b)
#define time cout << clock() / double(CLOCKS_PER_SEC) << endl;
#define endl "\n"
#define mod 1000000007
using namespace std;
using namespace __gnu_pbds;
typedef tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set; 
typedef tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_multiset;
//*s.find_by_order() ->returns an iterator to the k-th largest element (counting from zero);
//s.order_of_key() ->number of elements strictly smaller then our item;
//st.rbegin()->second; last element in set
//st.erase(prev(st.end())); delete last element in set;
//sort(a+1,a+n+1,[](ll x,ll y){return abs(x)>abs(y);});
//sort(v.begin(), v.end(), greater<int>()); 
const int N=1e5+5;
int h,w,temp,x,y;
pr a[100][100];
bool dp[100][100][1e5+1];
void solve()
{
 // we can prove that max diff will not exceed max. value of a,b;
 //hence dp state is reach index i,j with diff k;
 dp[1][0][0]=1;
 dp[0][1][0]=1;
 
 FOR(i,1,h) FOR(j,1,w) FOR(k,0,N)
 if(dp[i-1][j][k] or dp[i][j-1][k])
 {
  x=abs(a[i][j].first-a[i][j].second);
  dp[i][j][x+k]=1;
  dp[i][j][abs(x-k)]=1;
 }
 FOR(k,0,1e5) if(dp[h][w][k]) cut(k);
 //cout<<"lol \n";
}
int main()
{
  fast_io;
  #ifndef ONLINE_JUDGE
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
  #endif
  cin>>h>>w;
  FOR(i,1,h)FOR(j,1,w) cin>>a[i][j].first;
  FOR(i,1,h)FOR(j,1,w) cin>>a[i][j].second;
  solve();
}

Compiler output:
a.cc:53:22: error: conversion from 'double' to 'long unsigned int' in a converted constant expression
   53 | bool dp[100][100][1e5+1];
      |                   ~~~^~
a.cc:53:22: error: could not convert '(1.0e+5 + (double)1)' from 'double' to 'long unsigned int'
   53 | bool dp[100][100][1e5+1];
      |                   ~~~^~
      |                      |
      |                      double
a.cc:53:22: error: size of array 'dp' has non-integral type 'double'