oj.uz

답안 #679967

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
679967 2023-01-09T17:07:45 Z bashkort 웜뱃 (IOI13_wombats) C++17
76 / 100
 20000 ms 19520 KB 
#include <bits/stdc++.h>
#include "wombats.h"

using namespace std;

inline void ckmin(int &a, int b) {
    if (a > b) a = b;
}

constexpr int B = 777, 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 a = 0; a < c; ++a) {
        for (int b = 0; b < c; ++b) {
            for (int cc = 0; cc < c; ++cc) {
                ckmin(dp[L][a][cc], fr[L][a][b] + V[(L + 1) * B - 1][b] + dp[L + 1][b][cc]);
            }
        }
    }
}

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 cc = 0; cc < c; ++cc) {
            for (int a = 0; a < c - 1; ++a) {
                ckmin(fr[L][a + 1][cc], fr[L][a][cc] + H[i][a]);
            }
            for (int a = c - 2; a >= 0; --a) {
                ckmin(fr[L][a][cc], fr[L][a + 1][cc] + H[i][a]);
            }
            if (i != lim) {
                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

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 14164 KB Output is correct
2 Correct 25 ms 14244 KB Output is correct
3 Correct 81 ms 15780 KB Output is correct
4 Correct 17 ms 14228 KB Output is correct
5 Correct 12 ms 14244 KB Output is correct
6 Correct 5 ms 8376 KB Output is correct
7 Correct 4 ms 8404 KB Output is correct
8 Correct 5 ms 8464 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8404 KB Output is correct
2 Correct 6 ms 8404 KB Output is correct
3 Correct 5 ms 8392 KB Output is correct
4 Correct 5 ms 8404 KB Output is correct
5 Correct 5 ms 8404 KB Output is correct
6 Correct 6 ms 8464 KB Output is correct
7 Correct 4 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 8404 KB Output is correct
11 Correct 67 ms 9392 KB Output is correct
12 Correct 6 ms 8404 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 529 ms 8612 KB Output is correct
2 Correct 422 ms 8612 KB Output is correct
3 Correct 544 ms 8620 KB Output is correct
4 Correct 522 ms 8632 KB Output is correct
5 Correct 520 ms 8616 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 8356 KB Output is correct
9 Correct 2624 ms 8628 KB Output is correct
10 Correct 4 ms 8456 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 18108 KB Output is correct
2 Correct 17 ms 18132 KB Output is correct
3 Correct 23 ms 18132 KB Output is correct
4 Correct 49 ms 18892 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 556 ms 8608 KB Output is correct
2 Correct 434 ms 8612 KB Output is correct
3 Correct 550 ms 8628 KB Output is correct
4 Correct 531 ms 8612 KB Output is correct
5 Correct 568 ms 8596 KB Output is correct
6 Correct 25 ms 18132 KB Output is correct
7 Correct 19 ms 18132 KB Output is correct
8 Correct 26 ms 18148 KB Output is correct
9 Correct 59 ms 18864 KB Output is correct
10 Correct 13 ms 14144 KB Output is correct
11 Correct 21 ms 14248 KB Output is correct
12 Correct 92 ms 15740 KB Output is correct
13 Correct 22 ms 14244 KB Output is correct
14 Correct 15 ms 14192 KB Output is correct
15 Correct 5 ms 8408 KB Output is correct
16 Correct 4 ms 8408 KB Output is correct
17 Correct 4 ms 8404 KB Output is correct
18 Correct 6 ms 8420 KB Output is correct
19 Correct 5 ms 8404 KB Output is correct
20 Correct 5 ms 8404 KB Output is correct
21 Correct 6 ms 8404 KB Output is correct
22 Correct 5 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 68 ms 9460 KB Output is correct
26 Correct 5 ms 8404 KB Output is correct
27 Correct 2652 ms 8624 KB Output is correct
28 Correct 19578 ms 18468 KB Output is correct
29 Correct 18677 ms 16964 KB Output is correct
30 Correct 16267 ms 16772 KB Output is correct
31 Correct 19994 ms 19520 KB Output is correct
32 Correct 4 ms 8404 KB Output is correct

Subtask #6
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 535 ms 8612 KB Output is correct
2 Correct 418 ms 8532 KB Output is correct
3 Correct 593 ms 8616 KB Output is correct
4 Correct 534 ms 8612 KB Output is correct
5 Correct 540 ms 8608 KB Output is correct
6 Correct 28 ms 18132 KB Output is correct
7 Correct 18 ms 18156 KB Output is correct
8 Correct 29 ms 18132 KB Output is correct
9 Correct 61 ms 18932 KB Output is correct
10 Correct 15 ms 14120 KB Output is correct
11 Correct 29 ms 14120 KB Output is correct
12 Correct 96 ms 15812 KB Output is correct
13 Correct 20 ms 14248 KB Output is correct
14 Correct 13 ms 14240 KB Output is correct
15 Correct 975 ms 18128 KB Output is correct
16 Execution timed out 20061 ms 18484 KB Time limit exceeded
17 Halted 0 ms 0 KB -