oj.uz

답안 #426210

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
426210 2021-06-13T15:18:18 Z ocarima 밀림 점프 (APIO21_jumps) C++14
33 / 100
 4000 ms 32976 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], posicion[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], posicion[H[i]] = i + 1; }
    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, maxorigen, pmaxorigen, cntsalto;
    int cnt, pos, hi, hd;
    vector<int> mindist(n + 2, 0);

    maxdestino = (maxrango(C, D));

    // OBTEN EL MAS A LA IZQUIERDA MENOR QUE EL MAYOR
    int l, r, mitad, cur;
    l = A;
    r = B;
    cur = B;
    while (l <= r){
        mitad = (l + r) / 2;
        if (maxrango(mitad, B) < maxdestino){
            cur = mitad;
            r = mitad - 1;
        }
        else l = mitad + 1;
    }
    maxorigen = maxrango(cur, B);

    pmaxorigen = posicion[maxorigen];

    rep(i, pmaxorigen, pmaxorigen){
        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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1096 KB Output is correct
2 Correct 1 ms 1096 KB Output is correct
3 Execution timed out 4062 ms 26876 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 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 3 ms 1096 KB Output is correct
6 Correct 4 ms 1096 KB Output is correct
7 Correct 3 ms 1096 KB Output is correct
8 Correct 3 ms 1184 KB Output is correct
9 Correct 2 ms 1096 KB Output is correct
10 Correct 4 ms 1096 KB Output is correct
11 Correct 4 ms 1096 KB Output is correct
12 Correct 4 ms 1096 KB Output is correct
13 Correct 2 ms 1096 KB Output is correct
14 Correct 4 ms 1096 KB Output is correct
15 Correct 3 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 2 ms 1096 KB Output is correct
20 Correct 4 ms 1096 KB Output is correct
21 Correct 4 ms 1096 KB Output is correct
22 Correct 3 ms 1096 KB Output is correct
23 Correct 4 ms 1096 KB Output is correct
24 Correct 3 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 1200 KB Output is correct
28 Correct 3 ms 1096 KB Output is correct
29 Correct 3 ms 1096 KB Output is correct
30 Correct 2 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 1 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

# 결과 실행 시간 메모리 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 3 ms 1096 KB Output is correct
6 Correct 4 ms 1096 KB Output is correct
7 Correct 3 ms 1096 KB Output is correct
8 Correct 3 ms 1184 KB Output is correct
9 Correct 2 ms 1096 KB Output is correct
10 Correct 4 ms 1096 KB Output is correct
11 Correct 4 ms 1096 KB Output is correct
12 Correct 4 ms 1096 KB Output is correct
13 Correct 2 ms 1096 KB Output is correct
14 Correct 4 ms 1096 KB Output is correct
15 Correct 3 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 2 ms 1096 KB Output is correct
20 Correct 4 ms 1096 KB Output is correct
21 Correct 4 ms 1096 KB Output is correct
22 Correct 3 ms 1096 KB Output is correct
23 Correct 4 ms 1096 KB Output is correct
24 Correct 3 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 1200 KB Output is correct
28 Correct 3 ms 1096 KB Output is correct
29 Correct 3 ms 1096 KB Output is correct
30 Correct 2 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 1 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 2 ms 1096 KB Output is correct
45 Correct 4 ms 1096 KB Output is correct
46 Correct 2 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 4 ms 1096 KB Output is correct
51 Correct 4 ms 1096 KB Output is correct
52 Correct 3 ms 1096 KB Output is correct
53 Correct 4 ms 1096 KB Output is correct
54 Correct 3 ms 1096 KB Output is correct
55 Correct 4 ms 1096 KB Output is correct
56 Correct 4 ms 1096 KB Output is correct
57 Correct 2 ms 1096 KB Output is correct
58 Correct 30 ms 1352 KB Output is correct
59 Correct 33 ms 1352 KB Output is correct
60 Correct 4 ms 1224 KB Output is correct
61 Correct 31 ms 1352 KB Output is correct
62 Correct 14 ms 1116 KB Output is correct
63 Correct 17 ms 1352 KB Output is correct
64 Correct 49 ms 1352 KB Output is correct
65 Correct 25 ms 1352 KB Output is correct
66 Correct 19 ms 1352 KB Output is correct
67 Correct 40 ms 1408 KB Output is correct
68 Correct 44 ms 1352 KB Output is correct
69 Correct 33 ms 1352 KB Output is correct
70 Correct 19 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 4 ms 1096 KB Output is correct
75 Correct 4 ms 1096 KB Output is correct
76 Correct 4 ms 1096 KB Output is correct
77 Correct 3 ms 1096 KB Output is correct
78 Correct 2 ms 1096 KB Output is correct
79 Correct 2 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 3 ms 1096 KB Output is correct
83 Correct 3 ms 1096 KB Output is correct
84 Correct 3 ms 1096 KB Output is correct
85 Correct 4 ms 1096 KB Output is correct
86 Correct 1 ms 1096 KB Output is correct
87 Correct 2 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 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 6 ms 1096 KB Output is correct
95 Correct 19 ms 1352 KB Output is correct
96 Correct 39 ms 1312 KB Output is correct
97 Correct 37 ms 1352 KB Output is correct
98 Correct 18 ms 1352 KB Output is correct
99 Correct 20 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 32 ms 1408 KB Output is correct
103 Correct 36 ms 1352 KB Output is correct
104 Correct 20 ms 1412 KB Output is correct
105 Correct 17 ms 1352 KB Output is correct
106 Correct 23 ms 1408 KB Output is correct
107 Correct 2 ms 1096 KB Output is correct
108 Correct 2 ms 1224 KB Output is correct
109 Correct 2 ms 1404 KB Output is correct
110 Correct 2 ms 1412 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

# 결과 실행 시간 메모리 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 90 ms 25500 KB Output is correct
6 Correct 86 ms 31892 KB Output is correct
7 Correct 36 ms 15804 KB Output is correct
8 Correct 91 ms 31896 KB Output is correct
9 Correct 15 ms 5144 KB Output is correct
10 Correct 77 ms 31884 KB Output is correct
11 Correct 75 ms 32976 KB Output is correct
12 Correct 76 ms 32012 KB Output is correct
13 Correct 76 ms 32708 KB Output is correct
14 Correct 81 ms 31976 KB Output is correct
15 Correct 82 ms 31920 KB Output is correct
16 Correct 94 ms 31920 KB Output is correct
17 Correct 73 ms 31872 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 1 ms 1096 KB Output is correct
24 Correct 1 ms 1096 KB Output is correct
25 Correct 1 ms 1096 KB Output is correct
26 Correct 2 ms 1224 KB Output is correct
27 Correct 2 ms 1408 KB Output is correct
28 Correct 3 ms 1352 KB Output is correct
29 Correct 2 ms 1352 KB Output is correct
30 Correct 2 ms 1352 KB Output is correct
31 Correct 3 ms 1352 KB Output is correct
32 Correct 1 ms 1096 KB Output is correct
33 Correct 101 ms 31048 KB Output is correct
34 Correct 86 ms 31900 KB Output is correct
35 Correct 78 ms 32816 KB Output is correct
36 Correct 84 ms 31936 KB Output is correct
37 Correct 111 ms 31880 KB Output is correct
38 Correct 72 ms 31960 KB Output is correct
39 Correct 1 ms 1096 KB Output is correct
40 Correct 45 ms 18240 KB Output is correct
41 Correct 93 ms 31904 KB Output is correct
42 Correct 71 ms 32784 KB Output is correct
43 Correct 84 ms 31884 KB Output is correct
44 Correct 84 ms 31940 KB Output is correct
45 Correct 71 ms 31888 KB Output is correct

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 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 565 ms 14516 KB Output is correct
5 Execution timed out 4027 ms 31968 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #6
0 / 21.0

# 결과 실행 시간 메모리 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 565 ms 14516 KB Output is correct
5 Execution timed out 4027 ms 31968 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1096 KB Output is correct
2 Correct 1 ms 1096 KB Output is correct
3 Execution timed out 4062 ms 26876 KB Time limit exceeded
4 Halted 0 ms 0 KB -