#include "wombats.h"
#include <bits/stdc++.h>
using namespace std;
const int len_n = 5005, len_m = 205, inf = 1e9+10;
int hor[len_n][len_m], ver[len_n][len_m], n, m, k;
struct{
struct node{
int to[len_m][len_m];
node(){
for (int a = 0; a < m; a++)
for (int b = 0; b < m; b++)
to[a][b] = inf; // check this
}
node(int i){
for (int a = 0, suma = 0; a < m; a++){
for (int b = 0, dif = suma; b < m; b++){
to[a][b] = dif + ver[i][b];
if (b < a)
dif -= hor[i][b];
else
dif += hor[i][b];
}
suma += hor[i][a];
}
if (0){
printf("-------------------------------------------\n");
printf("just constructed %d-th leaf\n", i);
for (int a = 0; a < m; a++){
for (int b = 0; b < m; b++)
printf("%d ", to[a][b]);
printf("\n");
}
printf("-------------------------------------------\n");
}
}
};
node buck[75], root;
node join(node fir, node sec){
node res;
for (int a = 0; a < m; a++)
for (int b = 0; b < m; b++)
for (int c = 0; c < m; c++)
res.to[a][b] = min(res.to[a][b], fir.to[a][c]+sec.to[c][b]);
return res;
}
void upd_buck(int b){
int st = b*k, en = min(n, (b+1)*k);
buck[b] = node(st);
for (int i = st+1; i < en; i++)
buck[b] = join(buck[b], node(i));
}
void upd_root(){
root = buck[0];
for (int b = 1; b*k < n; b++)
root = join(root, buck[b]);
}
int ask(int a, int b){
return root.to[a][b];
}
} data;
void init(int R, int C, int H[5000][200], int V[5000][200]) {
n = R, m = C;
for (int i = 0; i < n; i++)
for (int j = 0; j < m-1; j++)
hor[i][j] = H[i][j];
for (int i = 0; i < n-1; i++)
for (int j = 0; j < m; j++)
ver[i][j] = V[i][j];
k = sqrt(n);
for (int b = 0; k*b < n; b++)
data.upd_buck(b);
data.upd_root();
}
void changeH(int P, int Q, int W) {
hor[P][Q] = W;
data.upd_buck(P/k);
data.upd_root();
}
void changeV(int P, int Q, int W) {
ver[P][Q] = W;
data.upd_buck(P/k);
data.upd_root();
}
int escape(int V1, int V2) {
return data.ask(V1, V2);
}
