oj.uz

Submission #558920

# Submission time Handle Problem Language Result Execution time Memory
558920 2022-05-09T01:46:23 Z hoanghq2004 Rainforest Jumps (APIO21_jumps) C++14
23 / 100
 1018 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;
    int hmax = 0;
    for (int i = C; i <= D; ++i) hmax = max(hmax, h[i]);
    for (int lg = 19; lg >= 0; --lg)
        if (nxt[B][lg] >= A && h[nxt[B][lg]] <= hmax) B = nxt[B][lg];

    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 222 ms 41380 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 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 160 ms 23496 KB Output is correct
5 Correct 947 ms 51180 KB Output is correct
6 Correct 433 ms 8656 KB Output is correct
7 Correct 895 ms 51116 KB Output is correct
8 Correct 514 ms 17744 KB Output is correct
9 Correct 906 ms 51104 KB Output is correct
10 Correct 928 ms 51912 KB Output is correct
11 Correct 906 ms 51804 KB Output is correct
12 Correct 945 ms 51784 KB Output is correct
13 Correct 732 ms 51176 KB Output is correct
14 Correct 945 ms 51440 KB Output is correct
15 Correct 767 ms 51912 KB Output is correct
16 Correct 881 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 1 ms 336 KB Output is correct
20 Correct 2 ms 336 KB Output is correct
21 Correct 3 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 0 ms 336 KB Output is correct
26 Correct 1 ms 464 KB Output is correct
27 Correct 17 ms 720 KB Output is correct
28 Correct 17 ms 848 KB Output is correct
29 Correct 21 ms 848 KB Output is correct
30 Correct 17 ms 848 KB Output is correct
31 Correct 21 ms 848 KB Output is correct
32 Correct 0 ms 336 KB Output is correct
33 Correct 54 ms 29768 KB Output is correct
34 Correct 103 ms 51172 KB Output is correct
35 Correct 89 ms 51776 KB Output is correct
36 Correct 96 ms 51112 KB Output is correct
37 Correct 107 ms 51444 KB Output is correct
38 Correct 87 ms 52004 KB Output is correct

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 160 ms 23496 KB Output is correct
5 Correct 947 ms 51180 KB Output is correct
6 Correct 433 ms 8656 KB Output is correct
7 Correct 895 ms 51116 KB Output is correct
8 Correct 514 ms 17744 KB Output is correct
9 Correct 906 ms 51104 KB Output is correct
10 Correct 928 ms 51912 KB Output is correct
11 Correct 906 ms 51804 KB Output is correct
12 Correct 945 ms 51784 KB Output is correct
13 Correct 732 ms 51176 KB Output is correct
14 Correct 945 ms 51440 KB Output is correct
15 Correct 767 ms 51912 KB Output is correct
16 Correct 881 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 1 ms 336 KB Output is correct
20 Correct 2 ms 336 KB Output is correct
21 Correct 3 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 0 ms 336 KB Output is correct
26 Correct 1 ms 464 KB Output is correct
27 Correct 17 ms 720 KB Output is correct
28 Correct 17 ms 848 KB Output is correct
29 Correct 21 ms 848 KB Output is correct
30 Correct 17 ms 848 KB Output is correct
31 Correct 21 ms 848 KB Output is correct
32 Correct 0 ms 336 KB Output is correct
33 Correct 54 ms 29768 KB Output is correct
34 Correct 103 ms 51172 KB Output is correct
35 Correct 89 ms 51776 KB Output is correct
36 Correct 96 ms 51112 KB Output is correct
37 Correct 107 ms 51444 KB Output is correct
38 Correct 87 ms 52004 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 216 ms 23496 KB Output is correct
43 Correct 750 ms 51144 KB Output is correct
44 Correct 552 ms 8624 KB Output is correct
45 Correct 936 ms 51144 KB Output is correct
46 Correct 417 ms 17756 KB Output is correct
47 Correct 733 ms 51144 KB Output is correct
48 Correct 828 ms 51916 KB Output is correct
49 Correct 1018 ms 51804 KB Output is correct
50 Correct 660 ms 51764 KB Output is correct
51 Correct 612 ms 51136 KB Output is correct
52 Correct 954 ms 51604 KB Output is correct
53 Correct 817 ms 52020 KB Output is correct
54 Correct 926 ms 51992 KB Output is correct
55 Correct 0 ms 336 KB Output is correct
56 Incorrect 144 ms 50984 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 222 ms 41380 KB Output isn't correct
4 Halted 0 ms 0 KB -