#include <bits/stdc++.h>
#include "wombats.h"
#define maxm 200
#define maxn 5000
using namespace std;
int n,m;
int*** cost;
int edgeH[maxn][maxm];
int edgeV[maxn][maxm];
struct path {
int r,c,dist;
path(int _r , int _c , int _dist) {
r = _r;
c = _c;
dist = _dist;
}
};
bool operator<(const path& a , const path& b) {
return a.dist > b.dist;
}
void dijkstra(int col) {
for( int i = 0 ; i < n ; i++ )
for( int j = 0 ; j < m ; j++ )
cost[col][i][j] = -1;
priority_queue<path> heap;
heap.push(path(0,col,0));
while(!heap.empty()) {
path p = heap.top();
heap.pop();
int r = p.r;
int c = p.c;
if(cost[r][c] != -1)
continue;
int dist = p.dist;
cost[col][r][c] = dist;
if(c >= 1 && cost[col][r][c-1] == -1)
heap.push(path(r,c-1,dist+edgeH[r][c-1]));
if(c < m-1 && cost[col][r][c+1] == -1)
heap.push(path(r,c+1,dist+edgeH[r][c]));
if(r < n-1 && cost[col][r+1][c] == -1)
heap.push(path(r+1,c,dist+edgeV[r][c]));
}
}
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++ )
edgeH[i][j] = H[i][j];
for( int i = 0 ; i < n-1 ; i++ )
for( int j = 0 ; j < m ; j++ )
edgeV[i][j] = V[i][j];
cost = new int**[m];
for( int col = 0 ; col < m ; col++ ) {
cost[col] = new int*[n];
for( int i = 0 ; i < n ; i++ )
cost[col][i] = new int[m];
}
for( int i = 0 ; i < m ; i++ )
dijkstra(i);
}
void changeH(int P, int Q, int W) {
edgeH[P][Q] = W;
for( int i = 0 ; i < m ; i++ )
dijkstra(i);
}
void changeV(int P, int Q, int W) {
edgeV[P][Q] = W;
for( int i = 0 ; i < m ; i++ )
dijkstra(i);
}
int escape(int V1, int V2) {
return cost[V1][n-1][V2];
}
/*
int main() {
}
*/
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;
| ^~~
wombats.cpp: In function 'void dijkstra(int)':
wombats.cpp:36:21: error: ISO C++ forbids comparison between pointer and integer [-fpermissive]
36 | if(cost[r][c] != -1)
| ^
