#include <bits/stdc++.h>
#include "wombats.h"
using namespace std;
typedef long long ll;
const ll MAXN = 5e3 + 10;
const ll MAXM = 2e2 + 10;
const ll INF = 4e18 + 10;
ll n,m;
ll hor[MAXN][MAXM];
ll ver[MAXN][MAXM];
ll dp[MAXN][MAXM][MAXM];
ll ans_m1;
void init_m1()
{
ans_m1 = 0;
for(int i = 0; i < n - 1; i++)
{
ans_m1 += ver[i][0];
}
}
void init_dp(ll src)
{
for(int i = 0; i < n; i++)
{
for(int j = 0; j < m; j++)
{
dp[i][j][src] = INF;
}
}
dp[0][src][src] = 0;
for(int j = 1; j < m; j++)
{
dp[0][j][src] = min(dp[0][j][src], dp[0][j - 1][src] + hor[0][j - 1]);
}
for(int j = m - 2; j >= 0; j--)
{
dp[0][j][src] = min(dp[0][j][src], dp[0][j + 1][src] + hor[0][j + 1]);
}
}
void fill_dp(ll src)
{
init_dp(src);
for(int i = 1; i < n; i++)
{
for(int j = 0; j < m; j++)
{
dp[i][j][src] = min(dp[i][j][src], dp[i - 1][j][src] + ver[i - 1][j]);
}
for(int j = 1; j < m; j++)
{
dp[i][j][src] = min(dp[i][j][src], dp[i][j - 1][src] + hor[i][j - 1]);
}
for(int j = m - 2; j >= 0; j--)
{
dp[i][j][src] = min(dp[i][j][src], dp[i][j + 1][src] + hor[i][j + 1]);
}
}
}
void calc()
{
for(ll src = 0; src < m; src++)
{
fill_dp(src);
}
}
void init(int R, int C, int H[5000][200], int V[5000][200])
{
n = R;
m = C;
for(int i = 0; i < n - 1; i++)
{
ans_m1 += V[i][0];
for(int j = 0; j < m - 1; j++)
{
ver[i][j] = V[i][j];
hor[i][j] = H[i][j];
}
}
calc();
}
void changeH(int i, int j, int w) /// change path from x;y to x;y + 1
{
hor[i][j] = w;
calc();
}
void changeV(int i, int j, int w) /// change path from x;y to x + 1;y
{
ver[i][j] = w;
calc();
}
int escape(int from, int to) /// escape from (0;V1) to (N-1;V2)
{
return dp[n - 1][to][from];
}
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;
| ^~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
187 ms |
219472 KB |
Output is correct |
2 |
Incorrect |
111 ms |
221520 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1130 ms |
41956 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
260 ms |
227164 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1123 ms |
42020 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1098 ms |
42064 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |