oj.uz

Submission #426175

# Submission time Handle Problem Language Result Execution time Memory
426175 2021-06-13T14:55:45 Z ocarima Rainforest Jumps (APIO21_jumps) C++14
33 / 100
 4000 ms 32788 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 18

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, cntsalto;
    int cnt, pos, hi, hd;
    vector<int> mindist(n + 2, 0);

    maxdestino = (maxrango(C, D));
    rep(i, A, B){
        pos = i;
        cnt = 0;
        vector<int> saltos;
        saltos.push_back(pos);
        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;
            saltos.push_back(pos);

            if (mindist[pos] > 0){
                cnt += mindist[pos];
                res = min(res, cnt);
                cntsalto = mindist[pos];
                saltos.pop_back();
                while(saltos.size()){
                    cntsalto++;
                    mindist[saltos.back()] = cntsalto;
                    saltos.pop_back();
                }
                break;
            }

            if (pos >= C && pos <= D){
                res = min(res, cnt);
                cntsalto = 0;
                while (saltos.size()){
                    mindist[saltos.back()] = cntsalto++;
                    saltos.pop_back();
                }
                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 Execution timed out 4019 ms 26100 KB Time limit exceeded
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 1 ms 1096 KB Output is correct
5 Correct 4 ms 1096 KB Output is correct
6 Correct 5 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 1096 KB Output is correct
10 Correct 5 ms 1096 KB Output is correct
11 Correct 4 ms 1096 KB Output is correct
12 Correct 5 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 6 ms 1096 KB Output is correct
16 Correct 3 ms 1096 KB Output is correct
17 Correct 4 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 3 ms 1096 KB Output is correct
21 Correct 4 ms 1096 KB Output is correct
22 Correct 6 ms 1096 KB Output is correct
23 Correct 7 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 3 ms 1096 KB Output is correct
28 Correct 3 ms 1096 KB Output is correct
29 Correct 4 ms 1096 KB Output is correct
30 Correct 4 ms 1096 KB Output is correct
31 Correct 4 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 2 ms 1096 KB Output is correct
36 Correct 1 ms 1096 KB Output is correct
37 Correct 1 ms 1096 KB Output is correct
38 Correct 1 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 1 ms 1096 KB Output is correct
5 Correct 4 ms 1096 KB Output is correct
6 Correct 5 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 1096 KB Output is correct
10 Correct 5 ms 1096 KB Output is correct
11 Correct 4 ms 1096 KB Output is correct
12 Correct 5 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 6 ms 1096 KB Output is correct
16 Correct 3 ms 1096 KB Output is correct
17 Correct 4 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 3 ms 1096 KB Output is correct
21 Correct 4 ms 1096 KB Output is correct
22 Correct 6 ms 1096 KB Output is correct
23 Correct 7 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 3 ms 1096 KB Output is correct
28 Correct 3 ms 1096 KB Output is correct
29 Correct 4 ms 1096 KB Output is correct
30 Correct 4 ms 1096 KB Output is correct
31 Correct 4 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 2 ms 1096 KB Output is correct
36 Correct 1 ms 1096 KB Output is correct
37 Correct 1 ms 1096 KB Output is correct
38 Correct 1 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 1 ms 1096 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 4 ms 1096 KB Output is correct
46 Correct 4 ms 1096 KB Output is correct
47 Correct 4 ms 1096 KB Output is correct
48 Correct 2 ms 1096 KB Output is correct
49 Correct 4 ms 1096 KB Output is correct
50 Correct 6 ms 1096 KB Output is correct
51 Correct 6 ms 1096 KB Output is correct
52 Correct 4 ms 1096 KB Output is correct
53 Correct 6 ms 1096 KB Output is correct
54 Correct 5 ms 1096 KB Output is correct
55 Correct 4 ms 1096 KB Output is correct
56 Correct 3 ms 1188 KB Output is correct
57 Correct 1 ms 1096 KB Output is correct
58 Correct 103 ms 1352 KB Output is correct
59 Correct 139 ms 1352 KB Output is correct
60 Correct 21 ms 1224 KB Output is correct
61 Correct 158 ms 1352 KB Output is correct
62 Correct 29 ms 1096 KB Output is correct
63 Correct 142 ms 1352 KB Output is correct
64 Correct 115 ms 1352 KB Output is correct
65 Correct 104 ms 1352 KB Output is correct
66 Correct 190 ms 1352 KB Output is correct
67 Correct 167 ms 1352 KB Output is correct
68 Correct 108 ms 1352 KB Output is correct
69 Correct 81 ms 1352 KB Output is correct
70 Correct 20 ms 1352 KB Output is correct
71 Correct 1 ms 1096 KB Output is correct
72 Correct 1 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 7 ms 1096 KB Output is correct
76 Correct 4 ms 1096 KB Output is correct
77 Correct 5 ms 1096 KB Output is correct
78 Correct 1 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 3 ms 1096 KB Output is correct
82 Correct 4 ms 1096 KB Output is correct
83 Correct 5 ms 1096 KB Output is correct
84 Correct 3 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 2 ms 1096 KB Output is correct
89 Correct 1 ms 1096 KB Output is correct
90 Correct 1 ms 1224 KB Output is correct
91 Correct 1 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 8 ms 1096 KB Output is correct
95 Correct 100 ms 1352 KB Output is correct
96 Correct 1289 ms 1352 KB Output is correct
97 Correct 110 ms 1404 KB Output is correct
98 Correct 98 ms 1408 KB Output is correct
99 Correct 59 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 21 ms 1352 KB Output is correct
103 Correct 36 ms 1352 KB Output is correct
104 Correct 28 ms 1352 KB Output is correct
105 Correct 30 ms 1352 KB Output is correct
106 Correct 26 ms 1352 KB Output is correct
107 Correct 1 ms 1096 KB Output is correct
108 Correct 2 ms 1224 KB Output is correct
109 Correct 2 ms 1352 KB Output is correct
110 Correct 2 ms 1352 KB Output is correct
111 Correct 2 ms 1352 KB Output is correct
112 Correct 2 ms 1352 KB Output is correct
113 Correct 2 ms 1352 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 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 Correct 67 ms 24992 KB Output is correct
6 Correct 130 ms 31116 KB Output is correct
7 Correct 35 ms 15424 KB Output is correct
8 Correct 107 ms 31156 KB Output is correct
9 Correct 15 ms 5064 KB Output is correct
10 Correct 113 ms 31104 KB Output is correct
11 Correct 143 ms 32400 KB Output is correct
12 Correct 1358 ms 31152 KB Output is correct
13 Correct 93 ms 31984 KB Output is correct
14 Correct 117 ms 31120 KB Output is correct
15 Correct 97 ms 31116 KB Output is correct
16 Correct 98 ms 31108 KB Output is correct
17 Correct 105 ms 31188 KB Output is correct
18 Correct 1 ms 1096 KB Output is correct
19 Correct 1 ms 1096 KB Output is correct
20 Correct 1 ms 1096 KB Output is correct
21 Correct 1 ms 1096 KB Output is correct
22 Correct 1 ms 1096 KB Output is correct
23 Correct 2 ms 1096 KB Output is correct
24 Correct 2 ms 1096 KB Output is correct
25 Correct 2 ms 1096 KB Output is correct
26 Correct 2 ms 1244 KB Output is correct
27 Correct 2 ms 1404 KB Output is correct
28 Correct 2 ms 1352 KB Output is correct
29 Correct 3 ms 1352 KB Output is correct
30 Correct 2 ms 1352 KB Output is correct
31 Correct 2 ms 1352 KB Output is correct
32 Correct 2 ms 1016 KB Output is correct
33 Correct 95 ms 30372 KB Output is correct
34 Correct 88 ms 31152 KB Output is correct
35 Correct 1150 ms 31940 KB Output is correct
36 Correct 91 ms 31108 KB Output is correct
37 Correct 109 ms 31100 KB Output is correct
38 Correct 85 ms 31108 KB Output is correct
39 Correct 1 ms 1096 KB Output is correct
40 Correct 42 ms 17836 KB Output is correct
41 Correct 83 ms 31156 KB Output is correct
42 Correct 82 ms 32092 KB Output is correct
43 Correct 76 ms 31116 KB Output is correct
44 Correct 79 ms 31152 KB Output is correct
45 Correct 86 ms 31136 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 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 787 ms 14112 KB Output is correct
5 Correct 3940 ms 31140 KB Output is correct
6 Correct 1275 ms 5508 KB Output is correct
7 Correct 3792 ms 31124 KB Output is correct
8 Correct 1182 ms 10640 KB Output is correct
9 Correct 3894 ms 31116 KB Output is correct
10 Execution timed out 4038 ms 32788 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 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 787 ms 14112 KB Output is correct
5 Correct 3940 ms 31140 KB Output is correct
6 Correct 1275 ms 5508 KB Output is correct
7 Correct 3792 ms 31124 KB Output is correct
8 Correct 1182 ms 10640 KB Output is correct
9 Correct 3894 ms 31116 KB Output is correct
10 Execution timed out 4038 ms 32788 KB Time limit exceeded
11 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 Execution timed out 4019 ms 26100 KB Time limit exceeded
4 Halted 0 ms 0 KB -