oj.uz

Submission #679995

# Submission time Handle Problem Language Result Execution time Memory
679995 2023-01-09T18:32:07 Z bashkort Wombats (IOI13_wombats) C++17
76 / 100
 20000 ms 39564 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 = 100, 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) {
        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[(L + 1) * B - 1][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 29 ms 27604 KB Output is correct
2 Correct 185 ms 27692 KB Output is correct
3 Correct 245 ms 29268 KB Output is correct
4 Correct 99 ms 27688 KB Output is correct
5 Correct 29 ms 27708 KB Output is correct
6 Correct 6 ms 8404 KB Output is correct
7 Correct 5 ms 8404 KB Output is correct
8 Correct 5 ms 8404 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 4 ms 8404 KB Output is correct
3 Correct 5 ms 8404 KB Output is correct
4 Correct 5 ms 8404 KB Output is correct
5 Correct 4 ms 8404 KB Output is correct
6 Correct 5 ms 8476 KB Output is correct
7 Correct 5 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 6 ms 8404 KB Output is correct
11 Correct 68 ms 9420 KB Output is correct
12 Correct 4 ms 8400 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 393 ms 8620 KB Output is correct
2 Correct 229 ms 8532 KB Output is correct
3 Correct 250 ms 8620 KB Output is correct
4 Correct 245 ms 8620 KB Output is correct
5 Correct 245 ms 8624 KB Output is correct
6 Correct 5 ms 8404 KB Output is correct
7 Correct 5 ms 8404 KB Output is correct
8 Correct 5 ms 8404 KB Output is correct
9 Correct 1214 ms 8616 KB Output is correct
10 Correct 5 ms 8404 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 211 ms 31600 KB Output is correct
2 Correct 30 ms 31608 KB Output is correct
3 Correct 142 ms 31696 KB Output is correct
4 Correct 66 ms 32308 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 235 ms 8564 KB Output is correct
2 Correct 231 ms 8532 KB Output is correct
3 Correct 250 ms 8624 KB Output is correct
4 Correct 276 ms 8532 KB Output is correct
5 Correct 242 ms 8616 KB Output is correct
6 Correct 195 ms 31596 KB Output is correct
7 Correct 33 ms 31504 KB Output is correct
8 Correct 114 ms 31596 KB Output is correct
9 Correct 61 ms 32308 KB Output is correct
10 Correct 29 ms 27604 KB Output is correct
11 Correct 175 ms 27724 KB Output is correct
12 Correct 270 ms 29260 KB Output is correct
13 Correct 99 ms 27708 KB Output is correct
14 Correct 29 ms 27604 KB Output is correct
15 Correct 5 ms 8404 KB Output is correct
16 Correct 4 ms 8404 KB Output is correct
17 Correct 5 ms 8472 KB Output is correct
18 Correct 5 ms 8404 KB Output is correct
19 Correct 5 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 6 ms 8480 KB Output is correct
23 Correct 4 ms 8404 KB Output is correct
24 Correct 5 ms 8404 KB Output is correct
25 Correct 68 ms 9456 KB Output is correct
26 Correct 5 ms 8404 KB Output is correct
27 Correct 1179 ms 8620 KB Output is correct
28 Correct 10311 ms 31924 KB Output is correct
29 Correct 2502 ms 27724 KB Output is correct
30 Correct 9239 ms 27804 KB Output is correct
31 Correct 2614 ms 32964 KB Output is correct
32 Correct 4 ms 8492 KB Output is correct

Subtask #6
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 235 ms 8616 KB Output is correct
2 Correct 226 ms 8620 KB Output is correct
3 Correct 236 ms 8620 KB Output is correct
4 Correct 233 ms 8616 KB Output is correct
5 Correct 240 ms 8620 KB Output is correct
6 Correct 208 ms 31596 KB Output is correct
7 Correct 36 ms 31492 KB Output is correct
8 Correct 117 ms 31592 KB Output is correct
9 Correct 72 ms 32484 KB Output is correct
10 Correct 29 ms 27604 KB Output is correct
11 Correct 200 ms 27604 KB Output is correct
12 Correct 294 ms 29224 KB Output is correct
13 Correct 102 ms 27604 KB Output is correct
14 Correct 30 ms 27696 KB Output is correct
15 Correct 662 ms 31564 KB Output is correct
16 Correct 10869 ms 34172 KB Output is correct
17 Correct 5 ms 8404 KB Output is correct
18 Correct 4 ms 8404 KB Output is correct
19 Correct 4 ms 8372 KB Output is correct
20 Correct 5 ms 8404 KB Output is correct
21 Correct 5 ms 8476 KB Output is correct
22 Correct 5 ms 8512 KB Output is correct
23 Correct 4 ms 8404 KB Output is correct
24 Correct 5 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 66 ms 10756 KB Output is correct
28 Correct 5 ms 8404 KB Output is correct
29 Correct 1130 ms 8692 KB Output is correct
30 Correct 10094 ms 36048 KB Output is correct
31 Execution timed out 20004 ms 39564 KB Time limit exceeded
32 Halted 0 ms 0 KB -