oj.uz

Submission #442196

# Submission time Handle Problem Language Result Execution time Memory
442196 2021-07-07T09:23:38 Z Haruto810198 Rainforest Jumps (APIO21_jumps) C++17
48 / 100
 1626 ms 83468 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], anc_r[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)) and (!(c<=anc_lo[v][j] and anc_lo[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_r(int v){
    int ret = 0;
    for(int j=lgMAX-1; j>=0; j--){
        if( anc_r[v][j] != INF and h[anc_r[v][j]] <= dest_Max and (!(c<=anc_r[v][j] and anc_r[v][j]<=d)) ){
            v = anc_r[v][j];
            ret += (1<<j);
        }
    }

    if( h[v] > dest_Max ){
        return INF;
    }
    if( (!(c<=v and v<=d)) and ( anc_r[v][0] == INF or h[anc_r[v][0]] > dest_Max ) ){
        return INF;
    }

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

    if(c<=v and v<=d){
        return ret;
    }
    else{
        return INF;
    }

}

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];
        anc_r[i][0] = edge_r[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;
            anc_r [i][j] = (anc_r [i][j-1]!=INF) ? anc_r [ anc_r [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_r(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(4, {3, 1, 2, 4});

    cerr<<minimum_jumps(1, 1, 2, 3)<<endl; /// 1

    return 0;

}
*/

Compilation message

jumps.cpp: In function 'void init(int, std::vector<int>)':
jumps.cpp:188:25: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
  188 |             if(i + (1<<j-1) <= n-1){
      |                        ~^~
jumps.cpp:189:59: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
  189 |                 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 0 ms 328 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 258 ms 66444 KB Output is correct
4 Correct 1421 ms 83364 KB Output is correct
5 Correct 1328 ms 42212 KB Output is correct
6 Correct 1264 ms 83364 KB Output is correct
7 Correct 1220 ms 57060 KB Output is correct
8 Correct 1194 ms 83372 KB Output is correct

Subtask #2
0 / 8.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 1 ms 328 KB Output is correct
4 Correct 0 ms 328 KB Output is correct
5 Correct 2 ms 328 KB Output is correct
6 Correct 4 ms 328 KB Output is correct
7 Correct 3 ms 328 KB Output is correct
8 Correct 3 ms 328 KB Output is correct
9 Incorrect 1 ms 328 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 13.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 1 ms 328 KB Output is correct
4 Correct 0 ms 328 KB Output is correct
5 Correct 2 ms 328 KB Output is correct
6 Correct 4 ms 328 KB Output is correct
7 Correct 3 ms 328 KB Output is correct
8 Correct 3 ms 328 KB Output is correct
9 Incorrect 1 ms 328 KB Output isn't correct
10 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 1 ms 328 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 0 ms 328 KB Output is correct
5 Correct 166 ms 66432 KB Output is correct
6 Correct 196 ms 82368 KB Output is correct
7 Correct 92 ms 42308 KB Output is correct
8 Correct 211 ms 82460 KB Output is correct
9 Correct 24 ms 12656 KB Output is correct
10 Correct 193 ms 82444 KB Output is correct
11 Correct 180 ms 83360 KB Output is correct
12 Correct 189 ms 83152 KB Output is correct
13 Correct 184 ms 83112 KB Output is correct
14 Correct 192 ms 82480 KB Output is correct
15 Incorrect 260 ms 83096 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 1 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 394 ms 37908 KB Output is correct
5 Correct 1336 ms 82368 KB Output is correct
6 Correct 813 ms 13868 KB Output is correct
7 Correct 1166 ms 82452 KB Output is correct
8 Correct 695 ms 28552 KB Output is correct
9 Correct 1478 ms 82484 KB Output is correct
10 Correct 1561 ms 83360 KB Output is correct
11 Correct 1337 ms 83212 KB Output is correct
12 Correct 1343 ms 83232 KB Output is correct
13 Correct 1365 ms 82452 KB Output is correct
14 Correct 1613 ms 82964 KB Output is correct
15 Correct 1211 ms 83360 KB Output is correct
16 Correct 1089 ms 83348 KB Output is correct
17 Correct 0 ms 328 KB Output is correct
18 Correct 0 ms 328 KB Output is correct
19 Correct 3 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 3 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 1 ms 328 KB Output is correct
26 Correct 1 ms 584 KB Output is correct
27 Correct 19 ms 1096 KB Output is correct
28 Correct 20 ms 1096 KB Output is correct
29 Correct 22 ms 1096 KB Output is correct
30 Correct 25 ms 1096 KB Output is correct
31 Correct 27 ms 1096 KB Output is correct
32 Correct 0 ms 328 KB Output is correct
33 Correct 116 ms 47860 KB Output is correct
34 Correct 200 ms 82484 KB Output is correct
35 Correct 186 ms 83240 KB Output is correct
36 Correct 198 ms 82572 KB Output is correct
37 Correct 232 ms 83020 KB Output is correct
38 Correct 186 ms 83348 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 394 ms 37908 KB Output is correct
5 Correct 1336 ms 82368 KB Output is correct
6 Correct 813 ms 13868 KB Output is correct
7 Correct 1166 ms 82452 KB Output is correct
8 Correct 695 ms 28552 KB Output is correct
9 Correct 1478 ms 82484 KB Output is correct
10 Correct 1561 ms 83360 KB Output is correct
11 Correct 1337 ms 83212 KB Output is correct
12 Correct 1343 ms 83232 KB Output is correct
13 Correct 1365 ms 82452 KB Output is correct
14 Correct 1613 ms 82964 KB Output is correct
15 Correct 1211 ms 83360 KB Output is correct
16 Correct 1089 ms 83348 KB Output is correct
17 Correct 0 ms 328 KB Output is correct
18 Correct 0 ms 328 KB Output is correct
19 Correct 3 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 3 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 1 ms 328 KB Output is correct
26 Correct 1 ms 584 KB Output is correct
27 Correct 19 ms 1096 KB Output is correct
28 Correct 20 ms 1096 KB Output is correct
29 Correct 22 ms 1096 KB Output is correct
30 Correct 25 ms 1096 KB Output is correct
31 Correct 27 ms 1096 KB Output is correct
32 Correct 0 ms 328 KB Output is correct
33 Correct 116 ms 47860 KB Output is correct
34 Correct 200 ms 82484 KB Output is correct
35 Correct 186 ms 83240 KB Output is correct
36 Correct 198 ms 82572 KB Output is correct
37 Correct 232 ms 83020 KB Output is correct
38 Correct 186 ms 83348 KB Output is correct
39 Correct 0 ms 328 KB Output is correct
40 Correct 0 ms 328 KB Output is correct
41 Correct 0 ms 328 KB Output is correct
42 Correct 323 ms 37912 KB Output is correct
43 Correct 1136 ms 82476 KB Output is correct
44 Correct 688 ms 13872 KB Output is correct
45 Correct 1180 ms 82444 KB Output is correct
46 Correct 584 ms 28592 KB Output is correct
47 Correct 1333 ms 82368 KB Output is correct
48 Correct 1571 ms 83464 KB Output is correct
49 Correct 1271 ms 83208 KB Output is correct
50 Correct 1384 ms 83204 KB Output is correct
51 Correct 1336 ms 82404 KB Output is correct
52 Correct 1626 ms 82912 KB Output is correct
53 Correct 1290 ms 83380 KB Output is correct
54 Correct 1237 ms 83380 KB Output is correct
55 Correct 0 ms 328 KB Output is correct
56 Correct 258 ms 82052 KB Output is correct
57 Correct 1164 ms 82476 KB Output is correct
58 Correct 652 ms 14716 KB Output is correct
59 Correct 1169 ms 82480 KB Output is correct
60 Correct 545 ms 29452 KB Output is correct
61 Correct 1310 ms 82444 KB Output is correct
62 Correct 1255 ms 83356 KB Output is correct
63 Correct 1177 ms 83124 KB Output is correct
64 Correct 1345 ms 83088 KB Output is correct
65 Correct 1274 ms 82440 KB Output is correct
66 Correct 1499 ms 82996 KB Output is correct
67 Correct 1276 ms 83360 KB Output is correct
68 Correct 1311 ms 83468 KB Output is correct
69 Correct 0 ms 328 KB Output is correct
70 Correct 1 ms 328 KB Output is correct
71 Correct 2 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 2 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 1 ms 328 KB Output is correct
78 Correct 2 ms 328 KB Output is correct
79 Correct 2 ms 328 KB Output is correct
80 Correct 3 ms 328 KB Output is correct
81 Correct 2 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 1 ms 328 KB Output is correct
85 Correct 3 ms 328 KB Output is correct
86 Correct 26 ms 1052 KB Output is correct
87 Correct 23 ms 1096 KB Output is correct
88 Correct 20 ms 1096 KB Output is correct
89 Correct 31 ms 1096 KB Output is correct
90 Correct 18 ms 1096 KB Output is correct
91 Correct 1 ms 328 KB Output is correct
92 Correct 1 ms 584 KB Output is correct
93 Correct 27 ms 1096 KB Output is correct
94 Correct 28 ms 1096 KB Output is correct
95 Correct 11 ms 1132 KB Output is correct
96 Correct 24 ms 1096 KB Output is correct
97 Correct 22 ms 1096 KB Output is correct
98 Correct 0 ms 328 KB Output is correct
99 Correct 199 ms 82424 KB Output is correct
100 Correct 193 ms 82368 KB Output is correct
101 Correct 200 ms 83172 KB Output is correct
102 Correct 206 ms 82456 KB Output is correct
103 Correct 254 ms 82984 KB Output is correct
104 Correct 201 ms 83368 KB Output is correct
105 Correct 0 ms 328 KB Output is correct
106 Correct 120 ms 47936 KB Output is correct
107 Correct 195 ms 82368 KB Output is correct
108 Correct 185 ms 83252 KB Output is correct
109 Correct 206 ms 82452 KB Output is correct
110 Correct 234 ms 82872 KB Output is correct
111 Correct 184 ms 83348 KB Output is correct

Subtask #7
0 / 19.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 258 ms 66444 KB Output is correct
4 Correct 1421 ms 83364 KB Output is correct
5 Correct 1328 ms 42212 KB Output is correct
6 Correct 1264 ms 83364 KB Output is correct
7 Correct 1220 ms 57060 KB Output is correct
8 Correct 1194 ms 83372 KB Output is correct
9 Correct 1 ms 328 KB Output is correct
10 Correct 0 ms 328 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 0 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 3 ms 328 KB Output is correct
16 Correct 3 ms 328 KB Output is correct
17 Incorrect 1 ms 328 KB Output isn't correct
18 Halted 0 ms 0 KB -