oj.uz

Submission #558957

# Submission time Handle Problem Language Result Execution time Memory
558957 2022-05-09T03:07:55 Z hoanghq2004 Rainforest Jumps (APIO21_jumps) C++14
48 / 100
 1169 ms 50544 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;
    }
    if (B > D) return -1;
    for (int lg = 19; lg >= 0; --lg)
        if (R[B][lg] && R[B][lg] <= n && R[B][lg] < C) {
            B = R[B][lg];
            cost += (1 << lg);
        }
    ++cost;
    B = R[B][0];
    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 1 ms 208 KB Output is correct
3 Correct 240 ms 40184 KB Output is correct
4 Correct 1154 ms 50352 KB Output is correct
5 Correct 1034 ms 25432 KB Output is correct
6 Correct 948 ms 50440 KB Output is correct
7 Correct 685 ms 34440 KB Output is correct
8 Correct 1104 ms 50336 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 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 292 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 0 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 292 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 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 94 ms 39992 KB Output is correct
6 Correct 132 ms 49608 KB Output is correct
7 Correct 54 ms 25536 KB Output is correct
8 Correct 159 ms 49588 KB Output is correct
9 Correct 13 ms 7632 KB Output is correct
10 Correct 113 ms 49604 KB Output is correct
11 Correct 157 ms 50440 KB Output is correct
12 Correct 112 ms 50200 KB Output is correct
13 Correct 151 ms 50200 KB Output is correct
14 Correct 126 ms 49588 KB Output is correct
15 Incorrect 145 ms 49976 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 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 265 ms 22860 KB Output is correct
5 Correct 850 ms 49568 KB Output is correct
6 Correct 604 ms 8376 KB Output is correct
7 Correct 812 ms 49612 KB Output is correct
8 Correct 505 ms 17232 KB Output is correct
9 Correct 940 ms 49576 KB Output is correct
10 Correct 1059 ms 50524 KB Output is correct
11 Correct 978 ms 50140 KB Output is correct
12 Correct 811 ms 50320 KB Output is correct
13 Correct 1014 ms 49608 KB Output is correct
14 Correct 1020 ms 49928 KB Output is correct
15 Correct 902 ms 50428 KB Output is correct
16 Correct 905 ms 50436 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 3 ms 336 KB Output is correct
24 Correct 3 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 19 ms 720 KB Output is correct
28 Correct 17 ms 720 KB Output is correct
29 Correct 20 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 59 ms 28792 KB Output is correct
34 Correct 102 ms 49572 KB Output is correct
35 Correct 95 ms 50232 KB Output is correct
36 Correct 100 ms 49480 KB Output is correct
37 Correct 110 ms 49940 KB Output is correct
38 Correct 92 ms 50384 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 265 ms 22860 KB Output is correct
5 Correct 850 ms 49568 KB Output is correct
6 Correct 604 ms 8376 KB Output is correct
7 Correct 812 ms 49612 KB Output is correct
8 Correct 505 ms 17232 KB Output is correct
9 Correct 940 ms 49576 KB Output is correct
10 Correct 1059 ms 50524 KB Output is correct
11 Correct 978 ms 50140 KB Output is correct
12 Correct 811 ms 50320 KB Output is correct
13 Correct 1014 ms 49608 KB Output is correct
14 Correct 1020 ms 49928 KB Output is correct
15 Correct 902 ms 50428 KB Output is correct
16 Correct 905 ms 50436 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 3 ms 336 KB Output is correct
24 Correct 3 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 19 ms 720 KB Output is correct
28 Correct 17 ms 720 KB Output is correct
29 Correct 20 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 59 ms 28792 KB Output is correct
34 Correct 102 ms 49572 KB Output is correct
35 Correct 95 ms 50232 KB Output is correct
36 Correct 100 ms 49480 KB Output is correct
37 Correct 110 ms 49940 KB Output is correct
38 Correct 92 ms 50384 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 250 ms 22860 KB Output is correct
43 Correct 944 ms 49572 KB Output is correct
44 Correct 584 ms 8400 KB Output is correct
45 Correct 867 ms 49688 KB Output is correct
46 Correct 540 ms 17232 KB Output is correct
47 Correct 935 ms 49608 KB Output is correct
48 Correct 1027 ms 50356 KB Output is correct
49 Correct 789 ms 50268 KB Output is correct
50 Correct 955 ms 50264 KB Output is correct
51 Correct 965 ms 49484 KB Output is correct
52 Correct 1036 ms 49888 KB Output is correct
53 Correct 987 ms 50544 KB Output is correct
54 Correct 931 ms 50344 KB Output is correct
55 Correct 0 ms 208 KB Output is correct
56 Correct 137 ms 49428 KB Output is correct
57 Correct 725 ms 49572 KB Output is correct
58 Correct 528 ms 8912 KB Output is correct
59 Correct 1032 ms 49560 KB Output is correct
60 Correct 427 ms 17836 KB Output is correct
61 Correct 1026 ms 49620 KB Output is correct
62 Correct 1008 ms 50336 KB Output is correct
63 Correct 944 ms 50144 KB Output is correct
64 Correct 1141 ms 50140 KB Output is correct
65 Correct 981 ms 49596 KB Output is correct
66 Correct 1033 ms 49976 KB Output is correct
67 Correct 1169 ms 50352 KB Output is correct
68 Correct 1078 ms 50432 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 3 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 4 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 3 ms 208 KB Output is correct
79 Correct 3 ms 336 KB Output is correct
80 Correct 2 ms 336 KB Output is correct
81 Correct 3 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 4 ms 336 KB Output is correct
86 Correct 20 ms 720 KB Output is correct
87 Correct 21 ms 720 KB Output is correct
88 Correct 25 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 336 KB Output is correct
92 Correct 1 ms 464 KB Output is correct
93 Correct 21 ms 720 KB Output is correct
94 Correct 21 ms 720 KB Output is correct
95 Correct 22 ms 720 KB Output is correct
96 Correct 15 ms 720 KB Output is correct
97 Correct 24 ms 720 KB Output is correct
98 Correct 0 ms 208 KB Output is correct
99 Correct 105 ms 49448 KB Output is correct
100 Correct 111 ms 49588 KB Output is correct
101 Correct 120 ms 50248 KB Output is correct
102 Correct 126 ms 49612 KB Output is correct
103 Correct 114 ms 49908 KB Output is correct
104 Correct 114 ms 50356 KB Output is correct
105 Correct 0 ms 208 KB Output is correct
106 Correct 69 ms 28848 KB Output is correct
107 Correct 106 ms 49612 KB Output is correct
108 Correct 101 ms 50212 KB Output is correct
109 Correct 105 ms 49640 KB Output is correct
110 Correct 156 ms 49976 KB Output is correct
111 Correct 101 ms 50492 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 1 ms 208 KB Output is correct
3 Correct 240 ms 40184 KB Output is correct
4 Correct 1154 ms 50352 KB Output is correct
5 Correct 1034 ms 25432 KB Output is correct
6 Correct 948 ms 50440 KB Output is correct
7 Correct 685 ms 34440 KB Output is correct
8 Correct 1104 ms 50336 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Incorrect 3 ms 292 KB Output isn't correct
14 Halted 0 ms 0 KB -