#include "wombats.h"
#include<bits/stdc++.h>
using namespace std;
const int inf = 0x3fffffff;
// duplication of the original data
int r, c;
int dr;
int h[5200][200], v[5200][200];
// related with sqrt-decomposition
int block[73][200][200];
int res[200][200];
int bn;
// array used in merge function
int D[200][200];
int temp[200][200];
void merge(int A[200][200], int B[200][200], int cost[200], int M[200][200]) {
// s == e
for (int i = 0; i < c; i++) {
temp[i][i] = inf;
D[i][i] = i;
for (int j = 0; j < c; j++) {
if (temp[i][i] > A[i][j] + cost[j] + B[j][i]) {
temp[i][i] = A[i][j] + cost[j] + B[j][i];
D[i][i] = j;
}
}
}
// s < e
for (int len = 2; len <= c; len++) {
for (int s = 0; s <= c - len; s++) {
int e = s + len - 1;
temp[s][e] = inf;
D[s][e] = s;
for (int i = D[s][e - 1]; i <= D[s + 1][e]; i++) {
if (temp[s][e] > A[s][i] + cost[i] + B[i][e]) {
temp[s][e] = A[s][i] + cost[i] + B[i][e];
D[s][e] = i;
}
}
}
}
// s > e
for (int len = 2; len <= c; len++) {
for (int s = len - 1; s < c; s++) {
int e = s - len + 1;
temp[s][e] = inf;
D[s][e] = s;
for (int i = D[s - 1][e]; i <= D[s][e + 1]; i++) {
if (temp[s][e] > A[s][i] + cost[i] + B[i][e]) {
temp[s][e] = A[s][i] + cost[i] + B[i][e];
D[s][e] = i;
}
}
}
}
for (int s = 0; s < c; s++) {
for (int e = 0; e < c; e++) {
M[s][e] = temp[s][e];
}
}
}
void set_mono(int i, int A[200][200]) {
for (int s = 0; s < c; s++) {
A[s][s] = 0;
for (int e = s + 1; e < c; e++) {
A[s][e] = A[s][e - 1] + h[i][e - 1];
A[e][s] = A[s][e];
}
}
}
// array used in set_block function
int tmp[200][200];
void set_block(int idx) {
int ed = min(r, idx * dr + dr);
set_mono(idx * dr, block[idx]);
for (int i = idx * dr + 1; i < ed; i++) {
set_mono(i, tmp);
merge(block[idx], tmp, v[i - 1], block[idx]);
}
}
void copy_A_to_B(int A[200][200], int B[200][200]) {
for (int i = 0; i < 200; i++) {
for (int j = 0; j < 200; j++) {
B[i][j] = A[i][j];
}
}
}
void get_res() {
copy_A_to_B(block[0], res);
for (int idx = 1; idx < bn; idx++) {
merge(res, block[idx], v[idx * dr - 1], res);
}
}
void init(int R, int C, int H[5000][200], int V[5000][200]) {
r = R;
c = C;
dr = sqrt(r);
bn = r % dr ? r / dr + 1 : r / dr;
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
h[i][j] = H[i][j];
v[i][j] = V[i][j];
}
}
for (int idx = 0; idx < bn; idx++) {
set_block(idx);
}
get_res();
}
void changeH(int P, int Q, int W) {
h[P][Q] = W;
set_block(P / dr);
get_res();
}
void changeV(int P, int Q, int W) {
v[P][Q] = W;
if ((P - 1) % dr != 0) {
set_block(P / dr);
}
get_res();
}
int escape(int V1, int V2) {
return res[V1][V2];
}
