#include <bits/stdc++.h>
#include"wombats.h"
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
#define ll long long
#define fi first
#define se second
#define pb push_back
vector<pair<int,int>> adj[5005*205];
int r,c;
int ans[205][205];
int convert(int x,int y){
return x*c+y;
}
long long dis[5005*205];
long long djikastra(int x,int y){
x=convert(0,x);
y=convert(r-1,y);
for (int i = 0; i < r; ++i)
{
for (int j = 0; j < c; ++j)
{
dis[convert(i,j)]=1e18;
}
}
priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> pq;
pq.push({0,x});
dis[x]=0;
while(!pq.empty()){
int node=pq.top().se;
long long d=pq.top().fi;
pq.pop();
if(node==y) return d;
if(d>dis[node]) continue;
for(auto u:adj[node]){
long long newd=d+u.se;
if(newd>=dis[u.fi]) continue;
dis[u.fi]=newd;
pq.push({newd,u.fi});
}
}
}
void init(int R, int C, int H[5000][200], int V[5000][200]) {
memset(ans,-1,sizeof ans);
r=R;
c=C;
for (int i = 0; i < R; ++i)
{
for (int j = 0; j < C-1; ++j)
{
int x=convert(i,j);
int y=convert(i,j+1);
adj[x].pb({y,H[i][j]});
adj[y].pb({x,H[i][j]});
}
}
for (int i = 0; i < R-1; ++i)
{
for (int j = 0; j < C; ++j)
{
int x=convert(i,j);
int y=convert(i+1,j);
adj[x].pb({y,V[i][j]});
}
}
return;
}
void changeH(int P, int Q, int W) {
memset(ans,-1,sizeof ans);
for (int i = 0; i < adj[convert(P,Q)].size(); ++i)
{
if(adj[convert(P,Q)][i].fi==convert(P,Q+1)) adj[convert(P,Q)][i].se=W;
}
for (int i = 0; i < adj[convert(P,Q+1)].size(); ++i)
{
if(adj[convert(P,Q+1)][i].fi==convert(P,Q)) adj[convert(P,Q+1)][i].se=W;
}
}
void changeV(int P, int Q, int W) {
memset(ans,-1,sizeof ans);
for (int i = 0; i < adj[convert(P,Q)].size(); ++i)
{
if(adj[convert(P,Q)][i].fi==convert(P+1,Q)) adj[convert(P,Q)][i].se=W;
}
}
int escape(int V1, int V2) {
if(ans[V1][V2]!=-1) return ans[V1][V2];
return ans[V1][V2]=djikastra(V1,V2);
}
