oj.uz

Submission #416418

# Submission time Handle Problem Language Result Execution time Memory
416418 2021-06-02T11:17:55 Z valerikk Rainforest Jumps (APIO21_jumps) C++17
33 / 100
 4000 ms 41204 KB 
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef long double ld;

const int N = 2e5 + 7;
const int L = 19;
const int INF = 1e9;

int n;
int h[N];
pair<int, int> t[4 * N];

void tree_build(int v, int l, int r) {
    if (r - l == 1) {
        t[v] = {h[l], l};
    } else {
        int mid = (l + r) / 2;
        tree_build(2 * v, l, mid);
        tree_build(2 * v + 1, mid, r);
        t[v] = max(t[2 * v], t[2 * v + 1]);
    }
}

pair<int, int> get_max(int v, int l, int r, int a, int b) {
    if (l >= b || r <= a) return {-INF, -INF};
    if (l >= a && r <= b) return t[v];
    int mid = (l + r) / 2;
    return max(get_max(2 * v, l, mid, a, b), get_max(2 * v + 1, mid, r, a, b));
}

int find_first(int v, int l, int r, int a, int b, int val) {
    if (l >= b || r <= a || t[v].first <= val) return -1;
    if (r - l == 1) return l;
    int mid = (l + r) / 2;
    int res = find_first(2 * v + 1, mid, r, a, b, val);
    if (res == -1) res = find_first(2 * v, l, mid, a, b, val);
    return res;
}

vector<vector<int>> build(vector<int> arr) {
    vector<vector<int>> go(L, vector<int>(n));
    for (int i = 0; i < n; ++i) go[0][i] = arr[i];
    for (int i = 1; i < L; ++i) {
        for (int j = 0; j < n; ++j) go[i][j] = go[i - 1][go[i - 1][j]];
    }
    return go;
}

vector<int> l, r, best;
vector<vector<int>> r2, best2;

void init(int N, vector<int> H) {
    n = N + 2;
    h[0] = n - 2;
    h[n - 1] = n - 1;
    for (int i = 0; i < N; ++i) h[i + 1] = H[i] - 1;
    l.resize(n);
    r.resize(n);
    best.resize(n);
    vector<int> st;
    for (int i = 0; i < n; ++i) {
        while (!st.empty() && h[st.back()] < h[i]) {
            r[st.back()] = i;
            st.pop_back();
        }
        st.push_back(i);
    }
    for (auto i : st) r[i] = n - 1;
    st.clear();
    for (int i = n - 1; i >= 0; --i) {
        while (!st.empty() && h[st.back()] < h[i]) {
            l[st.back()] = i;
            st.pop_back();
        }
        st.push_back(i);
    }
    for (auto i : st) l[i] = 0;
    st.clear();
    for (int i = 0; i < n; ++i) best[i] = h[l[i]] > h[r[i]] ? l[i] : r[i];
    r2 = build(r);
    best2 = build(best);
    tree_build(1, 0, n);
}

int minimum_jumps(int A, int B, int C, int D) {
    ++A, ++B, ++C, ++D;
    int mx = get_max(1, 0, n, C, D + 1).first;
    int mx2 = get_max(1, 0, n, B + 1, C).first;
    //cout << A << " " << B << " " << C << " " << D << " " << mx << " " << mx2 << " " << h[B] << endl;
    if (h[B] > mx || mx2 > mx) return -1;
    int min_pos = find_first(1, 0, n, 0, B + 1, mx);
    A = max(A, min_pos + 1);
    int st = get_max(1, 0, n, A, B + 1).second;
    int id = st, res = 0;
    /*for (int i = L - 1; i >= 0; --i) {
        if (h[best2[i][id]] < mx2) {
            id = best2[i][id];
            res += (1 << i);
        }
    }
    if (h[id] < mx2 && h[best[id]] < mx) {
        id = best[id];
        ++res;
    }
    for (int i = L - 1; i >= 0; --i) {
        if (h[r2[i][id]] < mx2) {
            id = r2[i][id];
            res += (1 << i);
        }
    }
    if (h[id] < mx2) {
        id = r[id];
        ++res;
    }*/
    while (h[id] < mx2) {
        ++res;
        if (h[best[id]] < mx) id = best[id]; else id = r[id];
    }
    id = r[id];
    ++res;
    //assert(id >= C && id <= D);
    return res;
}

int correct_minimum_jumps(int A, int B, int C, int D) {
    ++A, ++B, ++C, ++D;
    vector<int> dist(n, INF);
    vector<int> q;
    for (int i = A; i <= B; ++i) {
        q.push_back(i);
        dist[i] = 0;
    }
    for (int i = 0; i < q.size(); ++i) {
        int v = q[i];
        if (dist[v] + 1 < dist[l[v]]) {
            dist[l[v]] = dist[v] + 1;
            q.push_back(l[v]);
        }
        if (dist[v] + 1 < dist[r[v]]) {
            dist[r[v]] = dist[v] + 1;
            q.push_back(r[v]);
        }
    }
    int mn = INF;
    for (int i = C; i <= D; ++i) mn = min(mn, dist[i]);
    return mn == INF ? -1 : mn;
}

#ifdef LOCAL
int main() {
    freopen("input.txt", "r", stdin);
    ios::sync_with_stdio(false);
    cin.tie(0);
    if (0) {
        int N, Q;
        cin >> N >> Q;
        vector<int> H(N);
        for (int i = 0; i < N; ++i) cin >> H[i];
        init(N, H);
        while (Q--) {
            int A, B, C, D;
            cin >> A >> B >> C >> D;
            cout << minimum_jumps(A, B, C, D) << endl;
        }
    } else {
        srand(0);
        int N = 12, Q = 100000;
        vector<int> H(N);
        iota(H.begin(), H.end(), 1);
        random_shuffle(H.begin(), H.end());
        init(N, H);
        while (Q--) {
            vector<int> v;
            for (int i = 0; i < 4; ++i) v.push_back(rand() % N);
            sort(v.begin(), v.end());
            if (v[1] == v[2]) continue;
            int A = v[0], B = v[1], C = v[2], D = v[3];
            int ans = minimum_jumps(A, B, C, D);
            int correct_ans = correct_minimum_jumps(A, B, C, D);
            if (ans != correct_ans) {
                cout << N << " 1" << endl;
                for (int i = 0; i < N; ++i) cout << H[i] << " ";
                cout << endl;
                cout << A << " " << B << " " << C << " " << D << endl;
                cout << ans << " " << correct_ans << endl;
                return 0;
            }
        }
    }
    return 0;
}
#endif

Compilation message

jumps.cpp: In function 'int correct_minimum_jumps(int, int, int, int)':
jumps.cpp:135:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  135 |     for (int i = 0; i < q.size(); ++i) {
      |                     ~~^~~~~~~~~~

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 1435 ms 33708 KB Output is correct
4 Execution timed out 4088 ms 41188 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 0 ms 200 KB Output is correct
4 Correct 0 ms 200 KB Output is correct
5 Correct 2 ms 200 KB Output is correct
6 Correct 3 ms 328 KB Output is correct
7 Correct 3 ms 328 KB Output is correct
8 Correct 2 ms 328 KB Output is correct
9 Correct 1 ms 328 KB Output is correct
10 Correct 3 ms 328 KB Output is correct
11 Correct 4 ms 328 KB Output is correct
12 Correct 4 ms 328 KB Output is correct
13 Correct 2 ms 328 KB Output is correct
14 Correct 4 ms 328 KB Output is correct
15 Correct 2 ms 292 KB Output is correct
16 Correct 5 ms 328 KB Output is correct
17 Correct 3 ms 328 KB Output is correct
18 Correct 1 ms 200 KB Output is correct
19 Correct 3 ms 200 KB Output is correct
20 Correct 3 ms 328 KB Output is correct
21 Correct 3 ms 328 KB Output is correct
22 Correct 4 ms 328 KB Output is correct
23 Correct 3 ms 328 KB Output is correct
24 Correct 2 ms 328 KB Output is correct
25 Correct 0 ms 200 KB Output is correct
26 Correct 0 ms 200 KB Output is correct
27 Correct 2 ms 200 KB Output is correct
28 Correct 4 ms 328 KB Output is correct
29 Correct 4 ms 328 KB Output is correct
30 Correct 4 ms 328 KB Output is correct
31 Correct 3 ms 328 KB Output is correct
32 Correct 2 ms 328 KB Output is correct
33 Correct 0 ms 200 KB Output is correct
34 Correct 0 ms 328 KB Output is correct
35 Correct 1 ms 328 KB Output is correct
36 Correct 1 ms 448 KB Output is correct
37 Correct 1 ms 328 KB Output is correct
38 Correct 1 ms 328 KB Output is correct
39 Correct 1 ms 328 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 0 ms 200 KB Output is correct
4 Correct 0 ms 200 KB Output is correct
5 Correct 2 ms 200 KB Output is correct
6 Correct 3 ms 328 KB Output is correct
7 Correct 3 ms 328 KB Output is correct
8 Correct 2 ms 328 KB Output is correct
9 Correct 1 ms 328 KB Output is correct
10 Correct 3 ms 328 KB Output is correct
11 Correct 4 ms 328 KB Output is correct
12 Correct 4 ms 328 KB Output is correct
13 Correct 2 ms 328 KB Output is correct
14 Correct 4 ms 328 KB Output is correct
15 Correct 2 ms 292 KB Output is correct
16 Correct 5 ms 328 KB Output is correct
17 Correct 3 ms 328 KB Output is correct
18 Correct 1 ms 200 KB Output is correct
19 Correct 3 ms 200 KB Output is correct
20 Correct 3 ms 328 KB Output is correct
21 Correct 3 ms 328 KB Output is correct
22 Correct 4 ms 328 KB Output is correct
23 Correct 3 ms 328 KB Output is correct
24 Correct 2 ms 328 KB Output is correct
25 Correct 0 ms 200 KB Output is correct
26 Correct 0 ms 200 KB Output is correct
27 Correct 2 ms 200 KB Output is correct
28 Correct 4 ms 328 KB Output is correct
29 Correct 4 ms 328 KB Output is correct
30 Correct 4 ms 328 KB Output is correct
31 Correct 3 ms 328 KB Output is correct
32 Correct 2 ms 328 KB Output is correct
33 Correct 0 ms 200 KB Output is correct
34 Correct 0 ms 328 KB Output is correct
35 Correct 1 ms 328 KB Output is correct
36 Correct 1 ms 448 KB Output is correct
37 Correct 1 ms 328 KB Output is correct
38 Correct 1 ms 328 KB Output is correct
39 Correct 1 ms 328 KB Output is correct
40 Correct 1 ms 200 KB Output is correct
41 Correct 1 ms 200 KB Output is correct
42 Correct 0 ms 200 KB Output is correct
43 Correct 1 ms 328 KB Output is correct
44 Correct 2 ms 200 KB Output is correct
45 Correct 4 ms 328 KB Output is correct
46 Correct 3 ms 328 KB Output is correct
47 Correct 2 ms 384 KB Output is correct
48 Correct 2 ms 328 KB Output is correct
49 Correct 4 ms 328 KB Output is correct
50 Correct 3 ms 328 KB Output is correct
51 Correct 3 ms 328 KB Output is correct
52 Correct 2 ms 328 KB Output is correct
53 Correct 4 ms 328 KB Output is correct
54 Correct 3 ms 328 KB Output is correct
55 Correct 3 ms 328 KB Output is correct
56 Correct 3 ms 328 KB Output is correct
57 Correct 1 ms 328 KB Output is correct
58 Correct 17 ms 584 KB Output is correct
59 Correct 14 ms 700 KB Output is correct
60 Correct 5 ms 456 KB Output is correct
61 Correct 24 ms 584 KB Output is correct
62 Correct 12 ms 328 KB Output is correct
63 Correct 19 ms 584 KB Output is correct
64 Correct 25 ms 688 KB Output is correct
65 Correct 16 ms 716 KB Output is correct
66 Correct 21 ms 692 KB Output is correct
67 Correct 20 ms 684 KB Output is correct
68 Correct 23 ms 584 KB Output is correct
69 Correct 27 ms 692 KB Output is correct
70 Correct 22 ms 584 KB Output is correct
71 Correct 0 ms 200 KB Output is correct
72 Correct 1 ms 200 KB Output is correct
73 Correct 3 ms 328 KB Output is correct
74 Correct 2 ms 328 KB Output is correct
75 Correct 2 ms 328 KB Output is correct
76 Correct 3 ms 328 KB Output is correct
77 Correct 3 ms 328 KB Output is correct
78 Correct 1 ms 200 KB Output is correct
79 Correct 0 ms 200 KB Output is correct
80 Correct 2 ms 200 KB Output is correct
81 Correct 3 ms 328 KB Output is correct
82 Correct 3 ms 328 KB Output is correct
83 Correct 2 ms 328 KB Output is correct
84 Correct 2 ms 328 KB Output is correct
85 Correct 2 ms 328 KB Output is correct
86 Correct 0 ms 200 KB Output is correct
87 Correct 1 ms 328 KB Output is correct
88 Correct 1 ms 328 KB Output is correct
89 Correct 1 ms 328 KB Output is correct
90 Correct 1 ms 328 KB Output is correct
91 Correct 1 ms 328 KB Output is correct
92 Correct 1 ms 328 KB Output is correct
93 Correct 1 ms 328 KB Output is correct
94 Correct 4 ms 328 KB Output is correct
95 Correct 19 ms 584 KB Output is correct
96 Correct 21 ms 712 KB Output is correct
97 Correct 25 ms 704 KB Output is correct
98 Correct 27 ms 584 KB Output is correct
99 Correct 14 ms 584 KB Output is correct
100 Correct 1 ms 328 KB Output is correct
101 Correct 2 ms 328 KB Output is correct
102 Correct 20 ms 584 KB Output is correct
103 Correct 25 ms 584 KB Output is correct
104 Correct 17 ms 584 KB Output is correct
105 Correct 15 ms 696 KB Output is correct
106 Correct 18 ms 584 KB Output is correct
107 Correct 1 ms 328 KB Output is correct
108 Correct 1 ms 456 KB Output is correct
109 Correct 2 ms 584 KB Output is correct
110 Correct 2 ms 584 KB Output is correct
111 Correct 2 ms 584 KB Output is correct
112 Correct 1 ms 584 KB Output is correct
113 Correct 1 ms 584 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 52 ms 33388 KB Output is correct
6 Correct 64 ms 40352 KB Output is correct
7 Correct 30 ms 20728 KB Output is correct
8 Correct 63 ms 40388 KB Output is correct
9 Correct 12 ms 6216 KB Output is correct
10 Correct 64 ms 40408 KB Output is correct
11 Correct 61 ms 41196 KB Output is correct
12 Correct 67 ms 41036 KB Output is correct
13 Correct 57 ms 41012 KB Output is correct
14 Correct 63 ms 40356 KB Output is correct
15 Correct 67 ms 40844 KB Output is correct
16 Correct 60 ms 41084 KB Output is correct
17 Correct 57 ms 41060 KB Output is correct
18 Correct 0 ms 200 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 2 ms 328 KB Output is correct
21 Correct 1 ms 328 KB Output is correct
22 Correct 1 ms 328 KB Output is correct
23 Correct 1 ms 328 KB Output is correct
24 Correct 1 ms 328 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 1 ms 456 KB Output is correct
27 Correct 1 ms 584 KB Output is correct
28 Correct 1 ms 712 KB Output is correct
29 Correct 2 ms 696 KB Output is correct
30 Correct 3 ms 584 KB Output is correct
31 Correct 2 ms 584 KB Output is correct
32 Correct 1 ms 200 KB Output is correct
33 Correct 66 ms 40324 KB Output is correct
34 Correct 63 ms 40356 KB Output is correct
35 Correct 56 ms 40972 KB Output is correct
36 Correct 61 ms 40444 KB Output is correct
37 Correct 71 ms 40792 KB Output is correct
38 Correct 59 ms 41188 KB Output is correct
39 Correct 1 ms 200 KB Output is correct
40 Correct 36 ms 23180 KB Output is correct
41 Correct 78 ms 40364 KB Output is correct
42 Correct 73 ms 41024 KB Output is correct
43 Correct 60 ms 40352 KB Output is correct
44 Correct 56 ms 40800 KB Output is correct
45 Correct 58 ms 41136 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 276 ms 18860 KB Output is correct
5 Correct 1130 ms 40440 KB Output is correct
6 Correct 756 ms 7236 KB Output is correct
7 Correct 1110 ms 40456 KB Output is correct
8 Correct 644 ms 14720 KB Output is correct
9 Correct 1174 ms 40428 KB Output is correct
10 Execution timed out 4027 ms 41204 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 276 ms 18860 KB Output is correct
5 Correct 1130 ms 40440 KB Output is correct
6 Correct 756 ms 7236 KB Output is correct
7 Correct 1110 ms 40456 KB Output is correct
8 Correct 644 ms 14720 KB Output is correct
9 Correct 1174 ms 40428 KB Output is correct
10 Execution timed out 4027 ms 41204 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 1435 ms 33708 KB Output is correct
4 Execution timed out 4088 ms 41188 KB Time limit exceeded
5 Halted 0 ms 0 KB -