# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
962246 | NValchanov | Wombats (IOI13_wombats) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "wombats.h"
using namespace std;
typedef long long ll;
const ll MAXN = 5010;
const ll MAXM = 210;
const ll INF = 4e18 + 10;
ll n,m;
ll hor[MAXN][MAXM];
ll ver[MAXN][MAXM];
ll dp[MAXN][MAXM][MAXM];
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]);
}
}
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]);
}
}
}
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; i++)
{
for(int j = 0; j < m - 1; j++)
{
hor[i][j] = H[i][j];
}
}
for(int i = 0; i < n - 1; i++)
{
for(int j = 0; j < m; j++)
{
ver[i][j] = V[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
{
if(m == 1)
{
ans_m1 += (w - ver[i][j]);
ver[i][j] = w;
return;
}
ver[i][j] = w;
calc();
}
int escape(int from, int to) /// escape from (0;V1) to (N-1;V2)
{
if(m == 1)
return ans_m1;
return dp[n - 1][to][from];
}