oj.uz

Submission #971449

# Submission time Handle Problem Language Result Execution time Memory
971449 2024-04-28T14:11:46 Z Pannda Rainforest Jumps (APIO21_jumps) C++17
23 / 100
 4000 ms 98172 KB 
#include "jumps.h"

#include <bits/stdc++.h>
using namespace std;

struct SegmentTree {
    struct Node {
        int sum = 0;
        int ln = 0, rn = 0;
    };

    int n;
    vector<Node> nodes;
    vector<int> roots;

    SegmentTree() {}
    SegmentTree(int n) : n(n), nodes(1), roots(1, 0) {}

    void add(int i, int delta, int base, int &idx, int l, int r) {
        idx = nodes.size();
        nodes.push_back(nodes[base]);
        nodes[idx].sum += delta;
        if (l + 1 < r) {
            int m = (l + r) >> 1;
            Node goat = nodes[idx];
            if (i < m) add(i, delta, nodes[base].ln, goat.ln, l, m);
            else add(i, delta, nodes[base].rn, goat.rn, m, r);
            nodes[idx] = goat;
        }
    }

    void add(int i, int val) {
        roots.emplace_back();
        add(i, val, roots.end()[-2], roots.end()[-1], 0, n);
    }

    int find(int ub, int idxl, int idxr) {
        auto dfs = [&](auto self, int idxl, int idxr, int l, int r) -> int {
            if (l >= ub) return -1;
            if (nodes[idxr].sum - nodes[idxl].sum == 0) return -1;
            if (l + 1 == r) return l;
            int m = (l + r) >> 1;
            int get = self(self, nodes[idxl].rn, nodes[idxr].rn, m, r);
            if (get != -1) return get;
            return self(self, nodes[idxl].ln, nodes[idxr].ln, l, m);
        };
        return dfs(dfs, idxl, idxr, 0, n);
    }
};


struct RMQ {
    static const int INF = 1e9 + 12345;
    int n, log;
    vector<vector<int>> mx;
    RMQ() {}
    RMQ(vector<int> a) : n(a.size()), log(32 - __builtin_clz(n)), mx(n, vector<int>(log, -INF)) {
        for (int i = n - 1; i >= 0; i--) {
            mx[i][0] = a[i];
            for (int k = 1; k < log; k++) {
                int j = i + (1 << (k - 1));
                mx[i][k] = max(mx[i][k - 1], j < n ? mx[j][k - 1] : -INF);
            }
        }
    }
    int getMax(int ql, int qr) {
        int k = 31 - __builtin_clz(qr - ql);
        return max(mx[ql][k], mx[qr - (1 << k)][k]);
    }
};

const int LOG = 17;
int n;
vector<int> h, ih;
RMQ rmq;
vector<vector<int>> f;
vector<int> depth;
SegmentTree seg;

void init(int N, vector<int> H) {
    n = N;
    h = H;
    ih = vector<int>(n);
    for (int i = 0; i < n; i++) {
        h[i]--;
        ih[h[i]] = i;
    }
    rmq = RMQ(h);
    h.push_back(n);
    f = vector<vector<int>>(n + 1, vector<int>(LOG, n));
    depth = vector<int>(n + 1, 0);

    vector<int> stk = { n };
    for (int i = n - 1; i >= 0; i--) {
        while (h[stk.back()] < h[i]) stk.pop_back();
        depth[i] = depth[stk.back()] + 1;
        f[i][0] = stk.back();
        stk.push_back(i);
    }

    stk.clear();
    for (int i = 0; i < n; i++) {
        while (!stk.empty() && h[stk.back()] < h[i]) stk.pop_back();
        if (!stk.empty() && depth[stk.back()] <= depth[f[i][0]]) {
            f[i][0] = stk.back();
        }
        stk.push_back(i);
    }

    for (int k = 1; k < LOG; k++) {
        for (int i = 0; i < n; i++) {
            f[i][k] = f[f[i][k - 1]][k - 1];
        }
    }

    seg = SegmentTree(n + 1);
    for (int i = 0; i < n; i++) {
        seg.add(h[i], +1);
    }
}

int minimum_jumps(int l0, int r0, int l1, int r1) {
    r0++; r1++;
    int res = n;
    for (int to = l1; to < r1; to++) {
        int from = seg.find(h[to], seg.roots[l0], seg.roots[r0]);
        if (from == -1) continue;
        from = ih[from];
        if (rmq.getMax(from, to) > h[to]) continue;
        int cnt = 0;
        for (int k = LOG - 1; k >= 0; k--) {
            int next = f[from][k];
            if (depth[next] >= depth[to] && h[next] < h[to]) {
                from = next;
                cnt += 1 << k;
            }
        }
        res = min(res, cnt + depth[from] - depth[to]);
    }
    if (res == n) return -1;
    return res;
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Execution timed out 4046 ms 86812 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 596 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Incorrect 1 ms 344 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 596 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Incorrect 1 ms 344 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 352 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 117 ms 86556 KB Output is correct
6 Correct 207 ms 97240 KB Output is correct
7 Correct 68 ms 49136 KB Output is correct
8 Correct 181 ms 97072 KB Output is correct
9 Correct 19 ms 15172 KB Output is correct
10 Correct 189 ms 95772 KB Output is correct
11 Correct 164 ms 97560 KB Output is correct
12 Correct 149 ms 96280 KB Output is correct
13 Correct 125 ms 95992 KB Output is correct
14 Correct 192 ms 95360 KB Output is correct
15 Correct 138 ms 97672 KB Output is correct
16 Correct 127 ms 96732 KB Output is correct
17 Correct 133 ms 96740 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 512 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Incorrect 1 ms 344 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 205 ms 45812 KB Output is correct
5 Correct 868 ms 97052 KB Output is correct
6 Correct 474 ms 21700 KB Output is correct
7 Correct 776 ms 96104 KB Output is correct
8 Correct 422 ms 41744 KB Output is correct
9 Correct 789 ms 95372 KB Output is correct
10 Correct 903 ms 97264 KB Output is correct
11 Correct 766 ms 97072 KB Output is correct
12 Correct 914 ms 97488 KB Output is correct
13 Correct 835 ms 97228 KB Output is correct
14 Correct 888 ms 97164 KB Output is correct
15 Correct 719 ms 97796 KB Output is correct
16 Correct 733 ms 96696 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 600 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 1 ms 600 KB Output is correct
27 Correct 10 ms 1312 KB Output is correct
28 Correct 12 ms 1316 KB Output is correct
29 Correct 10 ms 1312 KB Output is correct
30 Correct 11 ms 1312 KB Output is correct
31 Correct 13 ms 1316 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 70 ms 51552 KB Output is correct
34 Correct 148 ms 96632 KB Output is correct
35 Correct 126 ms 96296 KB Output is correct
36 Correct 137 ms 95364 KB Output is correct
37 Correct 121 ms 98172 KB Output is correct
38 Correct 123 ms 97032 KB Output is correct

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 205 ms 45812 KB Output is correct
5 Correct 868 ms 97052 KB Output is correct
6 Correct 474 ms 21700 KB Output is correct
7 Correct 776 ms 96104 KB Output is correct
8 Correct 422 ms 41744 KB Output is correct
9 Correct 789 ms 95372 KB Output is correct
10 Correct 903 ms 97264 KB Output is correct
11 Correct 766 ms 97072 KB Output is correct
12 Correct 914 ms 97488 KB Output is correct
13 Correct 835 ms 97228 KB Output is correct
14 Correct 888 ms 97164 KB Output is correct
15 Correct 719 ms 97796 KB Output is correct
16 Correct 733 ms 96696 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 600 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 1 ms 600 KB Output is correct
27 Correct 10 ms 1312 KB Output is correct
28 Correct 12 ms 1316 KB Output is correct
29 Correct 10 ms 1312 KB Output is correct
30 Correct 11 ms 1312 KB Output is correct
31 Correct 13 ms 1316 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 70 ms 51552 KB Output is correct
34 Correct 148 ms 96632 KB Output is correct
35 Correct 126 ms 96296 KB Output is correct
36 Correct 137 ms 95364 KB Output is correct
37 Correct 121 ms 98172 KB Output is correct
38 Correct 123 ms 97032 KB Output is correct
39 Correct 0 ms 344 KB Output is correct
40 Correct 0 ms 596 KB Output is correct
41 Correct 0 ms 344 KB Output is correct
42 Correct 224 ms 46220 KB Output is correct
43 Correct 756 ms 96272 KB Output is correct
44 Correct 419 ms 21160 KB Output is correct
45 Correct 815 ms 96780 KB Output is correct
46 Correct 426 ms 41132 KB Output is correct
47 Correct 761 ms 95892 KB Output is correct
48 Correct 902 ms 97820 KB Output is correct
49 Correct 807 ms 97260 KB Output is correct
50 Correct 894 ms 95972 KB Output is correct
51 Correct 767 ms 97060 KB Output is correct
52 Correct 824 ms 97672 KB Output is correct
53 Correct 668 ms 96100 KB Output is correct
54 Correct 718 ms 95964 KB Output is correct
55 Correct 0 ms 596 KB Output is correct
56 Incorrect 174 ms 96036 KB Output isn't correct
57 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Execution timed out 4046 ms 86812 KB Time limit exceeded
4 Halted 0 ms 0 KB -