oj.uz

Submission #558951

# Submission time Handle Problem Language Result Execution time Memory
558951 2022-05-09T02:55:37 Z hoanghq2004 Rainforest Jumps (APIO21_jumps) C++14
48 / 100
 1123 ms 50432 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include "jumps.h"

using namespace __gnu_pbds;
using namespace std;

template <typename T>
using ordered_set = tree <T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;

const int N = 2e5 + 10;

int n, h[N];
int high[N][20];
int L[N][20], R[N][20];

void init(int N, std::vector<int> H) {
    n = N;
    h[0] = h[n + 1] = 1e9;
    for (int i = 1; i <= n; ++i) h[i] = H[i - 1];
    stack <int> stk;
    for (int i = 1; i <= n; ++i) {
        while (stk.size() && h[stk.top()] < h[i]) {
            R[stk.top()][0] = i;
            stk.pop();
        }
        stk.push(i);
    }
    while (stk.size()) R[stk.top()][0] = n + 1, stk.pop();
    for (int i = n; i >= 1; --i) {
        while (stk.size() && h[stk.top()] < h[i]) {
            L[stk.top()][0] = i;
            stk.pop();
        }
        stk.push(i);
    }
    while (stk.size()) L[stk.top()][0] = 0, stk.pop();
    for (int i = 1; i <= n; ++i) {
        high[i][0] = (h[L[i][0]] > h[R[i][0]] ? L[i][0] : R[i][0]);
    }
    for (int lg = 1; (1 << lg) <= n; ++lg) {
        for (int i = 1; i + (1 << lg) - 1 <= n; ++i) {
            high[i][lg] = high[high[i][lg - 1]][lg - 1];
            L[i][lg] = L[L[i][lg - 1]][lg - 1];
            R[i][lg] = R[R[i][lg - 1]][lg - 1];
        }
    }
}

int minimum_jumps(int A, int B, int C, int D) {
    ++A, ++B, ++C, ++D;
    int cost = 0;
    for (int lg = 19; lg >= 0; --lg)
        if (L[B][lg] >= A && R[L[B][lg]][0] <= D) B = L[B][lg];
    for (int lg = 19; lg >= 0; --lg)
        if (high[B][lg] && high[B][lg] <= n && R[high[B][lg]][0] < C) B = high[B][lg], cost += (1 << lg);
    if (high[B][0] && high[B][0] <= n && R[high[B][0]][0] <= D) {
        B = high[B][0];
        ++cost;
    }
    for (int lg = 19; lg >= 0; --lg)
        if (R[B][lg] && R[B][lg] < C) {
            B = R[B][lg];
            cost += (1 << lg);
        }
    ++cost;
    B = R[B][0];
    assert(B >= C);
    if (B > D) return -1;
    return cost;
}
//
//int main() {
//  int N, Q;
//  assert(2 == scanf("%d %d", &N, &Q));
//  std::vector<int> H(N);
//  for (int i = 0; i < N; ++i) {
//    assert(1 == scanf("%d", &H[i]));
//  }
//  init(N, H);
//
//  for (int i = 0; i < Q; ++i) {
//    int A, B, C, D;
//    assert(4 == scanf("%d %d %d %d", &A, &B, &C, &D));
//    printf("%d\n", minimum_jumps(A, B, C, D));
//  }
//  return 0;
//}
//

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 168 ms 40324 KB Output is correct
4 Correct 816 ms 50368 KB Output is correct
5 Correct 819 ms 25544 KB Output is correct
6 Correct 915 ms 50356 KB Output is correct
7 Correct 783 ms 34560 KB Output is correct
8 Correct 882 ms 50336 KB Output is correct

Subtask #2
0 / 8.0

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

Subtask #3
0 / 13.0

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

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 90 ms 39988 KB Output is correct
6 Correct 108 ms 49712 KB Output is correct
7 Correct 46 ms 25564 KB Output is correct
8 Correct 97 ms 49572 KB Output is correct
9 Correct 9 ms 7632 KB Output is correct
10 Correct 97 ms 49576 KB Output is correct
11 Correct 93 ms 50376 KB Output is correct
12 Correct 91 ms 50180 KB Output is correct
13 Correct 88 ms 50196 KB Output is correct
14 Correct 98 ms 49600 KB Output is correct
15 Incorrect 102 ms 49892 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 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 234 ms 22876 KB Output is correct
5 Correct 869 ms 49572 KB Output is correct
6 Correct 597 ms 8460 KB Output is correct
7 Correct 867 ms 49608 KB Output is correct
8 Correct 358 ms 17172 KB Output is correct
9 Correct 890 ms 49672 KB Output is correct
10 Correct 932 ms 50376 KB Output is correct
11 Correct 970 ms 50140 KB Output is correct
12 Correct 884 ms 50232 KB Output is correct
13 Correct 880 ms 49484 KB Output is correct
14 Correct 919 ms 49920 KB Output is correct
15 Correct 873 ms 50368 KB Output is correct
16 Correct 858 ms 50376 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 2 ms 208 KB Output is correct
20 Correct 2 ms 336 KB Output is correct
21 Correct 2 ms 336 KB Output is correct
22 Correct 2 ms 336 KB Output is correct
23 Correct 2 ms 336 KB Output is correct
24 Correct 2 ms 336 KB Output is correct
25 Correct 0 ms 336 KB Output is correct
26 Correct 1 ms 464 KB Output is correct
27 Correct 17 ms 724 KB Output is correct
28 Correct 15 ms 720 KB Output is correct
29 Correct 17 ms 720 KB Output is correct
30 Correct 18 ms 720 KB Output is correct
31 Correct 17 ms 720 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 53 ms 28836 KB Output is correct
34 Correct 97 ms 49616 KB Output is correct
35 Correct 87 ms 50208 KB Output is correct
36 Correct 96 ms 49568 KB Output is correct
37 Correct 112 ms 49940 KB Output is correct
38 Correct 87 ms 50376 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 234 ms 22876 KB Output is correct
5 Correct 869 ms 49572 KB Output is correct
6 Correct 597 ms 8460 KB Output is correct
7 Correct 867 ms 49608 KB Output is correct
8 Correct 358 ms 17172 KB Output is correct
9 Correct 890 ms 49672 KB Output is correct
10 Correct 932 ms 50376 KB Output is correct
11 Correct 970 ms 50140 KB Output is correct
12 Correct 884 ms 50232 KB Output is correct
13 Correct 880 ms 49484 KB Output is correct
14 Correct 919 ms 49920 KB Output is correct
15 Correct 873 ms 50368 KB Output is correct
16 Correct 858 ms 50376 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 2 ms 208 KB Output is correct
20 Correct 2 ms 336 KB Output is correct
21 Correct 2 ms 336 KB Output is correct
22 Correct 2 ms 336 KB Output is correct
23 Correct 2 ms 336 KB Output is correct
24 Correct 2 ms 336 KB Output is correct
25 Correct 0 ms 336 KB Output is correct
26 Correct 1 ms 464 KB Output is correct
27 Correct 17 ms 724 KB Output is correct
28 Correct 15 ms 720 KB Output is correct
29 Correct 17 ms 720 KB Output is correct
30 Correct 18 ms 720 KB Output is correct
31 Correct 17 ms 720 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 53 ms 28836 KB Output is correct
34 Correct 97 ms 49616 KB Output is correct
35 Correct 87 ms 50208 KB Output is correct
36 Correct 96 ms 49568 KB Output is correct
37 Correct 112 ms 49940 KB Output is correct
38 Correct 87 ms 50376 KB Output is correct
39 Correct 1 ms 208 KB Output is correct
40 Correct 0 ms 208 KB Output is correct
41 Correct 0 ms 208 KB Output is correct
42 Correct 196 ms 22864 KB Output is correct
43 Correct 840 ms 49696 KB Output is correct
44 Correct 570 ms 8400 KB Output is correct
45 Correct 824 ms 49568 KB Output is correct
46 Correct 534 ms 17224 KB Output is correct
47 Correct 856 ms 49528 KB Output is correct
48 Correct 987 ms 50376 KB Output is correct
49 Correct 832 ms 50260 KB Output is correct
50 Correct 829 ms 50212 KB Output is correct
51 Correct 878 ms 49572 KB Output is correct
52 Correct 1025 ms 49940 KB Output is correct
53 Correct 702 ms 50356 KB Output is correct
54 Correct 830 ms 50336 KB Output is correct
55 Correct 0 ms 208 KB Output is correct
56 Correct 161 ms 49328 KB Output is correct
57 Correct 621 ms 49608 KB Output is correct
58 Correct 411 ms 8912 KB Output is correct
59 Correct 680 ms 49480 KB Output is correct
60 Correct 371 ms 17744 KB Output is correct
61 Correct 888 ms 49572 KB Output is correct
62 Correct 907 ms 50320 KB Output is correct
63 Correct 985 ms 50220 KB Output is correct
64 Correct 921 ms 50108 KB Output is correct
65 Correct 776 ms 49520 KB Output is correct
66 Correct 1123 ms 49976 KB Output is correct
67 Correct 926 ms 50380 KB Output is correct
68 Correct 734 ms 50376 KB Output is correct
69 Correct 0 ms 208 KB Output is correct
70 Correct 1 ms 336 KB Output is correct
71 Correct 3 ms 336 KB Output is correct
72 Correct 2 ms 336 KB Output is correct
73 Correct 2 ms 336 KB Output is correct
74 Correct 2 ms 336 KB Output is correct
75 Correct 2 ms 336 KB Output is correct
76 Correct 0 ms 208 KB Output is correct
77 Correct 0 ms 208 KB Output is correct
78 Correct 2 ms 208 KB Output is correct
79 Correct 2 ms 336 KB Output is correct
80 Correct 2 ms 336 KB Output is correct
81 Correct 2 ms 336 KB Output is correct
82 Correct 2 ms 336 KB Output is correct
83 Correct 2 ms 336 KB Output is correct
84 Correct 0 ms 336 KB Output is correct
85 Correct 3 ms 336 KB Output is correct
86 Correct 18 ms 720 KB Output is correct
87 Correct 18 ms 720 KB Output is correct
88 Correct 18 ms 720 KB Output is correct
89 Correct 16 ms 720 KB Output is correct
90 Correct 18 ms 720 KB Output is correct
91 Correct 0 ms 336 KB Output is correct
92 Correct 1 ms 464 KB Output is correct
93 Correct 19 ms 720 KB Output is correct
94 Correct 21 ms 720 KB Output is correct
95 Correct 17 ms 720 KB Output is correct
96 Correct 17 ms 720 KB Output is correct
97 Correct 15 ms 720 KB Output is correct
98 Correct 0 ms 208 KB Output is correct
99 Correct 102 ms 49640 KB Output is correct
100 Correct 110 ms 49596 KB Output is correct
101 Correct 92 ms 50340 KB Output is correct
102 Correct 96 ms 49612 KB Output is correct
103 Correct 101 ms 49940 KB Output is correct
104 Correct 87 ms 50336 KB Output is correct
105 Correct 0 ms 208 KB Output is correct
106 Correct 52 ms 28856 KB Output is correct
107 Correct 99 ms 49608 KB Output is correct
108 Correct 88 ms 50228 KB Output is correct
109 Correct 113 ms 49544 KB Output is correct
110 Correct 101 ms 49968 KB Output is correct
111 Correct 88 ms 50432 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 168 ms 40324 KB Output is correct
4 Correct 816 ms 50368 KB Output is correct
5 Correct 819 ms 25544 KB Output is correct
6 Correct 915 ms 50356 KB Output is correct
7 Correct 783 ms 34560 KB Output is correct
8 Correct 882 ms 50336 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 0 ms 208 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Incorrect 2 ms 208 KB Output isn't correct
14 Halted 0 ms 0 KB -