#include "wombats.h"
#include<bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
const int N = 5005, K = 205;
int n, m, ch[N][K], cv[N][K], d[N][K];
vector<pii> v[N * K];
bool f[K];
int get (int x, int y) {
return x * m + y;
}
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++) {
ch[i][j] = H[i][j];
v[get(i, j)].emplace_back(get(i, j + 1), H[i][j]);
v[get(i, j + 1)].emplace_back(get(i, j), H[i][j]);
}
}
for (int i = 0; i < n - 1; i++) {
for (int j = 0; j < m; j++) {
cv[i][j] = V[i][j];
v[get(i, j)].emplace_back(get(i + 1, j), V[i][j]);
}
}
for (int i = 0; i < m; i++) f[i] = 1;
}
void changeH(int P, int Q, int W) {
int st = get(P, Q), ed = get(P, Q + 1);
v[st].erase(find(v[st].begin(), v[st].end(), pii(ed, ch[P][Q])));
v[ed].erase(find(v[ed].begin(), v[ed].end(), pii(st, ch[P][Q])));
ch[P][Q] = W;
v[st].emplace_back(ed, W);
v[ed].emplace_back(st, W);
for (int i = 0; i < m; i++) f[i] = 1;
}
void changeV(int P, int Q, int W) {
int st = get(P, Q), ed = get(P + 1, Q);
v[st].erase(find(v[st].begin(), v[st].end(), pii(ed, cv[P][Q])));
cv[P][Q] = W;
v[st].emplace_back(ed, W);
for (int i = 0; i < m; i++) f[i] = 1;
}
int escape(int V1, int V2) {
int st = get(0, V1), ed = get(n - 1, V2);
if (f[V1]) {
for (int i = 0; i < n * m; i++) d[i][V1] = 1e9;
priority_queue<pii, vector<pii>, greater<pii>> pq;
pq.emplace(d[st][V1] = 0, st);
while (!pq.empty()) {
auto [nd, nn] = pq.top(); pq.pop();
for (auto &[tn, td]: v[nn]) {
if (d[tn][V1] > d[nn][V1] + td) pq.emplace(d[tn][V1] = d[nn][V1] + td, tn);
}
}
f[V1] = 0;
}
return d[ed][V1];
}
