oj.uz

Submission #558945

# Submission time Handle Problem Language Result Execution time Memory
558945 2022-05-09T02:48:57 Z hoanghq2004 Rainforest Jumps (APIO21_jumps) C++14
44 / 100
 1330 ms 50440 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;
    }
    assert(B);
    for (int lg = 19; lg >= 0; --lg)
        if (B < C && R[B][lg] && R[B][lg] <= D) {
            B = R[B][lg];
            cost += (1 << lg);
        }
    if (B > D || B < C) 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
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 Incorrect 134 ms 40244 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Incorrect 3 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 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Incorrect 3 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 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 95 ms 40000 KB Output is correct
6 Correct 104 ms 49608 KB Output is correct
7 Correct 58 ms 25468 KB Output is correct
8 Correct 126 ms 49616 KB Output is correct
9 Correct 14 ms 7728 KB Output is correct
10 Correct 118 ms 49568 KB Output is correct
11 Incorrect 117 ms 50388 KB Output isn't correct
12 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 1 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 208 ms 22928 KB Output is correct
5 Correct 920 ms 49588 KB Output is correct
6 Correct 668 ms 8432 KB Output is correct
7 Correct 881 ms 49700 KB Output is correct
8 Correct 615 ms 17216 KB Output is correct
9 Correct 903 ms 49592 KB Output is correct
10 Correct 991 ms 50436 KB Output is correct
11 Correct 1057 ms 50256 KB Output is correct
12 Correct 909 ms 50288 KB Output is correct
13 Correct 1051 ms 49636 KB Output is correct
14 Correct 1191 ms 50084 KB Output is correct
15 Correct 907 ms 50372 KB Output is correct
16 Correct 1149 ms 50352 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 2 ms 208 KB Output is correct
20 Correct 4 ms 336 KB Output is correct
21 Correct 2 ms 336 KB Output is correct
22 Correct 4 ms 336 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 3 ms 364 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 2 ms 464 KB Output is correct
27 Correct 14 ms 768 KB Output is correct
28 Correct 16 ms 720 KB Output is correct
29 Correct 13 ms 768 KB Output is correct
30 Correct 12 ms 720 KB Output is correct
31 Correct 10 ms 720 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 73 ms 28864 KB Output is correct
34 Correct 130 ms 49572 KB Output is correct
35 Correct 120 ms 50308 KB Output is correct
36 Correct 122 ms 49592 KB Output is correct
37 Correct 133 ms 50008 KB Output is correct
38 Correct 116 ms 50436 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 1 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 208 ms 22928 KB Output is correct
5 Correct 920 ms 49588 KB Output is correct
6 Correct 668 ms 8432 KB Output is correct
7 Correct 881 ms 49700 KB Output is correct
8 Correct 615 ms 17216 KB Output is correct
9 Correct 903 ms 49592 KB Output is correct
10 Correct 991 ms 50436 KB Output is correct
11 Correct 1057 ms 50256 KB Output is correct
12 Correct 909 ms 50288 KB Output is correct
13 Correct 1051 ms 49636 KB Output is correct
14 Correct 1191 ms 50084 KB Output is correct
15 Correct 907 ms 50372 KB Output is correct
16 Correct 1149 ms 50352 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 2 ms 208 KB Output is correct
20 Correct 4 ms 336 KB Output is correct
21 Correct 2 ms 336 KB Output is correct
22 Correct 4 ms 336 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 3 ms 364 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 2 ms 464 KB Output is correct
27 Correct 14 ms 768 KB Output is correct
28 Correct 16 ms 720 KB Output is correct
29 Correct 13 ms 768 KB Output is correct
30 Correct 12 ms 720 KB Output is correct
31 Correct 10 ms 720 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 73 ms 28864 KB Output is correct
34 Correct 130 ms 49572 KB Output is correct
35 Correct 120 ms 50308 KB Output is correct
36 Correct 122 ms 49592 KB Output is correct
37 Correct 133 ms 50008 KB Output is correct
38 Correct 116 ms 50436 KB Output is correct
39 Correct 3 ms 208 KB Output is correct
40 Correct 1 ms 384 KB Output is correct
41 Correct 1 ms 208 KB Output is correct
42 Correct 318 ms 22856 KB Output is correct
43 Correct 989 ms 49620 KB Output is correct
44 Correct 750 ms 8400 KB Output is correct
45 Correct 1111 ms 49628 KB Output is correct
46 Correct 667 ms 17372 KB Output is correct
47 Correct 1330 ms 49480 KB Output is correct
48 Correct 1027 ms 50340 KB Output is correct
49 Correct 1273 ms 50288 KB Output is correct
50 Correct 1038 ms 50320 KB Output is correct
51 Correct 953 ms 49616 KB Output is correct
52 Correct 1255 ms 49920 KB Output is correct
53 Correct 923 ms 50352 KB Output is correct
54 Correct 904 ms 50440 KB Output is correct
55 Correct 1 ms 208 KB Output is correct
56 Correct 170 ms 49420 KB Output is correct
57 Correct 977 ms 49616 KB Output is correct
58 Correct 603 ms 8968 KB Output is correct
59 Correct 835 ms 49572 KB Output is correct
60 Correct 537 ms 17836 KB Output is correct
61 Correct 992 ms 49672 KB Output is correct
62 Correct 1091 ms 50436 KB Output is correct
63 Correct 1097 ms 50228 KB Output is correct
64 Correct 867 ms 50076 KB Output is correct
65 Correct 774 ms 49724 KB Output is correct
66 Correct 1202 ms 49972 KB Output is correct
67 Correct 1097 ms 50432 KB Output is correct
68 Correct 1184 ms 50436 KB Output is correct
69 Correct 1 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 4 ms 336 KB Output is correct
73 Correct 2 ms 336 KB Output is correct
74 Correct 3 ms 336 KB Output is correct
75 Correct 2 ms 336 KB Output is correct
76 Correct 1 ms 208 KB Output is correct
77 Correct 1 ms 208 KB Output is correct
78 Correct 2 ms 208 KB Output is correct
79 Correct 3 ms 336 KB Output is correct
80 Correct 3 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 6 ms 336 KB Output is correct
86 Correct 25 ms 720 KB Output is correct
87 Correct 27 ms 720 KB Output is correct
88 Correct 14 ms 720 KB Output is correct
89 Correct 25 ms 720 KB Output is correct
90 Correct 24 ms 720 KB Output is correct
91 Correct 1 ms 384 KB Output is correct
92 Correct 1 ms 464 KB Output is correct
93 Correct 24 ms 720 KB Output is correct
94 Correct 19 ms 720 KB Output is correct
95 Correct 26 ms 720 KB Output is correct
96 Correct 16 ms 720 KB Output is correct
97 Correct 26 ms 720 KB Output is correct
98 Correct 0 ms 208 KB Output is correct
99 Correct 124 ms 49468 KB Output is correct
100 Correct 99 ms 49608 KB Output is correct
101 Correct 96 ms 50248 KB Output is correct
102 Correct 122 ms 49612 KB Output is correct
103 Correct 138 ms 49904 KB Output is correct
104 Correct 114 ms 50372 KB Output is correct
105 Correct 0 ms 256 KB Output is correct
106 Correct 55 ms 28808 KB Output is correct
107 Correct 105 ms 49700 KB Output is correct
108 Correct 110 ms 50208 KB Output is correct
109 Correct 128 ms 49612 KB Output is correct
110 Correct 129 ms 49888 KB Output is correct
111 Correct 114 ms 50344 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 Incorrect 134 ms 40244 KB Output isn't correct
4 Halted 0 ms 0 KB -