oj.uz

답안 #680063

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
680063 2023-01-09T20:54:30 Z bashkort 웜뱃 (IOI13_wombats) C++17
100 / 100
 10336 ms 78232 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 = 50, R = 5000, C = 200, K = (R + B - 1) / B;
const int N = K * 2;

int r, c, need, sz = 1;
int dp[2 * N][C][C], fr[N][C][C], H[R][C], V[R][C];


void pull(int x) {
    memset(dp[x], 0x3f, sizeof(dp[x]));

    if (dp[x << 1 | 1][0][0] == -1) {
        memcpy(dp[x], dp[x << 1], sizeof(dp[x]));
        return;
    }

    for (int cc = 0; cc < c; ++cc) {
        auto solve = [&](auto solve, int l, int r, int optl, int optr) -> void {
            if (l >= r) {
                return;
            }

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

            int opt = optl;

            for (int b = optl; b <= optr; ++b) {
                if (ckmin(dp[x][cc][mid], dp[x << 1][cc][b] + dp[x << 1 | 1][b][mid])) {
                    opt = b;
                }
            }

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

void update_fr(int L) {
    if (L < 0) {
        return;
    }

    int lim = max(0, B * L - 1);

    if (lim < r) {
        memset(fr[L], 0x3f, sizeof(fr[L]));
        for (int a = 0; a < c; ++a) {
            fr[L][a][a] = 0;
        }

        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 a = 0; a < c; ++a) {
                    for (int cc = 0; cc < c; ++cc) {
                        fr[L][a][cc] += V[i - 1][a];
                    }
                }
            }
        }
    } else {
        memset(fr[L], -1, sizeof(fr[L]));
    }

    memcpy(dp[sz + L], fr[L], sizeof(dp[sz + L]));

    for (int x = sz + L; x >>= 1;) {
        pull(x);
    }
}

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 = 1 + r / B;
    sz = 1 << __lg(need) + bool(need & (need - 1));
    for (int i = 0; i < sz; ++i) {
        update_fr(i);
    }
}

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

    int L = P / B;

    update_fr(L);
    if ((P + 1) % B == 0 && L + 1 < need) {
        update_fr(L + 1);
    }
}

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

    int L = (P + 1) / B;

    update_fr(L);
}

int escape(int V1, int V2) {
    return dp[1][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;
      |      ^~~
wombats.cpp: In function 'void init(int, int, int (*)[200], int (*)[200])':
wombats.cpp:95:26: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
   95 |     sz = 1 << __lg(need) + bool(need & (need - 1));
      |               ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 59 ms 72020 KB Output is correct
2 Correct 60 ms 72112 KB Output is correct
3 Correct 120 ms 73576 KB Output is correct
4 Correct 72 ms 72012 KB Output is correct
5 Correct 64 ms 72020 KB Output is correct
6 Correct 4 ms 8404 KB Output is correct
7 Correct 6 ms 8404 KB Output is correct
8 Correct 4 ms 8404 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8404 KB Output is correct
2 Correct 5 ms 8404 KB Output is correct
3 Correct 4 ms 8352 KB Output is correct
4 Correct 5 ms 8404 KB Output is correct
5 Correct 5 ms 8404 KB Output is correct
6 Correct 5 ms 8404 KB Output is correct
7 Correct 5 ms 8404 KB Output is correct
8 Correct 4 ms 8404 KB Output is correct
9 Correct 5 ms 8404 KB Output is correct
10 Correct 5 ms 8396 KB Output is correct
11 Correct 68 ms 9488 KB Output is correct
12 Correct 5 ms 8476 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 174 ms 9100 KB Output is correct
2 Correct 173 ms 9044 KB Output is correct
3 Correct 202 ms 10036 KB Output is correct
4 Correct 216 ms 10036 KB Output is correct
5 Correct 199 ms 9940 KB Output is correct
6 Correct 4 ms 8404 KB Output is correct
7 Correct 5 ms 8404 KB Output is correct
8 Correct 4 ms 8404 KB Output is correct
9 Correct 928 ms 10024 KB Output is correct
10 Correct 6 ms 8404 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 73 ms 75920 KB Output is correct
2 Correct 64 ms 75860 KB Output is correct
3 Correct 92 ms 75912 KB Output is correct
4 Correct 93 ms 76680 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 168 ms 9088 KB Output is correct
2 Correct 165 ms 9044 KB Output is correct
3 Correct 202 ms 10040 KB Output is correct
4 Correct 237 ms 10024 KB Output is correct
5 Correct 220 ms 10024 KB Output is correct
6 Correct 92 ms 75868 KB Output is correct
7 Correct 58 ms 75912 KB Output is correct
8 Correct 76 ms 75916 KB Output is correct
9 Correct 122 ms 76636 KB Output is correct
10 Correct 63 ms 72020 KB Output is correct
11 Correct 63 ms 72008 KB Output is correct
12 Correct 121 ms 73612 KB Output is correct
13 Correct 72 ms 72020 KB Output is correct
14 Correct 61 ms 71948 KB Output is correct
15 Correct 6 ms 8404 KB Output is correct
16 Correct 4 ms 8404 KB Output is correct
17 Correct 4 ms 8404 KB Output is correct
18 Correct 6 ms 8404 KB Output is correct
19 Correct 4 ms 8404 KB Output is correct
20 Correct 4 ms 8404 KB Output is correct
21 Correct 6 ms 8404 KB Output is correct
22 Correct 5 ms 8392 KB Output is correct
23 Correct 5 ms 8404 KB Output is correct
24 Correct 5 ms 8408 KB Output is correct
25 Correct 69 ms 9464 KB Output is correct
26 Correct 5 ms 8404 KB Output is correct
27 Correct 961 ms 10020 KB Output is correct
28 Correct 2334 ms 76184 KB Output is correct
29 Correct 2628 ms 74872 KB Output is correct
30 Correct 2270 ms 74844 KB Output is correct
31 Correct 2778 ms 77256 KB Output is correct
32 Correct 6 ms 8372 KB Output is correct

Subtask #6
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 229 ms 9088 KB Output is correct
2 Correct 172 ms 9088 KB Output is correct
3 Correct 236 ms 10036 KB Output is correct
4 Correct 292 ms 9944 KB Output is correct
5 Correct 221 ms 10040 KB Output is correct
6 Correct 91 ms 75860 KB Output is correct
7 Correct 95 ms 75916 KB Output is correct
8 Correct 99 ms 75832 KB Output is correct
9 Correct 140 ms 76720 KB Output is correct
10 Correct 83 ms 71944 KB Output is correct
11 Correct 66 ms 71932 KB Output is correct
12 Correct 149 ms 73548 KB Output is correct
13 Correct 111 ms 72008 KB Output is correct
14 Correct 75 ms 72016 KB Output is correct
15 Correct 2202 ms 75868 KB Output is correct
16 Correct 10336 ms 78232 KB Output is correct
17 Correct 6 ms 8368 KB Output is correct
18 Correct 5 ms 8384 KB Output is correct
19 Correct 7 ms 8404 KB Output is correct
20 Correct 7 ms 8404 KB Output is correct
21 Correct 6 ms 8404 KB Output is correct
22 Correct 7 ms 8404 KB Output is correct
23 Correct 6 ms 8404 KB Output is correct
24 Correct 5 ms 8404 KB Output is correct
25 Correct 5 ms 8412 KB Output is correct
26 Correct 6 ms 8404 KB Output is correct
27 Correct 90 ms 9684 KB Output is correct
28 Correct 7 ms 8500 KB Output is correct
29 Correct 1035 ms 10120 KB Output is correct
30 Correct 2432 ms 76696 KB Output is correct
31 Correct 9979 ms 77000 KB Output is correct
32 Correct 10272 ms 76804 KB Output is correct
33 Correct 2482 ms 75176 KB Output is correct
34 Correct 9454 ms 75572 KB Output is correct
35 Correct 2293 ms 75052 KB Output is correct
36 Correct 8725 ms 75468 KB Output is correct
37 Correct 2498 ms 77464 KB Output is correct
38 Correct 9691 ms 77568 KB Output is correct
39 Correct 4 ms 8404 KB Output is correct
40 Correct 10165 ms 75496 KB Output is correct