oj.uz

Submission #962185

# Submission time Handle Problem Language Result Execution time Memory
962185 2024-04-13T08:41:42 Z NValchanov Wombats (IOI13_wombats) C++17
37 / 100
 5609 ms 262144 KB 
#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];
ll ans_m1;

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];
        }
        if(m == 1)
            ans_m1 += ver[i][0];
    }

    calc();
}

void changeH(int i, int j, int w) /// change path from x;y to x;y + 1
{
    if(m == 1)
    {
        assert(false);
    }

    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)
    {
        ll new_change = w - ver[i][j];
        ans_m1 += new_change;
        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)
    {
        assert(from  + to == 0);
        return ans_m1;
    }

    return dp[n - 1][to][from];
}
/**
3 4
0 2 5
7 1 1
0 4 0
0 0 0 2
0 3 4 7
5
3 2 1
3 3 3
2 0 0 5
1 1 1 6
3 2 1
*/

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;
      |      ^~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 116 ms 240584 KB Output is correct
2 Correct 32 ms 242780 KB Output is correct
3 Correct 100 ms 244972 KB Output is correct
4 Correct 32 ms 240568 KB Output is correct
5 Correct 35 ms 242772 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2760 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 2 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 2 ms 12636 KB Output is correct
5 Correct 2 ms 12636 KB Output is correct
6 Correct 2 ms 12636 KB Output is correct
7 Correct 2 ms 12636 KB Output is correct
8 Correct 2 ms 12632 KB Output is correct
9 Correct 2 ms 12632 KB Output is correct
10 Correct 2 ms 12736 KB Output is correct
11 Correct 63 ms 14748 KB Output is correct
12 Correct 2 ms 12756 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1033 ms 41964 KB Output is correct
2 Correct 1048 ms 41956 KB Output is correct
3 Correct 1112 ms 41960 KB Output is correct
4 Correct 1117 ms 41960 KB Output is correct
5 Correct 1096 ms 41956 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 5609 ms 41972 KB Output is correct
10 Correct 1 ms 8540 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Runtime error 55 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1150 ms 42212 KB Output is correct
2 Correct 1118 ms 41944 KB Output is correct
3 Correct 1133 ms 41960 KB Output is correct
4 Correct 1129 ms 41960 KB Output is correct
5 Correct 1102 ms 41956 KB Output is correct
6 Runtime error 37 ms 262144 KB Execution killed with signal 9
7 Halted 0 ms 0 KB -

Subtask #6
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1152 ms 41876 KB Output is correct
2 Correct 1118 ms 41876 KB Output is correct
3 Correct 1132 ms 42068 KB Output is correct
4 Correct 1128 ms 42072 KB Output is correct
5 Correct 1136 ms 41880 KB Output is correct
6 Runtime error 37 ms 262144 KB Execution killed with signal 9
7 Halted 0 ms 0 KB -