oj.uz

Submission #679998

# Submission time Handle Problem Language Result Execution time Memory
679998 2023-01-09T18:35:15 Z bashkort Wombats (IOI13_wombats) C++17
76 / 100
 20000 ms 25292 KB 
#include <bits/stdc++.h>
#include "wombats.h"

using namespace std;

inline bool ckmin(int &a, int b) {
    return (a > b) && (a = b, true);
}

constexpr int B = 200, R = 5000, C = 200, K = (R + B - 1) / B;

int r, c, need;
int dp[K][C][C], fr[K][C][C], H[R][C], V[R][C];

void update_dp(int L) {
    if (L == need - 1) {
        memcpy(dp[L], fr[L], sizeof(dp[L]));
        return;
    }
    memset(dp[L], 0x3f, sizeof(dp[L]));
    for (int cc = 0; cc < c; ++cc) {
        const int idx = (L + 1) * B - 1;

        function<void(int, int, int, int)> solve = [&](int l, int r, int optl, int optr) {
            if (l >= r) {
                return;
            }

            int mid = (l + r) >> 1;

            int opt = optl;

            for (int b = optl; b <= optr; ++b) {
                if (ckmin(dp[L][mid][cc], fr[L][mid][b] + V[idx][b] + dp[L + 1][b][cc])) {
                    opt = b;
                }
            }

            solve(l, mid, optl, opt), solve(mid + 1, r, opt, optr);
        };
        solve(0, c, 0, c - 1);
    }

}

void update_fr(int L) {
    memset(fr[L], 0x3f, sizeof(fr[L]));
    for (int a = 0; a < c; ++a) {
        fr[L][a][a] = 0;
    }
    int lim = B * L;
    for (int i = min(r, B * (L + 1)) - 1; i >= lim; --i) {
        for (int a = 0; a < c - 1; ++a) {
            for (int cc = 0; cc < c; ++cc)
                ckmin(fr[L][a + 1][cc], fr[L][a][cc] + H[i][a]);
        }
        for (int a = c - 2; a >= 0; --a) {
            for (int cc = 0; cc < c; ++cc)
                ckmin(fr[L][a][cc], fr[L][a + 1][cc] + H[i][a]);
        }
        if (i != lim) {
            for (int cc = 0; cc < c; ++cc) {
                for (int a = 0; a < c; ++a) {
                    fr[L][a][cc] += V[i - 1][a];
                }
            }
        }
    }
}

void init(int R, int C, int H[5000][200], int V[5000][200]) {
    r = R, c = C;
    memcpy(::H, H, sizeof(::H)), memcpy(::V, V, sizeof(::V));

    need = (r + B - 1) / B;
    for (int i = need - 1; i >= 0; --i) {
        update_fr(i);
    }
    for (int i = need - 1; i >= 0; --i) {
        update_dp(i);
    }
}

void changeH(int P, int Q, int W) {
    H[P][Q] = W;

    int L = P / B;

    update_fr(L);

    if (L == need - 1) {
        memcpy(dp[L], fr[L], sizeof(dp[L]));
    } else {
        update_dp(L);
    }
    for (int i = L - 1; i >= 0; --i) {
        update_dp(i);
    }
}

void changeV(int P, int Q, int W) {
    V[P][Q] = W;

    int L = P / B;

    if ((P + 1) % B != 0) {
        update_fr(L);
    }
    for (int i = L; i >= 0; --i) {
        update_dp(i);
    }
}

int escape(int V1, int V2) {
    return dp[0][V1][V2];
}

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 18 ms 19796 KB Output is correct
2 Correct 65 ms 19796 KB Output is correct
3 Correct 115 ms 21400 KB Output is correct
4 Correct 45 ms 19796 KB Output is correct
5 Correct 19 ms 19880 KB Output is correct
6 Correct 4 ms 8404 KB Output is correct
7 Correct 4 ms 8404 KB Output is correct
8 Correct 4 ms 8416 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 8404 KB Output is correct
2 Correct 5 ms 8404 KB Output is correct
3 Correct 5 ms 8404 KB Output is correct
4 Correct 5 ms 8428 KB Output is correct
5 Correct 5 ms 8404 KB Output is correct
6 Correct 5 ms 8404 KB Output is correct
7 Correct 6 ms 8404 KB Output is correct
8 Correct 5 ms 8404 KB Output is correct
9 Correct 5 ms 8404 KB Output is correct
10 Correct 5 ms 8404 KB Output is correct
11 Correct 69 ms 9452 KB Output is correct
12 Correct 5 ms 8404 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 306 ms 8616 KB Output is correct
2 Correct 271 ms 8620 KB Output is correct
3 Correct 310 ms 8620 KB Output is correct
4 Correct 294 ms 8532 KB Output is correct
5 Correct 314 ms 8620 KB Output is correct
6 Correct 6 ms 8360 KB Output is correct
7 Correct 5 ms 8460 KB Output is correct
8 Correct 4 ms 8404 KB Output is correct
9 Correct 1312 ms 8616 KB Output is correct
10 Correct 4 ms 8404 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 23716 KB Output is correct
2 Correct 32 ms 23784 KB Output is correct
3 Correct 57 ms 23744 KB Output is correct
4 Correct 65 ms 24500 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 323 ms 8744 KB Output is correct
2 Correct 258 ms 8620 KB Output is correct
3 Correct 318 ms 8620 KB Output is correct
4 Correct 307 ms 8632 KB Output is correct
5 Correct 297 ms 8532 KB Output is correct
6 Correct 62 ms 23768 KB Output is correct
7 Correct 21 ms 23764 KB Output is correct
8 Correct 53 ms 23780 KB Output is correct
9 Correct 66 ms 24520 KB Output is correct
10 Correct 19 ms 19872 KB Output is correct
11 Correct 55 ms 19796 KB Output is correct
12 Correct 116 ms 21392 KB Output is correct
13 Correct 48 ms 19760 KB Output is correct
14 Correct 19 ms 19796 KB Output is correct
15 Correct 4 ms 8368 KB Output is correct
16 Correct 4 ms 8436 KB Output is correct
17 Correct 5 ms 8400 KB Output is correct
18 Correct 5 ms 8404 KB Output is correct
19 Correct 6 ms 8404 KB Output is correct
20 Correct 5 ms 8404 KB Output is correct
21 Correct 7 ms 8404 KB Output is correct
22 Correct 4 ms 8404 KB Output is correct
23 Correct 5 ms 8404 KB Output is correct
24 Correct 5 ms 8404 KB Output is correct
25 Correct 67 ms 9468 KB Output is correct
26 Correct 5 ms 8404 KB Output is correct
27 Correct 1308 ms 8624 KB Output is correct
28 Correct 6926 ms 24100 KB Output is correct
29 Correct 3680 ms 21772 KB Output is correct
30 Correct 7170 ms 21472 KB Output is correct
31 Correct 3584 ms 25172 KB Output is correct
32 Correct 4 ms 8404 KB Output is correct

Subtask #6
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 290 ms 8616 KB Output is correct
2 Correct 264 ms 8532 KB Output is correct
3 Correct 288 ms 8640 KB Output is correct
4 Correct 294 ms 8620 KB Output is correct
5 Correct 282 ms 8620 KB Output is correct
6 Correct 60 ms 23776 KB Output is correct
7 Correct 22 ms 23744 KB Output is correct
8 Correct 44 ms 23712 KB Output is correct
9 Correct 55 ms 24596 KB Output is correct
10 Correct 19 ms 19796 KB Output is correct
11 Correct 54 ms 19796 KB Output is correct
12 Correct 116 ms 21404 KB Output is correct
13 Correct 42 ms 19864 KB Output is correct
14 Correct 18 ms 19824 KB Output is correct
15 Correct 801 ms 23828 KB Output is correct
16 Correct 14144 ms 25292 KB Output is correct
17 Correct 5 ms 8404 KB Output is correct
18 Correct 5 ms 8424 KB Output is correct
19 Correct 4 ms 8404 KB Output is correct
20 Correct 5 ms 8404 KB Output is correct
21 Correct 5 ms 8404 KB Output is correct
22 Correct 5 ms 8404 KB Output is correct
23 Correct 5 ms 8404 KB Output is correct
24 Correct 4 ms 8404 KB Output is correct
25 Correct 5 ms 8404 KB Output is correct
26 Correct 5 ms 8404 KB Output is correct
27 Correct 65 ms 9484 KB Output is correct
28 Correct 5 ms 8404 KB Output is correct
29 Correct 1263 ms 8632 KB Output is correct
30 Correct 6802 ms 24060 KB Output is correct
31 Execution timed out 20076 ms 24528 KB Time limit exceeded
32 Halted 0 ms 0 KB -