#include "wombats.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ff first
#define ss second
#define pb push_back
#define mk make_pair
#define X real()
#define Y imag()
#define IOS ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define MOD 1000000007
#define MOD1 1000000009
#define sqr(x) sqr((x)*(x))
void debug_out() { cerr << endl; }
template<typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << ' ' << H; debug_out(T...); }
#ifdef BE_DEBUG
#define debug(...) cerr << "\033[1;31m(" << #__VA_ARGS__ << "):\033[0m", debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif
int h[5000][200];
int v[5000][200];
priority_queue<pair<int,pair<int,int> > > pq;
int r,c;
int dp[5002][3][5];
void upd() {
dp[0][0][0] = 0;
dp[0][0][1] = h[0][0];
for(int i = 1; i < r; i ++) {
if(dp[i - 1][0][0] + v[i - 1][0] <= dp[i - 1][0][1] + v[i - 1][1]) {
dp[i][0][0] = dp[i - 1][0][0] + v[i - 1][0];
dp[i][0][1] = min(dp[i - 1][0][1] + v[i - 1][1], dp[i][0][0] + h[i][0]);
}
else {
dp[i][0][1] = dp[i - 1][0][1] + v[i - 1][1];
dp[i][0][0] = min(dp[i - 1][0][0] + v[i - 1][0], dp[i][0][1] + h[i][0]);
}
}
//
dp[0][1][0] = h[0][0];
dp[0][1][1] = 0;
for(int i = 1; i < r; i ++) {
if(dp[i - 1][1][0] + v[i - 1][0] <= dp[i - 1][1][1] + v[i - 1][1]) {
dp[i][1][0] = dp[i - 1][1][0] + v[i - 1][0];
dp[i][1][1] = min(dp[i - 1][1][1] + v[i - 1][1], dp[i][1][0] + h[i][0]);
}
else {
dp[i][1][1] = dp[i - 1][1][1] + v[i - 1][1];
dp[i][1][0] = min(dp[i - 1][1][0] + v[i - 1][0], dp[i][1][1] + h[i][0]);
}
}
}
void init(int R, int C, int H[5000][200], int V[5000][200]) {
/* ... */
r = R;
c = C;
for(int i = 0; i < R; i ++) {
for(int j = 0; j < C - 1; j ++) {
h[i][j] = H[i][j];
}
}
for(int i = 0; i < R - 1; i ++) {
for(int j = 0; j < C; j ++) {
v[i][j] = V[i][j];
}
}
if(c == 2) upd();
}
void changeH(int P, int Q, int W) {
/* ... */
h[P][Q] = W;
if(c == 2) upd();
}
void changeV(int P, int Q, int W) {
/* ... */
v[P][Q] = W;
if(c == 2) upd();
}
int escape(int V1, int V2) {
if(c == 2) return dp[r - 1][V1][V2];
while(pq.size() > 0) pq.pop();
pq.push({0,{0,V1}});
bool visited[r][c];
memset(visited,0,sizeof(visited));
while(pq.size() > 0) {
pair<int,pair<int,int> > p;
//cout << p.ff << ' ' << p.ss.ff << ' ' << p.ss.ss << '\n';
p = pq.top();
pq.pop();
if(visited[p.ss.ff][p.ss.ss] == 1) continue;
visited[p.ss.ff][p.ss.ss] = 1;
if(p.ss.ff == r - 1 && p.ss.ss == V2) return -p.ff;
if(p.ss.ss > 0 && visited[p.ss.ff][p.ss.ss - 1] == 0) {
pq.push({p.ff - h[p.ss.ff][p.ss.ss - 1],{p.ss.ff, p.ss.ss - 1}});
}
if(p.ss.ss + 1 < c && visited[p.ss.ff][p.ss.ss + 1] == 0) {
pq.push({p.ff - h[p.ss.ff][p.ss.ss],{p.ss.ff,p.ss.ss + 1}});
}
if(p.ss.ff + 1 < r && visited[p.ss.ff + 1][p.ss.ss] == 0) {
pq.push({p.ff - v[p.ss.ff][p.ss.ss],{p.ss.ff + 1, p.ss.ss}});
}
}
return 0;
}
