#include<bits/stdc++.h>
#define fi first
#define se second
//#include "wombats.h"
using namespace std;
int R,C,H[5000][200],V[5000][200],vis[5000][200],help,dis[5000][2000],X,Y,x,y,G[5000][200][3],tr[5000][200],val;
int D[200][200];
int dx[] = {0,0,1};
int dy[] = {1,-1,0};
priority_queue<pair<int,pair<int,int > > > pq;
void dijkstra() {
while (!pq.empty())
pq.pop();
for (int i = 0; i < C; i++) {
help++;
pq.push ({0,{0, i}});
tr[0][i] = help;
while (!pq.empty()) {
auto v = pq.top();
val = v.fi;
X = v.se.fi;
Y = v.se.se;
pq.pop();
if (vis[X][Y] == help) continue;
vis[X][Y] = help;
if (X == R) {
D[i][Y] = val;
}
for (int j = 0; j < 3; j++) {
x = dx[j] + X;
y = dy[j] + Y;
if (X >= R || Y < 0 || Y >= C) continue;
if (help != tr[x][y] || dis[x][y] > val + G[X][Y][j] ) {
tr[x][y] = help;
dis[x][y] = val + G[X][Y][j];
pq.push( { -dis[x][y], { x , y} } );
}
}
}
}
}
void init(int R1, int C1, int H1[5000][200], int V1[5000][200]) {
R = R1; C = C1;
for (int i = 0; i < R; i++)
for (int j = 0; j < C; j++) {
H[i][j] = H1[i][j],
V[i][j] = V1[i][j];
}
for (int i = 0; i < R; i++)
for (int j = 0; j < C; j++) {
G[i][j][0] = H[i][j];
if (j)
G[i][j][1] = H[i][j-1];
G[i][j][2] = V[i][j];
}
dijkstra();
}
void changeH(int P, int Q, int W) {
G[P][Q][0] = W;
G[P][Q+1][1] = W;
dijkstra();
}
void changeV(int P, int Q, int W) {
G[P][Q][2] = W;
dijkstra();
}
int escape(int V1, int V2) {
return D[V1][V2];
}
Compilation message
grader.c: In function 'int main()':
grader.c:15:6: warning: variable 'res' set but not used [-Wunused-but-set-variable]
int res;
^~~
/tmp/ccXlxpmN.o: In function `main':
grader.c:(.text.startup+0x103): undefined reference to `init'
grader.c:(.text.startup+0x164): undefined reference to `escape'
grader.c:(.text.startup+0x1cf): undefined reference to `changeH'
grader.c:(.text.startup+0x23b): undefined reference to `changeV'
collect2: error: ld returned 1 exit status
