oj.uz

Submission #558959

# Submission time Handle Problem Language Result Execution time Memory
558959 2022-05-09T03:14:30 Z hoanghq2004 Rainforest Jumps (APIO21_jumps) C++14
48 / 100
 1093 ms 50468 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[B][0] < C && 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 < C || B > D) return -1;
    return cost;
}
//
//int main() {
////    freopen("test.inp", "r", stdin);
////    freopen("test.out", "w", stdout);
//  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 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 189 ms 40172 KB Output is correct
4 Correct 998 ms 50344 KB Output is correct
5 Correct 617 ms 25504 KB Output is correct
6 Correct 961 ms 50396 KB Output is correct
7 Correct 762 ms 34532 KB Output is correct
8 Correct 920 ms 50432 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 0 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 3 ms 336 KB Output is correct
6 Correct 3 ms 336 KB Output is correct
7 Correct 2 ms 336 KB Output is correct
8 Correct 3 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 3 ms 336 KB Output is correct
11 Correct 2 ms 336 KB Output is correct
12 Correct 2 ms 336 KB Output is correct
13 Correct 2 ms 336 KB Output is correct
14 Correct 2 ms 336 KB Output is correct
15 Correct 3 ms 336 KB Output is correct
16 Correct 3 ms 336 KB Output is correct
17 Incorrect 2 ms 336 KB Output isn't correct
18 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 0 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 3 ms 336 KB Output is correct
6 Correct 3 ms 336 KB Output is correct
7 Correct 2 ms 336 KB Output is correct
8 Correct 3 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 3 ms 336 KB Output is correct
11 Correct 2 ms 336 KB Output is correct
12 Correct 2 ms 336 KB Output is correct
13 Correct 2 ms 336 KB Output is correct
14 Correct 2 ms 336 KB Output is correct
15 Correct 3 ms 336 KB Output is correct
16 Correct 3 ms 336 KB Output is correct
17 Incorrect 2 ms 336 KB Output isn't correct
18 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 284 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 81 ms 39992 KB Output is correct
6 Correct 99 ms 49616 KB Output is correct
7 Correct 49 ms 25524 KB Output is correct
8 Correct 100 ms 49612 KB Output is correct
9 Correct 13 ms 7696 KB Output is correct
10 Correct 105 ms 49616 KB Output is correct
11 Correct 97 ms 50368 KB Output is correct
12 Correct 99 ms 50208 KB Output is correct
13 Correct 93 ms 50200 KB Output is correct
14 Correct 95 ms 49612 KB Output is correct
15 Correct 114 ms 49980 KB Output is correct
16 Correct 96 ms 50132 KB Output is correct
17 Incorrect 91 ms 50152 KB Output isn't correct
18 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 284 KB Output is correct
4 Correct 219 ms 22816 KB Output is correct
5 Correct 941 ms 49608 KB Output is correct
6 Correct 611 ms 8400 KB Output is correct
7 Correct 811 ms 49480 KB Output is correct
8 Correct 546 ms 17224 KB Output is correct
9 Correct 699 ms 49568 KB Output is correct
10 Correct 1006 ms 50340 KB Output is correct
11 Correct 865 ms 50228 KB Output is correct
12 Correct 734 ms 50228 KB Output is correct
13 Correct 780 ms 49576 KB Output is correct
14 Correct 1062 ms 49976 KB Output is correct
15 Correct 919 ms 50376 KB Output is correct
16 Correct 840 ms 50364 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 1 ms 336 KB Output is correct
21 Correct 2 ms 336 KB Output is correct
22 Correct 3 ms 336 KB Output is correct
23 Correct 2 ms 336 KB Output is correct
24 Correct 4 ms 336 KB Output is correct
25 Correct 0 ms 336 KB Output is correct
26 Correct 2 ms 464 KB Output is correct
27 Correct 20 ms 720 KB Output is correct
28 Correct 20 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 16 ms 720 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 54 ms 28780 KB Output is correct
34 Correct 101 ms 49712 KB Output is correct
35 Correct 92 ms 50204 KB Output is correct
36 Correct 95 ms 49568 KB Output is correct
37 Correct 106 ms 49928 KB Output is correct
38 Correct 101 ms 50432 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 284 KB Output is correct
4 Correct 219 ms 22816 KB Output is correct
5 Correct 941 ms 49608 KB Output is correct
6 Correct 611 ms 8400 KB Output is correct
7 Correct 811 ms 49480 KB Output is correct
8 Correct 546 ms 17224 KB Output is correct
9 Correct 699 ms 49568 KB Output is correct
10 Correct 1006 ms 50340 KB Output is correct
11 Correct 865 ms 50228 KB Output is correct
12 Correct 734 ms 50228 KB Output is correct
13 Correct 780 ms 49576 KB Output is correct
14 Correct 1062 ms 49976 KB Output is correct
15 Correct 919 ms 50376 KB Output is correct
16 Correct 840 ms 50364 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 1 ms 336 KB Output is correct
21 Correct 2 ms 336 KB Output is correct
22 Correct 3 ms 336 KB Output is correct
23 Correct 2 ms 336 KB Output is correct
24 Correct 4 ms 336 KB Output is correct
25 Correct 0 ms 336 KB Output is correct
26 Correct 2 ms 464 KB Output is correct
27 Correct 20 ms 720 KB Output is correct
28 Correct 20 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 16 ms 720 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 54 ms 28780 KB Output is correct
34 Correct 101 ms 49712 KB Output is correct
35 Correct 92 ms 50204 KB Output is correct
36 Correct 95 ms 49568 KB Output is correct
37 Correct 106 ms 49928 KB Output is correct
38 Correct 101 ms 50432 KB Output is correct
39 Correct 0 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 233 ms 22852 KB Output is correct
43 Correct 939 ms 49596 KB Output is correct
44 Correct 585 ms 8400 KB Output is correct
45 Correct 995 ms 49488 KB Output is correct
46 Correct 579 ms 17244 KB Output is correct
47 Correct 920 ms 49608 KB Output is correct
48 Correct 786 ms 50436 KB Output is correct
49 Correct 1020 ms 50260 KB Output is correct
50 Correct 733 ms 50376 KB Output is correct
51 Correct 888 ms 49556 KB Output is correct
52 Correct 990 ms 49900 KB Output is correct
53 Correct 876 ms 50340 KB Output is correct
54 Correct 762 ms 50464 KB Output is correct
55 Correct 0 ms 208 KB Output is correct
56 Correct 145 ms 49424 KB Output is correct
57 Correct 877 ms 49688 KB Output is correct
58 Correct 409 ms 8912 KB Output is correct
59 Correct 841 ms 49688 KB Output is correct
60 Correct 387 ms 17840 KB Output is correct
61 Correct 839 ms 49480 KB Output is correct
62 Correct 897 ms 50372 KB Output is correct
63 Correct 929 ms 50204 KB Output is correct
64 Correct 909 ms 50140 KB Output is correct
65 Correct 712 ms 49480 KB Output is correct
66 Correct 976 ms 49940 KB Output is correct
67 Correct 1006 ms 50468 KB Output is correct
68 Correct 1093 ms 50340 KB Output is correct
69 Correct 0 ms 208 KB Output is correct
70 Correct 1 ms 336 KB Output is correct
71 Correct 2 ms 336 KB Output is correct
72 Correct 1 ms 336 KB Output is correct
73 Correct 3 ms 336 KB Output is correct
74 Correct 1 ms 336 KB Output is correct
75 Correct 3 ms 336 KB Output is correct
76 Correct 0 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 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 3 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 21 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 18 ms 720 KB Output is correct
90 Correct 16 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 17 ms 720 KB Output is correct
94 Correct 18 ms 720 KB Output is correct
95 Correct 15 ms 720 KB Output is correct
96 Correct 16 ms 720 KB Output is correct
97 Correct 18 ms 720 KB Output is correct
98 Correct 0 ms 208 KB Output is correct
99 Correct 100 ms 49476 KB Output is correct
100 Correct 103 ms 49716 KB Output is correct
101 Correct 93 ms 50228 KB Output is correct
102 Correct 105 ms 49616 KB Output is correct
103 Correct 105 ms 49972 KB Output is correct
104 Correct 93 ms 50376 KB Output is correct
105 Correct 0 ms 208 KB Output is correct
106 Correct 54 ms 28796 KB Output is correct
107 Correct 104 ms 49584 KB Output is correct
108 Correct 92 ms 50376 KB Output is correct
109 Correct 106 ms 49612 KB Output is correct
110 Correct 121 ms 49920 KB Output is correct
111 Correct 98 ms 50372 KB Output is correct

Subtask #7
0 / 19.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 189 ms 40172 KB Output is correct
4 Correct 998 ms 50344 KB Output is correct
5 Correct 617 ms 25504 KB Output is correct
6 Correct 961 ms 50396 KB Output is correct
7 Correct 762 ms 34532 KB Output is correct
8 Correct 920 ms 50432 KB Output is correct
9 Correct 1 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 1 ms 208 KB Output is correct
13 Correct 3 ms 336 KB Output is correct
14 Correct 3 ms 336 KB Output is correct
15 Correct 2 ms 336 KB Output is correct
16 Correct 3 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 3 ms 336 KB Output is correct
19 Correct 2 ms 336 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 Incorrect 2 ms 336 KB Output isn't correct
26 Halted 0 ms 0 KB -