oj.uz

Submission #558754

# Submission time Handle Problem Language Result Execution time Memory
558754 2022-05-08T09:11:58 Z hoanghq2004 Rainforest Jumps (APIO21_jumps) C++14
48 / 100
 1050 ms 52020 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], low[N][20];
int L[N], R[N];
int nxt[N][20];

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

int minimum_jumps(int A, int B, int C, int D) {
    ++A, ++B, ++C, ++D;
    for (int lg = 19; lg >= 0; --lg)
        if (nxt[B][lg] >= A && h[nxt[B][lg]] <= h[C]) B = nxt[B][lg];

    int cost = 0;
    for (int lg = 19; lg >= 0; --lg)
        if (h[high[B][lg]] && h[high[B][lg]] <= h[C])
            B = high[B][lg],
            cost += (1 << lg);
    for (int lg = 19; lg >= 0; --lg)
        if (h[low[B][lg]] && h[low[B][lg]] <= h[C])
            B = low[B][lg],
            cost += (1 << lg);
    if (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
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 178 ms 41480 KB Output is correct
4 Correct 733 ms 52004 KB Output is correct
5 Correct 918 ms 26276 KB Output is correct
6 Correct 912 ms 51884 KB Output is correct
7 Correct 639 ms 35528 KB Output is correct
8 Correct 1008 ms 52020 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 336 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 336 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 336 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 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 202 ms 23504 KB Output is correct
5 Correct 841 ms 51204 KB Output is correct
6 Correct 628 ms 8656 KB Output is correct
7 Correct 906 ms 51112 KB Output is correct
8 Correct 422 ms 17744 KB Output is correct
9 Correct 983 ms 51112 KB Output is correct
10 Correct 962 ms 52000 KB Output is correct
11 Correct 815 ms 51928 KB Output is correct
12 Correct 949 ms 51784 KB Output is correct
13 Correct 963 ms 51176 KB Output is correct
14 Correct 924 ms 51476 KB Output is correct
15 Correct 885 ms 52000 KB Output is correct
16 Correct 864 ms 52004 KB Output is correct
17 Correct 0 ms 336 KB Output is correct
18 Correct 0 ms 336 KB Output is correct
19 Correct 2 ms 336 KB Output is correct
20 Correct 3 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 22 ms 848 KB Output is correct
28 Correct 20 ms 848 KB Output is correct
29 Correct 20 ms 848 KB Output is correct
30 Correct 21 ms 848 KB Output is correct
31 Correct 17 ms 848 KB Output is correct
32 Correct 0 ms 336 KB Output is correct
33 Correct 53 ms 29664 KB Output is correct
34 Correct 96 ms 51108 KB Output is correct
35 Correct 104 ms 51876 KB Output is correct
36 Correct 95 ms 51136 KB Output is correct
37 Correct 114 ms 51444 KB Output is correct
38 Correct 89 ms 51876 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 202 ms 23504 KB Output is correct
5 Correct 841 ms 51204 KB Output is correct
6 Correct 628 ms 8656 KB Output is correct
7 Correct 906 ms 51112 KB Output is correct
8 Correct 422 ms 17744 KB Output is correct
9 Correct 983 ms 51112 KB Output is correct
10 Correct 962 ms 52000 KB Output is correct
11 Correct 815 ms 51928 KB Output is correct
12 Correct 949 ms 51784 KB Output is correct
13 Correct 963 ms 51176 KB Output is correct
14 Correct 924 ms 51476 KB Output is correct
15 Correct 885 ms 52000 KB Output is correct
16 Correct 864 ms 52004 KB Output is correct
17 Correct 0 ms 336 KB Output is correct
18 Correct 0 ms 336 KB Output is correct
19 Correct 2 ms 336 KB Output is correct
20 Correct 3 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 22 ms 848 KB Output is correct
28 Correct 20 ms 848 KB Output is correct
29 Correct 20 ms 848 KB Output is correct
30 Correct 21 ms 848 KB Output is correct
31 Correct 17 ms 848 KB Output is correct
32 Correct 0 ms 336 KB Output is correct
33 Correct 53 ms 29664 KB Output is correct
34 Correct 96 ms 51108 KB Output is correct
35 Correct 104 ms 51876 KB Output is correct
36 Correct 95 ms 51136 KB Output is correct
37 Correct 114 ms 51444 KB Output is correct
38 Correct 89 ms 51876 KB Output is correct
39 Correct 0 ms 336 KB Output is correct
40 Correct 0 ms 336 KB Output is correct
41 Correct 0 ms 336 KB Output is correct
42 Correct 255 ms 23504 KB Output is correct
43 Correct 772 ms 51132 KB Output is correct
44 Correct 485 ms 8656 KB Output is correct
45 Correct 945 ms 51108 KB Output is correct
46 Correct 539 ms 17736 KB Output is correct
47 Correct 890 ms 51112 KB Output is correct
48 Correct 738 ms 52000 KB Output is correct
49 Correct 886 ms 51772 KB Output is correct
50 Correct 915 ms 51880 KB Output is correct
51 Correct 905 ms 51144 KB Output is correct
52 Correct 949 ms 51568 KB Output is correct
53 Correct 969 ms 52000 KB Output is correct
54 Correct 672 ms 52004 KB Output is correct
55 Correct 0 ms 336 KB Output is correct
56 Correct 148 ms 50984 KB Output is correct
57 Correct 660 ms 51128 KB Output is correct
58 Correct 441 ms 9168 KB Output is correct
59 Correct 962 ms 51176 KB Output is correct
60 Correct 438 ms 18384 KB Output is correct
61 Correct 967 ms 51144 KB Output is correct
62 Correct 845 ms 52008 KB Output is correct
63 Correct 1050 ms 51772 KB Output is correct
64 Correct 905 ms 51656 KB Output is correct
65 Correct 941 ms 51172 KB Output is correct
66 Correct 900 ms 51444 KB Output is correct
67 Correct 1040 ms 51940 KB Output is correct
68 Correct 943 ms 51916 KB Output is correct
69 Correct 1 ms 336 KB Output is correct
70 Correct 1 ms 336 KB Output is correct
71 Correct 2 ms 336 KB Output is correct
72 Correct 3 ms 336 KB Output is correct
73 Correct 3 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 1 ms 336 KB Output is correct
77 Correct 1 ms 336 KB Output is correct
78 Correct 2 ms 336 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 4 ms 336 KB Output is correct
86 Correct 19 ms 848 KB Output is correct
87 Correct 23 ms 848 KB Output is correct
88 Correct 21 ms 720 KB Output is correct
89 Correct 17 ms 848 KB Output is correct
90 Correct 17 ms 848 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 848 KB Output is correct
94 Correct 19 ms 848 KB Output is correct
95 Correct 16 ms 720 KB Output is correct
96 Correct 28 ms 848 KB Output is correct
97 Correct 23 ms 848 KB Output is correct
98 Correct 1 ms 336 KB Output is correct
99 Correct 95 ms 50988 KB Output is correct
100 Correct 95 ms 51184 KB Output is correct
101 Correct 94 ms 51740 KB Output is correct
102 Correct 97 ms 51180 KB Output is correct
103 Correct 119 ms 51480 KB Output is correct
104 Correct 91 ms 51912 KB Output is correct
105 Correct 0 ms 336 KB Output is correct
106 Correct 59 ms 29724 KB Output is correct
107 Correct 110 ms 51132 KB Output is correct
108 Correct 93 ms 51876 KB Output is correct
109 Correct 106 ms 51132 KB Output is correct
110 Correct 131 ms 51456 KB Output is correct
111 Correct 89 ms 51996 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 178 ms 41480 KB Output is correct
4 Correct 733 ms 52004 KB Output is correct
5 Correct 918 ms 26276 KB Output is correct
6 Correct 912 ms 51884 KB Output is correct
7 Correct 639 ms 35528 KB Output is correct
8 Correct 1008 ms 52020 KB Output is correct
9 Incorrect 1 ms 336 KB Output isn't correct
10 Halted 0 ms 0 KB -