oj.uz

Submission #424902

# Submission time Handle Problem Language Result Execution time Memory
424902 2021-06-12T11:25:11 Z SorahISA Rainforest Jumps (APIO21_jumps) C++17
27 / 100
 1469 ms 73216 KB 
#include "jumps.h"
#pragma GCC optimize("Ofast", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;

using pii = pair<int, int>;
template<typename T>
using Prior = std::priority_queue<T>;
template<typename T>
using prior = std::priority_queue<T, vector<T>, greater<T>>;

#define X first
#define Y second
#define eb emplace_back
#define ALL(x) begin(x), end(x)
#define RALL(x) rbegin(x), rend(x)

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

inline int getRand(int L, int R) {
    if (L > R) swap(L, R);
    return (int)(rng() % (uint64_t)(R - L + 1) + L);
}

const int INF = 1E9;
const int maxn = 1 << 18;
const int lgmx = 18;
// const int maxn = 1 << 4;
// const int lgmx = 4;

int N, sparse[lgmx][maxn], inv[maxn];
pii jump[lgmx][maxn]; /// (jump lo_edge, jump hi_edge)
pii LR[lgmx][maxn]; /// (jump left, jump right)
vector<int> H;

inline int chmin(int &x, int y) {return x <= y ? 0 : x = y, 1;}

inline int QueryMax(int L, int R) {
    int lay = __lg(R - L + 1);
    return max(sparse[lay][L], sparse[lay][R - (1<<lay) + 1]);
}

void init(int _N, vector<int> _H) {
    N = _N + 2;
    H.eb(N + 1); for (auto x : _H) H.eb(x); H.eb(N + 2);
    
    for (int i = 0; i < N; ++i) sparse[0][i] = H[i], inv[H[i]] = i;
    
    for (int lay = 1; lay < lgmx; ++lay) {
        for (int i = 0; i < N-(1<<lay)+1; ++i) {
            sparse[lay][i] = max(sparse[lay-1][i], sparse[lay-1][i+(1<<lay-1)]);
        }
    }
    
    jump[0][0] = LR[0][0] = {0, N-1}, jump[0][N-1] = LR[0][N-1] = {N-1, N-1};
    
    for (int i = 1, lo, mi, hi; i < N-1; ++i) {
        auto &jmp = jump[0][i];
        auto &lr = LR[0][i];
        
        lo = 0, hi = i;
        while (lo < hi) {
            mi = lo + hi + 1 >> 1;
            QueryMax(mi, i) > H[i] ? lo = mi : hi = mi - 1;
        }
        jmp.X = lr.X = lo;
        
        lo = i, hi = N-1;
        while (lo < hi) {
            mi = lo + hi >> 1;
            QueryMax(i, mi) > H[i] ? hi = mi : lo = mi + 1;
        }
        jmp.Y = lr.Y = lo;
        
        if (H[jmp.X] > H[jmp.Y]) swap(jmp.X, jmp.Y);
    }
    
    for (int lay = 1; lay < lgmx; ++lay) {
        for (int i = 0; i < N; ++i) {
            auto &anc = jump[lay-1][i];
            jump[lay][i].X = jump[lay-1][anc.X].X;
            jump[lay][i].Y = jump[lay-1][anc.Y].Y;
            auto &par = LR[lay-1][i];
            LR[lay][i].X = LR[lay-1][par.X].X;
            LR[lay][i].Y = LR[lay-1][par.Y].Y;
        }
    }
}

int minimum_jumps(int A, int B, int C, int D) {
    ++A, ++B, ++C, ++D;
    
    if (B + 1 == C) return LR[0][B].Y <= D ? 1 : -1;
    
    int mid = QueryMax(B+1, C-1);
    if (LR[0][inv[mid]].Y > D) return -1;
    if (H[B] > mid) return LR[0][B].Y <= D ? 1 : -1;
    
    // int S, lo = A, hi = B, mi;
    // while (lo < hi) {
        // mi = lo + hi >> 1;
        // if (QueryMax(mi, B) > mid) lo = mi + 1;
        // else hi = mi;
    // }
    // S = inv[QueryMax(lo, B)];
    int S = B;
    
    // cout << "start at " << S - 1 << "\n";
    
    // if (A <= LR[0][S].X and LR[0][LR[0][S].X].Y <= D) return 1;
    
    int ans = 0;
    
    for (int i = lgmx-1; i >= 0; --i) {
        if (H[jump[i][S].Y] <= mid) S = jump[i][S].Y, ans += 1 << i;
    }
    
    if (H[S] == mid) return ans + 1;
    if (LR[0][LR[0][S].X].Y <= D) return ans + 2;
    
    for (int i = lgmx-1; i >= 0; --i) {
        if (LR[i][S].Y < C) S = LR[i][S].Y, ans += 1 << i;
    }
    
    return C <= LR[0][S].Y and LR[0][S].Y <= D ? ans + 1 : -1;
}

Compilation message

jumps.cpp: In function 'void init(int, std::vector<int>)':
jumps.cpp:51:75: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   51 |             sparse[lay][i] = max(sparse[lay-1][i], sparse[lay-1][i+(1<<lay-1)]);
      |                                                                        ~~~^~
jumps.cpp:63:26: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   63 |             mi = lo + hi + 1 >> 1;
      |                  ~~~~~~~~^~~
jumps.cpp:70:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   70 |             mi = lo + hi >> 1;
      |                  ~~~^~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 584 KB Output is correct
2 Correct 1 ms 584 KB Output is correct
3 Correct 199 ms 58220 KB Output is correct
4 Correct 1469 ms 73092 KB Output is correct
5 Correct 1166 ms 36664 KB Output is correct
6 Correct 1279 ms 73092 KB Output is correct
7 Correct 1006 ms 49836 KB Output is correct
8 Correct 1380 ms 73132 KB Output is correct

Subtask #2
0 / 8.0

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

Subtask #3
0 / 13.0

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

Subtask #4
0 / 12.0

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

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 584 KB Output is correct
2 Correct 1 ms 584 KB Output is correct
3 Correct 1 ms 584 KB Output is correct
4 Correct 293 ms 33352 KB Output is correct
5 Correct 1083 ms 73120 KB Output is correct
6 Correct 870 ms 12284 KB Output is correct
7 Correct 1183 ms 73120 KB Output is correct
8 Correct 827 ms 25168 KB Output is correct
9 Correct 1104 ms 73112 KB Output is correct
10 Correct 1221 ms 73124 KB Output is correct
11 Correct 1093 ms 73012 KB Output is correct
12 Correct 1351 ms 73216 KB Output is correct
13 Correct 1020 ms 73096 KB Output is correct
14 Correct 1117 ms 73108 KB Output is correct
15 Correct 1025 ms 73012 KB Output is correct
16 Correct 1263 ms 73072 KB Output is correct
17 Correct 1 ms 584 KB Output is correct
18 Correct 1 ms 584 KB Output is correct
19 Correct 2 ms 584 KB Output is correct
20 Correct 4 ms 584 KB Output is correct
21 Correct 2 ms 584 KB Output is correct
22 Correct 4 ms 584 KB Output is correct
23 Correct 3 ms 584 KB Output is correct
24 Correct 3 ms 584 KB Output is correct
25 Correct 1 ms 584 KB Output is correct
26 Correct 1 ms 712 KB Output is correct
27 Correct 24 ms 1224 KB Output is correct
28 Correct 23 ms 1352 KB Output is correct
29 Correct 25 ms 1224 KB Output is correct
30 Correct 21 ms 1224 KB Output is correct
31 Correct 30 ms 1224 KB Output is correct
32 Correct 1 ms 584 KB Output is correct
33 Correct 64 ms 42232 KB Output is correct
34 Correct 108 ms 73124 KB Output is correct
35 Correct 115 ms 73120 KB Output is correct
36 Correct 133 ms 73112 KB Output is correct
37 Correct 110 ms 73112 KB Output is correct
38 Correct 102 ms 73036 KB Output is correct

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 584 KB Output is correct
2 Correct 1 ms 584 KB Output is correct
3 Correct 1 ms 584 KB Output is correct
4 Correct 293 ms 33352 KB Output is correct
5 Correct 1083 ms 73120 KB Output is correct
6 Correct 870 ms 12284 KB Output is correct
7 Correct 1183 ms 73120 KB Output is correct
8 Correct 827 ms 25168 KB Output is correct
9 Correct 1104 ms 73112 KB Output is correct
10 Correct 1221 ms 73124 KB Output is correct
11 Correct 1093 ms 73012 KB Output is correct
12 Correct 1351 ms 73216 KB Output is correct
13 Correct 1020 ms 73096 KB Output is correct
14 Correct 1117 ms 73108 KB Output is correct
15 Correct 1025 ms 73012 KB Output is correct
16 Correct 1263 ms 73072 KB Output is correct
17 Correct 1 ms 584 KB Output is correct
18 Correct 1 ms 584 KB Output is correct
19 Correct 2 ms 584 KB Output is correct
20 Correct 4 ms 584 KB Output is correct
21 Correct 2 ms 584 KB Output is correct
22 Correct 4 ms 584 KB Output is correct
23 Correct 3 ms 584 KB Output is correct
24 Correct 3 ms 584 KB Output is correct
25 Correct 1 ms 584 KB Output is correct
26 Correct 1 ms 712 KB Output is correct
27 Correct 24 ms 1224 KB Output is correct
28 Correct 23 ms 1352 KB Output is correct
29 Correct 25 ms 1224 KB Output is correct
30 Correct 21 ms 1224 KB Output is correct
31 Correct 30 ms 1224 KB Output is correct
32 Correct 1 ms 584 KB Output is correct
33 Correct 64 ms 42232 KB Output is correct
34 Correct 108 ms 73124 KB Output is correct
35 Correct 115 ms 73120 KB Output is correct
36 Correct 133 ms 73112 KB Output is correct
37 Correct 110 ms 73112 KB Output is correct
38 Correct 102 ms 73036 KB Output is correct
39 Correct 1 ms 584 KB Output is correct
40 Correct 1 ms 584 KB Output is correct
41 Correct 1 ms 584 KB Output is correct
42 Correct 346 ms 33336 KB Output is correct
43 Correct 1200 ms 73032 KB Output is correct
44 Correct 849 ms 12276 KB Output is correct
45 Correct 1233 ms 73108 KB Output is correct
46 Correct 847 ms 25228 KB Output is correct
47 Correct 972 ms 73120 KB Output is correct
48 Correct 1320 ms 73128 KB Output is correct
49 Correct 1296 ms 73124 KB Output is correct
50 Correct 1189 ms 73160 KB Output is correct
51 Correct 1382 ms 73120 KB Output is correct
52 Correct 1352 ms 73120 KB Output is correct
53 Correct 1220 ms 73040 KB Output is correct
54 Correct 1301 ms 73112 KB Output is correct
55 Correct 1 ms 584 KB Output is correct
56 Incorrect 177 ms 72824 KB Output isn't correct
57 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 584 KB Output is correct
2 Correct 1 ms 584 KB Output is correct
3 Correct 199 ms 58220 KB Output is correct
4 Correct 1469 ms 73092 KB Output is correct
5 Correct 1166 ms 36664 KB Output is correct
6 Correct 1279 ms 73092 KB Output is correct
7 Correct 1006 ms 49836 KB Output is correct
8 Correct 1380 ms 73132 KB Output is correct
9 Correct 1 ms 584 KB Output is correct
10 Correct 1 ms 584 KB Output is correct
11 Correct 1 ms 584 KB Output is correct
12 Correct 1 ms 584 KB Output is correct
13 Incorrect 3 ms 584 KB Output isn't correct
14 Halted 0 ms 0 KB -