oj.uz

Submission #442166

# Submission time Handle Problem Language Result Execution time Memory
442166 2021-07-07T08:53:39 Z Haruto810198 Rainforest Jumps (APIO21_jumps) C++17
48 / 100
 1563 ms 67824 KB 
#include <bits/stdc++.h>

using namespace std;

//#define int long long
#define double long double

#define FOR(i,l,r,d) for(int i=(l);i<=(r);i+=(d))
#define szof(x) ((int)(x).size())

#define vi vector<int>
#define pii pair<int,int>

#define F first
#define S second

#define pb push_back
#define eb emplace_back
#define mkp make_pair

#define V st[cidx]
#define LC st[cidx*2]
#define RC st[cidx*2+1]
#define lsb(x) ((x)&(-(x)))

//const int INF = 2147483647;
//const int LNF = INF*INF;
const int INF = 1000000007;
const int MOD = 1000000007;
const int mod = 998244353;
const double eps = 1e-12;

//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")

const int MAX = 200010;
const int lgMAX = 20;

int n;
int c, d;
int h[MAX];
int edge_l[MAX], edge_r[MAX];
int anc_l[MAX][lgMAX];
int anc_hi[MAX][lgMAX], anc_lo[MAX][lgMAX];
int Max[MAX][lgMAX];
int dest_Max;

int query_Max(int L, int R){ /// [L, R]
    int len = R - L + 1;
    int lglen = __lg(len);
    return max(Max[L][lglen], Max[R - (1<<lglen) + 1][lglen]);
}

int get_start(int A, int B){
    int ret = B;
    for(int j=lgMAX-1; j>=0; j--){
        if( anc_l[ret][j] != INF and h[anc_l[ret][j]] < dest_Max and anc_l[ret][j] >= A ){
            ret = anc_l[ret][j];
        }
    }
    return ret;
}

pii jump_hi(int v){
    int ret = 0;
    for(int j=lgMAX-1; j>=0; j--){
        if( anc_hi[v][j] != INF and h[anc_hi[v][j]] <= dest_Max and !(c<=anc_hi[v][j] and anc_hi[v][j]<=d) ){
            v = anc_hi[v][j];
            ret += (1<<j);
        }
    }

    if( anc_hi[v][0] != INF and h[anc_hi[v][0]] <= dest_Max and !(c<=v and v<=d) ){
        v = anc_hi[v][0];
        ret += 1;
    }
    return mkp(v, ret);
}

int jump_lo(int v){
    int ret = 0;
    for(int j=lgMAX-1; j>=0; j--){
        if( anc_lo[v][j] != INF and h[anc_lo[v][j]] <= dest_Max and !(c<=anc_lo[v][j] and anc_lo[v][j]<=d) ){
            v = anc_lo[v][j];
            ret += (1<<j);
        }
    }

    if( h[v] > dest_Max ){
        return INF;
    }
    if( h[v] < dest_Max and ( anc_lo[v][0] == INF or h[anc_lo[v][0]] > dest_Max ) ){
        return INF;
    }

    if( anc_lo[v][0] != INF and h[anc_lo[v][0]] <= dest_Max and !(c<=v and v<=d) ){
        v = anc_lo[v][0];
        ret += 1;
    }

    return ret;
}

void init(int N, vi H){

    /// input
    n = N;
    FOR(i, 0, n-1, 1){
        h[i] = H[i];
    }

    /// monotonic stack
    FOR(i, 0, n-1, 1){
        edge_l[i] = INF; /// INF -> no edge
        edge_r[i] = INF;
    }

    vi stk;
    FOR(i, 0, n-1, 1){

        while(!stk.empty() and h[stk.back()] < h[i]){
            stk.pop_back();
        }

        if(!stk.empty()){
            edge_l[i] = stk.back();
        }
        stk.pb(i);

    }

    stk.clear();

    for(int i=n-1; i>=0; i--){

        while(!stk.empty() and h[stk.back()] < h[i]){
            stk.pop_back();
        }

        if(!stk.empty()){
            edge_r[i] = stk.back();
        }
        stk.pb(i);

    }

    /// 2^k-th ancestor
    FOR(i, 0, n-1, 1){
        if(edge_l[i]==INF and edge_r[i]==INF){
            anc_hi[i][0] = INF;
            anc_lo[i][0] = INF;
        }
        else if(edge_l[i]==INF or edge_r[i]==INF){
            anc_hi[i][0] = INF;
            anc_lo[i][0] = min(edge_l[i], edge_r[i]);
        }
        else{
            anc_hi[i][0] = (h[edge_l[i]] > h[edge_r[i]]) ? edge_l[i] : edge_r[i];
            anc_lo[i][0] = (h[edge_l[i]] < h[edge_r[i]]) ? edge_l[i] : edge_r[i];
        }
        anc_l [i][0] = edge_l[i];
    }
    FOR(j, 1, lgMAX-1, 1){
        FOR(i, 0, n-1, 1){
            anc_hi[i][j] = (anc_hi[i][j-1]!=INF) ? anc_hi[ anc_hi[i][j-1] ][j-1] : INF;
            anc_lo[i][j] = (anc_lo[i][j-1]!=INF) ? anc_lo[ anc_lo[i][j-1] ][j-1] : INF;
            anc_l [i][j] = (anc_l [i][j-1]!=INF) ? anc_l [ anc_l [i][j-1] ][j-1] : INF;
        }
    }

    /// sparse table for Max query
    FOR(i, 0, n-1, 1){
        Max[i][0] = h[i];
    }
    FOR(j, 1, lgMAX-1, 1){
        FOR(i, 0, n-1, 1){
            if(i + (1<<j-1) <= n-1){
                Max[i][j] = max(Max[i][j-1], Max[i + (1<<j-1)][j-1]);
            }
            else{
                Max[i][j] = Max[i][j-1];
            }
        }
    }

}

int minimum_jumps(int A, int B, int C, int D){

    c = C;
    d = D;
    dest_Max = query_Max(C, D);
    //cerr<<"dest_Max = "<<dest_Max<<endl;

    int start = get_start(A, B);
    //cerr<<"start = "<<start<<endl;

    int v = start, res;

    pii tmp = jump_hi(start);
    v = tmp.F;
    res = tmp.S;
    //cerr<<"jump_hi : v = "<<tmp.F<<", res += "<<tmp.S<<endl;

    res += jump_lo(v);
    //cerr<<"jump_lo : res += "<<jump_lo(v)<<endl;

    //cerr<<"res = "<<res<<endl;

    if(res < INF){
        return res;
    }
    else{
        return -1;
    }

}

/*
signed main(){

    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    init(10, {0, 1, 2, 3, 4, 5, 6, 7, 8, 9});

    cerr<<minimum_jumps(1, 3, 4, 6)<<endl; /// 1
    cerr<<minimum_jumps(0, 4, 7, 7)<<endl; /// 3
    cerr<<minimum_jumps(4, 6, 8, 9)<<endl; /// 2

    return 0;

}
*/

Compilation message

jumps.cpp: In function 'void init(int, std::vector<int>)':
jumps.cpp:177:25: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
  177 |             if(i + (1<<j-1) <= n-1){
      |                        ~^~
jumps.cpp:178:59: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
  178 |                 Max[i][j] = max(Max[i][j-1], Max[i + (1<<j-1)][j-1]);
      |                                                          ~^~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 298 ms 53976 KB Output is correct
4 Correct 1249 ms 67640 KB Output is correct
5 Correct 1115 ms 34220 KB Output is correct
6 Correct 1563 ms 67732 KB Output is correct
7 Correct 1240 ms 46360 KB Output is correct
8 Correct 1151 ms 67708 KB Output is correct

Subtask #2
0 / 8.0

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

Subtask #3
0 / 13.0

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

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 0 ms 328 KB Output is correct
5 Correct 148 ms 53772 KB Output is correct
6 Correct 168 ms 66916 KB Output is correct
7 Correct 81 ms 34356 KB Output is correct
8 Correct 175 ms 66752 KB Output is correct
9 Correct 16 ms 10320 KB Output is correct
10 Correct 185 ms 66788 KB Output is correct
11 Correct 177 ms 67764 KB Output is correct
12 Correct 156 ms 67500 KB Output is correct
13 Correct 164 ms 67476 KB Output is correct
14 Correct 170 ms 66860 KB Output is correct
15 Incorrect 213 ms 67236 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 360 ms 30724 KB Output is correct
5 Correct 1443 ms 66788 KB Output is correct
6 Correct 810 ms 11208 KB Output is correct
7 Correct 1186 ms 66784 KB Output is correct
8 Correct 610 ms 23196 KB Output is correct
9 Correct 1115 ms 66716 KB Output is correct
10 Correct 1384 ms 67704 KB Output is correct
11 Correct 1387 ms 67636 KB Output is correct
12 Correct 1365 ms 67524 KB Output is correct
13 Correct 1422 ms 66880 KB Output is correct
14 Correct 1082 ms 67336 KB Output is correct
15 Correct 1350 ms 67636 KB Output is correct
16 Correct 1224 ms 67636 KB Output is correct
17 Correct 0 ms 328 KB Output is correct
18 Correct 1 ms 328 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 3 ms 328 KB Output is correct
21 Correct 3 ms 328 KB Output is correct
22 Correct 2 ms 328 KB Output is correct
23 Correct 2 ms 328 KB Output is correct
24 Correct 3 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 23 ms 968 KB Output is correct
28 Correct 25 ms 968 KB Output is correct
29 Correct 26 ms 968 KB Output is correct
30 Correct 26 ms 968 KB Output is correct
31 Correct 23 ms 968 KB Output is correct
32 Correct 0 ms 328 KB Output is correct
33 Correct 93 ms 38812 KB Output is correct
34 Correct 168 ms 66840 KB Output is correct
35 Correct 159 ms 67512 KB Output is correct
36 Correct 165 ms 66840 KB Output is correct
37 Correct 211 ms 67408 KB Output is correct
38 Correct 158 ms 67636 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 360 ms 30724 KB Output is correct
5 Correct 1443 ms 66788 KB Output is correct
6 Correct 810 ms 11208 KB Output is correct
7 Correct 1186 ms 66784 KB Output is correct
8 Correct 610 ms 23196 KB Output is correct
9 Correct 1115 ms 66716 KB Output is correct
10 Correct 1384 ms 67704 KB Output is correct
11 Correct 1387 ms 67636 KB Output is correct
12 Correct 1365 ms 67524 KB Output is correct
13 Correct 1422 ms 66880 KB Output is correct
14 Correct 1082 ms 67336 KB Output is correct
15 Correct 1350 ms 67636 KB Output is correct
16 Correct 1224 ms 67636 KB Output is correct
17 Correct 0 ms 328 KB Output is correct
18 Correct 1 ms 328 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 3 ms 328 KB Output is correct
21 Correct 3 ms 328 KB Output is correct
22 Correct 2 ms 328 KB Output is correct
23 Correct 2 ms 328 KB Output is correct
24 Correct 3 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 23 ms 968 KB Output is correct
28 Correct 25 ms 968 KB Output is correct
29 Correct 26 ms 968 KB Output is correct
30 Correct 26 ms 968 KB Output is correct
31 Correct 23 ms 968 KB Output is correct
32 Correct 0 ms 328 KB Output is correct
33 Correct 93 ms 38812 KB Output is correct
34 Correct 168 ms 66840 KB Output is correct
35 Correct 159 ms 67512 KB Output is correct
36 Correct 165 ms 66840 KB Output is correct
37 Correct 211 ms 67408 KB Output is correct
38 Correct 158 ms 67636 KB Output is correct
39 Correct 0 ms 328 KB Output is correct
40 Correct 0 ms 328 KB Output is correct
41 Correct 1 ms 328 KB Output is correct
42 Correct 324 ms 30656 KB Output is correct
43 Correct 1170 ms 66720 KB Output is correct
44 Correct 784 ms 11200 KB Output is correct
45 Correct 1082 ms 66716 KB Output is correct
46 Correct 788 ms 23232 KB Output is correct
47 Correct 1196 ms 66756 KB Output is correct
48 Correct 1171 ms 67636 KB Output is correct
49 Correct 959 ms 67568 KB Output is correct
50 Correct 1177 ms 67508 KB Output is correct
51 Correct 1375 ms 66752 KB Output is correct
52 Correct 1255 ms 67256 KB Output is correct
53 Correct 1233 ms 67824 KB Output is correct
54 Correct 1268 ms 67764 KB Output is correct
55 Correct 1 ms 328 KB Output is correct
56 Correct 217 ms 66572 KB Output is correct
57 Correct 1125 ms 66796 KB Output is correct
58 Correct 501 ms 11972 KB Output is correct
59 Correct 1073 ms 66784 KB Output is correct
60 Correct 499 ms 23872 KB Output is correct
61 Correct 1097 ms 66732 KB Output is correct
62 Correct 1256 ms 67636 KB Output is correct
63 Correct 1097 ms 67604 KB Output is correct
64 Correct 941 ms 67384 KB Output is correct
65 Correct 1161 ms 66820 KB Output is correct
66 Correct 1053 ms 67256 KB Output is correct
67 Correct 1242 ms 67636 KB Output is correct
68 Correct 1306 ms 67636 KB Output is correct
69 Correct 0 ms 328 KB Output is correct
70 Correct 1 ms 328 KB Output is correct
71 Correct 3 ms 328 KB Output is correct
72 Correct 3 ms 328 KB Output is correct
73 Correct 3 ms 328 KB Output is correct
74 Correct 3 ms 328 KB Output is correct
75 Correct 3 ms 328 KB Output is correct
76 Correct 0 ms 328 KB Output is correct
77 Correct 0 ms 328 KB Output is correct
78 Correct 2 ms 328 KB Output is correct
79 Correct 3 ms 328 KB Output is correct
80 Correct 3 ms 328 KB Output is correct
81 Correct 3 ms 328 KB Output is correct
82 Correct 3 ms 328 KB Output is correct
83 Correct 3 ms 328 KB Output is correct
84 Correct 1 ms 328 KB Output is correct
85 Correct 4 ms 328 KB Output is correct
86 Correct 23 ms 968 KB Output is correct
87 Correct 25 ms 968 KB Output is correct
88 Correct 12 ms 968 KB Output is correct
89 Correct 26 ms 968 KB Output is correct
90 Correct 27 ms 968 KB Output is correct
91 Correct 1 ms 328 KB Output is correct
92 Correct 1 ms 456 KB Output is correct
93 Correct 27 ms 968 KB Output is correct
94 Correct 28 ms 968 KB Output is correct
95 Correct 20 ms 968 KB Output is correct
96 Correct 23 ms 968 KB Output is correct
97 Correct 24 ms 968 KB Output is correct
98 Correct 1 ms 328 KB Output is correct
99 Correct 166 ms 66780 KB Output is correct
100 Correct 167 ms 66844 KB Output is correct
101 Correct 163 ms 67472 KB Output is correct
102 Correct 171 ms 66752 KB Output is correct
103 Correct 200 ms 67308 KB Output is correct
104 Correct 157 ms 67724 KB Output is correct
105 Correct 0 ms 328 KB Output is correct
106 Correct 90 ms 38880 KB Output is correct
107 Correct 165 ms 66752 KB Output is correct
108 Correct 156 ms 67600 KB Output is correct
109 Correct 171 ms 66752 KB Output is correct
110 Correct 201 ms 67312 KB Output is correct
111 Correct 160 ms 67728 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 298 ms 53976 KB Output is correct
4 Correct 1249 ms 67640 KB Output is correct
5 Correct 1115 ms 34220 KB Output is correct
6 Correct 1563 ms 67732 KB Output is correct
7 Correct 1240 ms 46360 KB Output is correct
8 Correct 1151 ms 67708 KB Output is correct
9 Correct 0 ms 328 KB Output is correct
10 Correct 0 ms 328 KB Output is correct
11 Correct 0 ms 328 KB Output is correct
12 Correct 0 ms 328 KB Output is correct
13 Correct 3 ms 328 KB Output is correct
14 Incorrect 3 ms 328 KB Output isn't correct
15 Halted 0 ms 0 KB -