oj.uz

Submission #424053

# Submission time Handle Problem Language Result Execution time Memory
424053 2021-06-11T15:57:33 Z SorahISA Rainforest Jumps (APIO21_jumps) C++17
48 / 100
 1690 ms 44964 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)
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] = {0, N-1}, jump[0][N-1] = {N-1, N-1};
    
    for (int i = 1, lo, mi, hi; i < N-1; ++i) {
        auto &jmp = jump[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 = 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 = 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;
        }
    }
}

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

Compilation message

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

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 456 KB Output is correct
2 Correct 1 ms 456 KB Output is correct
3 Correct 236 ms 35592 KB Output is correct
4 Correct 1508 ms 44820 KB Output is correct
5 Correct 1063 ms 22480 KB Output is correct
6 Correct 1690 ms 44800 KB Output is correct
7 Correct 1131 ms 30516 KB Output is correct
8 Correct 1425 ms 44820 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 456 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 456 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 456 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 456 KB Output is correct
2 Correct 1 ms 456 KB Output is correct
3 Correct 1 ms 456 KB Output is correct
4 Correct 315 ms 20412 KB Output is correct
5 Correct 1364 ms 44804 KB Output is correct
6 Correct 671 ms 7504 KB Output is correct
7 Correct 1096 ms 44832 KB Output is correct
8 Correct 761 ms 15380 KB Output is correct
9 Correct 1227 ms 44816 KB Output is correct
10 Correct 1306 ms 44848 KB Output is correct
11 Correct 1348 ms 44872 KB Output is correct
12 Correct 1509 ms 44820 KB Output is correct
13 Correct 1321 ms 44872 KB Output is correct
14 Correct 1440 ms 44808 KB Output is correct
15 Correct 1267 ms 44900 KB Output is correct
16 Correct 1262 ms 44840 KB Output is correct
17 Correct 0 ms 456 KB Output is correct
18 Correct 1 ms 456 KB Output is correct
19 Correct 2 ms 456 KB Output is correct
20 Correct 2 ms 456 KB Output is correct
21 Correct 3 ms 456 KB Output is correct
22 Correct 4 ms 456 KB Output is correct
23 Correct 3 ms 456 KB Output is correct
24 Correct 3 ms 456 KB Output is correct
25 Correct 1 ms 456 KB Output is correct
26 Correct 2 ms 584 KB Output is correct
27 Correct 22 ms 840 KB Output is correct
28 Correct 27 ms 840 KB Output is correct
29 Correct 32 ms 840 KB Output is correct
30 Correct 33 ms 840 KB Output is correct
31 Correct 32 ms 840 KB Output is correct
32 Correct 0 ms 456 KB Output is correct
33 Correct 49 ms 25820 KB Output is correct
34 Correct 110 ms 44820 KB Output is correct
35 Correct 126 ms 44948 KB Output is correct
36 Correct 86 ms 44896 KB Output is correct
37 Correct 87 ms 44836 KB Output is correct
38 Correct 98 ms 44828 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 456 KB Output is correct
2 Correct 1 ms 456 KB Output is correct
3 Correct 1 ms 456 KB Output is correct
4 Correct 315 ms 20412 KB Output is correct
5 Correct 1364 ms 44804 KB Output is correct
6 Correct 671 ms 7504 KB Output is correct
7 Correct 1096 ms 44832 KB Output is correct
8 Correct 761 ms 15380 KB Output is correct
9 Correct 1227 ms 44816 KB Output is correct
10 Correct 1306 ms 44848 KB Output is correct
11 Correct 1348 ms 44872 KB Output is correct
12 Correct 1509 ms 44820 KB Output is correct
13 Correct 1321 ms 44872 KB Output is correct
14 Correct 1440 ms 44808 KB Output is correct
15 Correct 1267 ms 44900 KB Output is correct
16 Correct 1262 ms 44840 KB Output is correct
17 Correct 0 ms 456 KB Output is correct
18 Correct 1 ms 456 KB Output is correct
19 Correct 2 ms 456 KB Output is correct
20 Correct 2 ms 456 KB Output is correct
21 Correct 3 ms 456 KB Output is correct
22 Correct 4 ms 456 KB Output is correct
23 Correct 3 ms 456 KB Output is correct
24 Correct 3 ms 456 KB Output is correct
25 Correct 1 ms 456 KB Output is correct
26 Correct 2 ms 584 KB Output is correct
27 Correct 22 ms 840 KB Output is correct
28 Correct 27 ms 840 KB Output is correct
29 Correct 32 ms 840 KB Output is correct
30 Correct 33 ms 840 KB Output is correct
31 Correct 32 ms 840 KB Output is correct
32 Correct 0 ms 456 KB Output is correct
33 Correct 49 ms 25820 KB Output is correct
34 Correct 110 ms 44820 KB Output is correct
35 Correct 126 ms 44948 KB Output is correct
36 Correct 86 ms 44896 KB Output is correct
37 Correct 87 ms 44836 KB Output is correct
38 Correct 98 ms 44828 KB Output is correct
39 Correct 1 ms 456 KB Output is correct
40 Correct 0 ms 456 KB Output is correct
41 Correct 0 ms 456 KB Output is correct
42 Correct 240 ms 20460 KB Output is correct
43 Correct 1159 ms 44852 KB Output is correct
44 Correct 793 ms 7492 KB Output is correct
45 Correct 1124 ms 44820 KB Output is correct
46 Correct 734 ms 15400 KB Output is correct
47 Correct 1342 ms 44852 KB Output is correct
48 Correct 1199 ms 44844 KB Output is correct
49 Correct 1323 ms 44852 KB Output is correct
50 Correct 1267 ms 44892 KB Output is correct
51 Correct 1414 ms 44884 KB Output is correct
52 Correct 1180 ms 44820 KB Output is correct
53 Correct 937 ms 44820 KB Output is correct
54 Correct 872 ms 44804 KB Output is correct
55 Correct 0 ms 456 KB Output is correct
56 Correct 156 ms 44632 KB Output is correct
57 Correct 1201 ms 44804 KB Output is correct
58 Correct 653 ms 8004 KB Output is correct
59 Correct 1002 ms 44872 KB Output is correct
60 Correct 420 ms 16024 KB Output is correct
61 Correct 1335 ms 44800 KB Output is correct
62 Correct 1225 ms 44876 KB Output is correct
63 Correct 1234 ms 44944 KB Output is correct
64 Correct 1608 ms 44824 KB Output is correct
65 Correct 1242 ms 44820 KB Output is correct
66 Correct 1464 ms 44848 KB Output is correct
67 Correct 1195 ms 44820 KB Output is correct
68 Correct 1306 ms 44816 KB Output is correct
69 Correct 1 ms 512 KB Output is correct
70 Correct 1 ms 456 KB Output is correct
71 Correct 3 ms 456 KB Output is correct
72 Correct 3 ms 456 KB Output is correct
73 Correct 3 ms 456 KB Output is correct
74 Correct 3 ms 456 KB Output is correct
75 Correct 3 ms 456 KB Output is correct
76 Correct 1 ms 456 KB Output is correct
77 Correct 1 ms 456 KB Output is correct
78 Correct 2 ms 456 KB Output is correct
79 Correct 3 ms 456 KB Output is correct
80 Correct 4 ms 456 KB Output is correct
81 Correct 3 ms 456 KB Output is correct
82 Correct 3 ms 456 KB Output is correct
83 Correct 3 ms 456 KB Output is correct
84 Correct 1 ms 456 KB Output is correct
85 Correct 4 ms 456 KB Output is correct
86 Correct 29 ms 840 KB Output is correct
87 Correct 17 ms 840 KB Output is correct
88 Correct 29 ms 840 KB Output is correct
89 Correct 28 ms 840 KB Output is correct
90 Correct 29 ms 840 KB Output is correct
91 Correct 1 ms 456 KB Output is correct
92 Correct 2 ms 584 KB Output is correct
93 Correct 18 ms 840 KB Output is correct
94 Correct 22 ms 840 KB Output is correct
95 Correct 24 ms 840 KB Output is correct
96 Correct 28 ms 840 KB Output is correct
97 Correct 21 ms 840 KB Output is correct
98 Correct 1 ms 456 KB Output is correct
99 Correct 101 ms 44852 KB Output is correct
100 Correct 92 ms 44804 KB Output is correct
101 Correct 100 ms 44808 KB Output is correct
102 Correct 99 ms 44784 KB Output is correct
103 Correct 104 ms 44964 KB Output is correct
104 Correct 89 ms 44872 KB Output is correct
105 Correct 1 ms 456 KB Output is correct
106 Correct 50 ms 25880 KB Output is correct
107 Correct 98 ms 44832 KB Output is correct
108 Correct 94 ms 44808 KB Output is correct
109 Correct 100 ms 44896 KB Output is correct
110 Correct 98 ms 44844 KB Output is correct
111 Correct 96 ms 44820 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 456 KB Output is correct
2 Correct 1 ms 456 KB Output is correct
3 Correct 236 ms 35592 KB Output is correct
4 Correct 1508 ms 44820 KB Output is correct
5 Correct 1063 ms 22480 KB Output is correct
6 Correct 1690 ms 44800 KB Output is correct
7 Correct 1131 ms 30516 KB Output is correct
8 Correct 1425 ms 44820 KB Output is correct
9 Incorrect 1 ms 456 KB Output isn't correct
10 Halted 0 ms 0 KB -