#include "wombats.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pi;
typedef vector <int> vi;
typedef vector <pi> vpi;
typedef pair<pi, ll> pii;
typedef set <ll> si;
typedef long double ld;
#define f first
#define s second
#define mp make_pair
#define FOR(i,s,e) for(int i=s;i<=int(e);++i)
#define DEC(i,s,e) for(int i=s;i>=int(e);--i)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define lbd(x, y) lower_bound(all(x), y)
#define ubd(x, y) upper_bound(all(x), y)
#define aFOR(i,x) for (auto i: x)
#define mem(x,i) memset(x,i,sizeof x)
#define fast ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define maxn 200010
#define INF (ll)1e9
#define MOD 1000000007
typedef pair <vi, int> pvi;
typedef pair <int,pi> ipi;
typedef vector <pii> vpii;
int R,C;
int H[5000][200], V[5000][200], ss[5000][200];
int tmp[200][200],opt[2][200];
struct node{
int s,e,m;
int val[200][200];
node *l,*r;
bool leaf = 0;
node(int _s,int _e){
s = _s; e = _e; m = (s + e) / 2;
if (e-s+1 > 20){
l = new node(s,m); r = new node(m+1,e);
merge();
}else{
leaf = 1;
compleaf();
}
}
void merge(){
int j;
DEC(len,C-1,1){
FOR(i,0,C-len){
j = i + len;
val[i][j] = INF;
int lb = (i>0?opt[(len+1)&1][i-1]:0);
int rb = (j+1<C?opt[(len+1)&1][i]:C-1);
FOR(k,lb,rb){
int res = l->val[i][k] + r->val[k][j] + V[m][k];
if (res < val[i][j]){
opt[len&1][i] = k;
val[i][j] = res;
}
}
}
}
DEC(len,C-1,0){
FOR(i,len,C-1){
j = i - len;
val[i][j] = INF;
int lb = (j>0?opt[(len+1)&1][i]:0);
int rb = (i+1<C?opt[(len+1)&1][i+1]:C-1);
FOR(k,lb,rb){
int res = l->val[i][k] + r->val[k][j] + V[m][k];
if (res < val[i][j]){
opt[len&1][i] = k;
val[i][j] = res;
}
}
}
}
}
void updV(int row){
if (leaf){
compleaf(); return;
}
if (m < row) r->updV(row);
else if (m > row) l->updV(row);
merge();
}
void compleaf(){
FOR(i,0,C-1) FOR(j,0,C-1) val[i][j] = abs(ss[e][i] - ss[e][j]);
DEC(l,e-1,s){
FOR(j,0,C-1){
int mn = INF;
FOR(i,0,C-1){
mn = min(mn, val[i][j] - ss[l][i] + V[l][i]);
tmp[i][j] = mn + ss[l][i];
}
mn = INF;
DEC(i,C-1,0){
mn = min(mn, val[i][j] + ss[l][i] + V[l][i]);
tmp[i][j] = min(tmp[i][j], mn - ss[l][i]);
}
}
FOR(i,0,C-1) FOR(j,0,C-1) val[i][j] = tmp[i][j];
}
}
void updH(int row){
if (leaf){
compleaf();
return;
}
if (row > m) r->updH(row);
else l->updH(row);
merge();
}
}*root;
void init(int R, int C, int H[5000][200], int V[5000][200]) {
::R = R; ::C = C;
FOR(i,0,R-1) FOR(j,0,C-1){
::H[i][j] = H[i][j];
::V[i][j] = V[i][j];
}
FOR(i,0,R-1){
ss[i][0] = 0;
FOR(j,1,C-1){
ss[i][j] = ss[i][j-1] + H[i][j-1];
}
}
root = new node(0,R-1);
/*
FOR(i,0,C-1){
FOR(j,0,C-1) cout << root->val[i][j] << ' ';
cout << '\n';
}
*/
}
void changeH(int P, int Q, int W) {
H[P][Q] = W;
FOR(j,1,C-1) ss[P][j] = ss[P][j-1] + H[P][j-1];
root->updH(P);
}
void changeV(int P, int Q, int W) {
V[P][Q] = W;
root->updV(P);
}
int escape(int V1, int V2) {
return root->val[V1][V2];
}
