oj.uz

Submission #426145

# Submission time Handle Problem Language Result Execution time Memory
426145 2021-06-13T14:39:53 Z ocarima Rainforest Jumps (APIO21_jumps) C++14
21 / 100
 2514 ms 57328 KB 
#include "jumps.h"
#include <vector>
#include<bits/stdc++.h>

using namespace std;

#define lli long long
#define rep(i, a, b) for(lli i = (a); i <= (b); ++i)
#define repa(i, a, b) for(lli i = (a); i >= (b); --i)

#define nl "\n"
#define debugsl(x) cout << #x << " = " << x << ", "
#define debug(x) debugsl(x) << nl
#define debugarr(x, a, b) cout << #x << " = ["; rep(ii, a, b){ cout << x[ii] << ", "; } cout << "]" << nl

#define MAX_N 200003
#define LOG_N 17

int maximo[LOG_N][MAX_N], minimo[LOG_N][MAX_N], n, pot[MAX_N];
int izq[MAX_N], der[MAX_N];
int k, res;

int maxrango(int l, int r){
    k = pot[r - l + 1];
    return max(maximo[k][l], maximo[k][r - (1 << k) + 1]);
}

int minrango(int l, int r){
    k = pot[r - l + 1];
    return min(minimo[k][l], minimo[k][r - (1 << k) + 1]);
}

void init(int N, std::vector<int> H) {
    int p = 1, k = 0;
    n = N;
    rep(i, 0, n - 1) maximo[0][i + 1] = minimo[0][i + 1] = H[i];
    maximo[0][0] = maximo[0][n + 1] = minimo[0][0] = minimo[0][n + 1] = n + 1;

    rep(k, 1, LOG_N - 1){
        rep(i, 0, (n + 1) - p - p + 1){
            maximo[k][i] = max(maximo[k - 1][i], maximo[k - 1][i + p]);
            minimo[k][i] = min(minimo[k - 1][i], minimo[k - 1][i + p]);
        }
        p <<= 1;
    }

    p = 1;
    rep(i, 1, MAX_N - 1){
        pot[i] = k;
        if (p + p <= i){ p <<= 1; ++k; }
    }

    // OBTEN EL SIGUIENTE SALTO A LA DERECHA Y A LA IZQUIERDA DE CADA NUMERO
    int l, r, mitad, cur;
    rep(i, 1, n){
        // OBTEN SU SALTO A LA IZQUIERDA;
        l = 0;
        r = i - 1;
        cur = l;
        while (l <= r){
            mitad = (l + r) / 2;
            if (maxrango(mitad, i - 1) > H[i - 1]){
                l = mitad + 1;
                cur = mitad;
            }
            else r = mitad - 1;
        }
        izq[i] = cur;

        // OBTEN SU SALTO A LA DERECHA;
        l = i + 1;
        r = n + 1;
        cur = n + 1;
        while (l <= r){
            mitad = (l + r) / 2;
            if (maxrango(i + 1, mitad) > H[i - 1]){
                r = mitad - 1;
                cur = mitad;
            }
            else l = mitad + 1;
        }
        der[i] = cur;
    }
}

int minimum_jumps(int A, int B, int C, int D) {
    res = n + 1;

    ++A; ++B; ++C; ++D;

    int maxdestino;
    int cnt, pos, hi, hd;

    maxdestino = (maxrango(C, D));
    rep(i, A, B){
        pos = i;
        cnt = 0;
        while (pos != 0 && pos != n + 1){

            hi = maximo[0][izq[pos]];
            hd = maximo[0][der[pos]];

            if (der[pos] >= C && der[pos] <= D) pos = der[pos];
            else if (hi > hd && hi < maxdestino) pos = izq[pos];
            else if (hd > hi && hd < maxdestino) pos = der[pos];
            else if (hi > hd && hd < maxdestino) pos = der[pos];
            else if (hd > hi && hi < maxdestino) pos = izq[pos];
            else{
                cnt = n + 1;
                break;
            }

            ++cnt;
            if (pos >= C && pos <= D){
                res = min(res, cnt);
                break;
            }
        }
    }

    return (res == n + 1) ? -1 : res;
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1096 KB Output is correct
2 Correct 1 ms 1096 KB Output is correct
3 Runtime error 87 ms 47836 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

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

Subtask #3
13.0 / 13.0

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

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1096 KB Output is correct
2 Correct 1 ms 1096 KB Output is correct
3 Correct 1 ms 1096 KB Output is correct
4 Correct 1 ms 1096 KB Output is correct
5 Runtime error 102 ms 48432 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1096 KB Output is correct
2 Correct 2 ms 1096 KB Output is correct
3 Correct 1 ms 1096 KB Output is correct
4 Correct 242 ms 13788 KB Output is correct
5 Runtime error 88 ms 57328 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1096 KB Output is correct
2 Correct 2 ms 1096 KB Output is correct
3 Correct 1 ms 1096 KB Output is correct
4 Correct 242 ms 13788 KB Output is correct
5 Runtime error 88 ms 57328 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1096 KB Output is correct
2 Correct 1 ms 1096 KB Output is correct
3 Runtime error 87 ms 47836 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -