oj.uz

Submission #558915

# Submission time Handle Problem Language Result Execution time Memory
558915 2022-05-09T00:47:36 Z hoanghq2004 Rainforest Jumps (APIO21_jumps) C++14
23 / 100
 1055 ms 52152 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 hmax = 0;
    for (int i = C; i <= D; ++i) hmax = max(hmax, h[i]);
    int cost = 0;
    for (int lg = 19; lg >= 0; --lg)
        if (h[high[A][lg]] && h[high[A][lg]] <= hmax)
            A = high[A][lg],
            cost += (1 << lg);
    for (int lg = 19; lg >= 0; --lg)
        if (h[low[A][lg]] && h[low[A][lg]] <= hmax)
            A = low[A][lg],
            cost += (1 << lg);
    if (A > D || A < 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 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Incorrect 227 ms 41444 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 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 0 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 0 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 0 ms 352 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 277 ms 23496 KB Output is correct
5 Correct 912 ms 51224 KB Output is correct
6 Correct 553 ms 8632 KB Output is correct
7 Correct 771 ms 51172 KB Output is correct
8 Correct 449 ms 17796 KB Output is correct
9 Correct 956 ms 51156 KB Output is correct
10 Correct 903 ms 51952 KB Output is correct
11 Correct 919 ms 51916 KB Output is correct
12 Correct 1025 ms 51808 KB Output is correct
13 Correct 962 ms 51136 KB Output is correct
14 Correct 1004 ms 51456 KB Output is correct
15 Correct 794 ms 51900 KB Output is correct
16 Correct 793 ms 51912 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 2 ms 336 KB Output is correct
21 Correct 4 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 2 ms 336 KB Output is correct
25 Correct 1 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 16 ms 848 KB Output is correct
29 Correct 17 ms 848 KB Output is correct
30 Correct 18 ms 848 KB Output is correct
31 Correct 13 ms 848 KB Output is correct
32 Correct 0 ms 336 KB Output is correct
33 Correct 54 ms 29680 KB Output is correct
34 Correct 112 ms 51172 KB Output is correct
35 Correct 86 ms 52000 KB Output is correct
36 Correct 103 ms 51180 KB Output is correct
37 Correct 132 ms 51432 KB Output is correct
38 Correct 95 ms 52000 KB Output is correct

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 352 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 277 ms 23496 KB Output is correct
5 Correct 912 ms 51224 KB Output is correct
6 Correct 553 ms 8632 KB Output is correct
7 Correct 771 ms 51172 KB Output is correct
8 Correct 449 ms 17796 KB Output is correct
9 Correct 956 ms 51156 KB Output is correct
10 Correct 903 ms 51952 KB Output is correct
11 Correct 919 ms 51916 KB Output is correct
12 Correct 1025 ms 51808 KB Output is correct
13 Correct 962 ms 51136 KB Output is correct
14 Correct 1004 ms 51456 KB Output is correct
15 Correct 794 ms 51900 KB Output is correct
16 Correct 793 ms 51912 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 2 ms 336 KB Output is correct
21 Correct 4 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 2 ms 336 KB Output is correct
25 Correct 1 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 16 ms 848 KB Output is correct
29 Correct 17 ms 848 KB Output is correct
30 Correct 18 ms 848 KB Output is correct
31 Correct 13 ms 848 KB Output is correct
32 Correct 0 ms 336 KB Output is correct
33 Correct 54 ms 29680 KB Output is correct
34 Correct 112 ms 51172 KB Output is correct
35 Correct 86 ms 52000 KB Output is correct
36 Correct 103 ms 51180 KB Output is correct
37 Correct 132 ms 51432 KB Output is correct
38 Correct 95 ms 52000 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 215 ms 23496 KB Output is correct
43 Correct 821 ms 51140 KB Output is correct
44 Correct 506 ms 8736 KB Output is correct
45 Correct 644 ms 51144 KB Output is correct
46 Correct 466 ms 17848 KB Output is correct
47 Correct 726 ms 51156 KB Output is correct
48 Correct 869 ms 51916 KB Output is correct
49 Correct 1055 ms 51804 KB Output is correct
50 Correct 1044 ms 51768 KB Output is correct
51 Correct 929 ms 51176 KB Output is correct
52 Correct 845 ms 51608 KB Output is correct
53 Correct 926 ms 52152 KB Output is correct
54 Correct 778 ms 51884 KB Output is correct
55 Correct 0 ms 336 KB Output is correct
56 Incorrect 153 ms 50996 KB Output isn't correct
57 Halted 0 ms 0 KB -

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 Incorrect 227 ms 41444 KB Output isn't correct
4 Halted 0 ms 0 KB -