# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
962062 | 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 "wombats.h"
const long long int MAXN = 5e3 + 10;
const long long int MAXM = 2e2 + 10;
long long int n,m;
long long int hor[MAXN][MAXM];
long long int ver[MAXN][MAXM]
long long int pref[MAXN];
long long int ans_m1;
void init_m1()
{
for(int i = 1; i < n; i++)
{
ans_m1 += ver[i][1];
}
}
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++)
{
for(int j = 0; j < m - 1; j++)
{
ver[i + 1][j + 1] = V[i][j];
hor[i + 1][j + 1] = H[i][j];
}
}
if(m == 1)
init_m1();
}
void changeH(int x, int y, int w) /// change path from x;y to x;y + 1
{
assert(false);
}
void changeV(int x, int y, int w) /// change path from x;y to x + 1;y
{
long long int new_change = w - ver[x][y];
ans_m1 += new_change;
ver[x][y] = w;
}
int escape(int V1, int V2)
{
if(m == 1)
return ans_m1;
}