oj.uz

Submission #1067825

# Submission time Handle Problem Language Result Execution time Memory
1067825 2024-08-21T04:03:22 Z Plurm Wombats (IOI13_wombats) C++11
76 / 100
 20000 ms 24976 KB 
#include "wombats.h"
#include <bits/stdc++.h>
using namespace std;

int block_size;
int num_blocks;
int global_H[5000][200];
int global_V[5000][200];
int qsr[5000][200];
int C;
class BlockAnswer {
  public:
    vector<vector<int>> ans;
    int rs, rt;
    BlockAnswer(int r1, int r2) {
        rs = r1;
        rt = r2;
        ans.resize(C);
        for (int i = 0; i < C; i++) {
            ans[i].resize(C, 1000000000);
        }
    }
    virtual void update_i(int col) {
        vector<int> dpst;
        dpst.resize(C, 1000000000);
        dpst[col] = 0;
        for (int row = rs; row <= rt; row++) {
            vector<int> dpnw;
            dpnw.resize(C, 1000000000);
            int pref = 1000000000;
            for (int nc = 0; nc < C; nc++) {
                pref = min(pref, dpst[nc] - qsr[row][nc]);
                dpnw[nc] =
                    min(dpnw[nc], pref + qsr[row][nc] + global_V[row][nc]);
            }
            pref = 1000000000;
            for (int nc = C - 1; nc >= 0; nc--) {
                pref = min(pref, dpst[nc] + qsr[row][nc]);
                dpnw[nc] =
                    min(dpnw[nc], pref - qsr[row][nc] + global_V[row][nc]);
            }
            swap(dpst, dpnw);
        }
        ans[col] = dpst;
    }
    void update() {
        for (int i = 0; i < C; i++) {
            update_i(i);
        }
    }
};
vector<BlockAnswer> blans;
void dcopt(vector<int> &dpnw, vector<int> &dpst, vector<vector<int>> &cost,
           int ltarget, int rtarget, int lfound, int rfound) {
    if (ltarget > rtarget)
        return;
    int mid = (ltarget + rtarget) / 2;
    int idx = -1;
    for (int oc = lfound; oc <= rfound; oc++) {
        if (dpst[oc] + cost[oc][mid] < dpnw[mid]) {
            dpnw[mid] = dpst[oc] + cost[oc][mid];
            idx = oc;
        }
    }
    dcopt(dpnw, dpst, cost, ltarget, mid - 1, lfound, idx);
    dcopt(dpnw, dpst, cost, mid + 1, rtarget, idx, rfound);
}
class GlobalAnswer : public BlockAnswer {
  public:
    GlobalAnswer() : BlockAnswer(0, 0) {}
    void update_i(int col) override {
        vector<int> dpst;
        dpst.resize(C, 1000000000);
        dpst[col] = 0;
        for (int blk = 0; blk < num_blocks; blk++) {
            vector<int> dpnw;
            dpnw.resize(C, 1000000000);
            // DC opt?
            dcopt(dpnw, dpst, blans[blk].ans, 0, C - 1, 0, C - 1);
            swap(dpst, dpnw);
        }
        ans[col] = dpst;
    }
};
GlobalAnswer *glob;
void init(int R, int C, int H[5000][200], int V[5000][200]) {
    block_size = sqrt(1.5 * R * max(1.0, log2(C)));
    num_blocks = (R + block_size - 1) / block_size;
    ::C = C;
    memcpy(global_H, H, 5000 * 200 * 4);
    memcpy(global_V, V, 5000 * 200 * 4);
    for (int j = 0; j < C; j++)
        global_V[R - 1][j] = 0;
    for (int j = 0; j < R; j++) {
        qsr[j][0] = 0;
        for (int i = 0; i < C - 1; i++) {
            qsr[j][i + 1] = qsr[j][i] + global_H[j][i];
        }
    }
    for (int i = 0; i < num_blocks; i++) {
        int r1 = i * block_size;
        int r2 = min((i + 1) * block_size - 1, R - 1);
        blans.emplace_back(r1, r2);
        blans.back().update();
    }
    glob = new GlobalAnswer();
    glob->update();
}

void changeH(int P, int Q, int W) {
    global_H[P][Q] = W;
    for (int i = 0; i < C - 1; i++) {
        qsr[P][i + 1] = qsr[P][i] + global_H[P][i];
    }
    blans[P / block_size].update();
    glob->update();
}

void changeV(int P, int Q, int W) {
    global_V[P][Q] = W;
    blans[P / block_size].update();
    glob->update();
}

int escape(int V1, int V2) { return glob->ans[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 9 ms 15960 KB Output is correct
2 Correct 8 ms 15964 KB Output is correct
3 Correct 83 ms 17684 KB Output is correct
4 Correct 10 ms 15964 KB Output is correct
5 Correct 9 ms 15964 KB Output is correct
6 Correct 4 ms 8284 KB Output is correct
7 Correct 4 ms 8284 KB Output is correct
8 Correct 5 ms 8284 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 8284 KB Output is correct
2 Correct 3 ms 8280 KB Output is correct
3 Correct 4 ms 8284 KB Output is correct
4 Correct 6 ms 8112 KB Output is correct
5 Correct 6 ms 8284 KB Output is correct
6 Correct 5 ms 8284 KB Output is correct
7 Correct 6 ms 8280 KB Output is correct
8 Correct 5 ms 8284 KB Output is correct
9 Correct 4 ms 8152 KB Output is correct
10 Correct 4 ms 8284 KB Output is correct
11 Correct 42 ms 9076 KB Output is correct
12 Correct 4 ms 8280 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 163 ms 8540 KB Output is correct
2 Correct 134 ms 8540 KB Output is correct
3 Correct 144 ms 8540 KB Output is correct
4 Correct 167 ms 8540 KB Output is correct
5 Correct 167 ms 8540 KB Output is correct
6 Correct 4 ms 8284 KB Output is correct
7 Correct 4 ms 8280 KB Output is correct
8 Correct 4 ms 8284 KB Output is correct
9 Correct 668 ms 8540 KB Output is correct
10 Correct 4 ms 8284 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 19804 KB Output is correct
2 Correct 12 ms 19884 KB Output is correct
3 Correct 13 ms 19804 KB Output is correct
4 Correct 37 ms 20664 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 125 ms 8716 KB Output is correct
2 Correct 190 ms 8536 KB Output is correct
3 Correct 172 ms 8536 KB Output is correct
4 Correct 173 ms 8720 KB Output is correct
5 Correct 137 ms 8536 KB Output is correct
6 Correct 13 ms 19800 KB Output is correct
7 Correct 13 ms 19804 KB Output is correct
8 Correct 13 ms 20016 KB Output is correct
9 Correct 59 ms 20564 KB Output is correct
10 Correct 9 ms 15964 KB Output is correct
11 Correct 9 ms 15964 KB Output is correct
12 Correct 47 ms 17512 KB Output is correct
13 Correct 8 ms 15964 KB Output is correct
14 Correct 8 ms 15964 KB Output is correct
15 Correct 5 ms 8284 KB Output is correct
16 Correct 4 ms 8284 KB Output is correct
17 Correct 3 ms 8284 KB Output is correct
18 Correct 4 ms 8284 KB Output is correct
19 Correct 4 ms 8284 KB Output is correct
20 Correct 4 ms 8284 KB Output is correct
21 Correct 5 ms 8100 KB Output is correct
22 Correct 4 ms 8284 KB Output is correct
23 Correct 4 ms 8284 KB Output is correct
24 Correct 6 ms 8312 KB Output is correct
25 Correct 44 ms 9156 KB Output is correct
26 Correct 4 ms 8280 KB Output is correct
27 Correct 718 ms 8724 KB Output is correct
28 Correct 4592 ms 21328 KB Output is correct
29 Correct 4506 ms 19080 KB Output is correct
30 Correct 4270 ms 19112 KB Output is correct
31 Correct 4890 ms 22384 KB Output is correct
32 Correct 4 ms 8536 KB Output is correct

Subtask #6
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 132 ms 8540 KB Output is correct
2 Correct 134 ms 8536 KB Output is correct
3 Correct 141 ms 8540 KB Output is correct
4 Correct 137 ms 8740 KB Output is correct
5 Correct 141 ms 8712 KB Output is correct
6 Correct 13 ms 19804 KB Output is correct
7 Correct 13 ms 19804 KB Output is correct
8 Correct 13 ms 19836 KB Output is correct
9 Correct 33 ms 20688 KB Output is correct
10 Correct 9 ms 16000 KB Output is correct
11 Correct 10 ms 15924 KB Output is correct
12 Correct 46 ms 17492 KB Output is correct
13 Correct 9 ms 15960 KB Output is correct
14 Correct 12 ms 15964 KB Output is correct
15 Correct 800 ms 23376 KB Output is correct
16 Execution timed out 20062 ms 24976 KB Time limit exceeded
17 Halted 0 ms 0 KB -