#include <bits/stdc++.h>
/// #pragma GCC optimize ("Ofast")
/// #pragma GCC target ("avx2")
/// #pragma GCC optimize("unroll-loops")
using namespace std;
using ll = long long;
using ii = pair<ll, ll>;
using vi = vector<int>;
#define ff first
#define ss second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define lb lower_bound
const int oo = 1000 * 1000 * 1000 + 7;
int R, C, H[5000][200], K[5000][200];
void init(int r, int c, int h[5000][200], int v[5000][200]) {
R = r, C = c;
for(int l = 0; l < R; l++)
for(int i = 0; i < C; i++)
H[l][i] = h[l][i],
K[l][i] = v[l][i];
}
void changeH(int P, int Q, int W) { H[P][Q] = W; }
void changeV(int P, int Q, int W) { K[P][Q] = W; }
using pi = pair<int, pair<int, int>>;
int escape(int V1, int V2) {
priority_queue<pi, vector<pi>, greater<pi>> pq;
pq.push({0, {0, V1}}); vector<vector<int>> D;
D = vector<vector<int>> (R, vector<int>(C, oo));
D[0][V1] = 0;
while(!pq.empty()) {
int U = pq.top().ss.ff, V = pq.top().ss.ss;
int W = pq.top().ff; pq.pop();
if(W != D[U][V]) continue;
if(V < C - 1) {
if(D[U][V + 1] > D[U][V] + H[U][V]) {
D[U][V + 1] = D[U][V] + H[U][V];
pq.push({D[U][V + 1], {U, V + 1}});
}
}
if(V > 0) {
if(D[U][V - 1] > D[U][V] + H[U][V - 1]) {
D[U][V - 1] = D[U][V] + H[U][V - 1];
pq.push({D[U][V - 1], {U, V - 1}});
}
}
if(U < R - 1) {
if(D[U + 1][V] > D[U][V] + K[U][V]) {
D[U + 1][V] = D[U][V] + K[U][V];
pq.push({D[U + 1][V], {U + 1, V}});
}
}
}
return D[R - 1][V2];
}
Compilation message
grader.c: In function 'int main()':
grader.c:15:6: warning: variable 'res' set but not used [-Wunused-but-set-variable]
15 | int res;
| ^~~
/usr/bin/ld: /tmp/cckWNkal.o: in function `main':
grader.c:(.text.startup+0x129): undefined reference to `init'
/usr/bin/ld: grader.c:(.text.startup+0x194): undefined reference to `escape'
/usr/bin/ld: grader.c:(.text.startup+0x203): undefined reference to `changeH'
/usr/bin/ld: grader.c:(.text.startup+0x26d): undefined reference to `changeV'
collect2: error: ld returned 1 exit status
