oj.uz

Submission #558757

# Submission time Handle Problem Language Result Execution time Memory
558757 2022-05-08T09:16:11 Z hoanghq2004 Rainforest Jumps (APIO21_jumps) C++14
27 / 100
 1059 ms 52036 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] = R[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[A][lg] && nxt[A][lg] <= B && h[nxt[A][lg]] <= h[C]) A = nxt[A][lg];
    int cost = 0;
    for (int lg = 19; lg >= 0; --lg)
        if (h[high[A][lg]] && h[high[A][lg]] <= h[C])
            A = high[A][lg],
            cost += (1 << lg);
    for (int lg = 19; lg >= 0; --lg)
        if (h[low[A][lg]] && h[low[A][lg]] <= h[C])
            A = low[A][lg],
            cost += (1 << lg);
    if (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
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 189 ms 41376 KB Output is correct
4 Correct 1036 ms 51932 KB Output is correct
5 Correct 1055 ms 26296 KB Output is correct
6 Correct 1029 ms 52004 KB Output is correct
7 Correct 751 ms 35652 KB Output is correct
8 Correct 1059 ms 51876 KB Output is correct

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 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 1 ms 336 KB Output is correct
4 Correct 260 ms 23516 KB Output is correct
5 Correct 758 ms 51108 KB Output is correct
6 Correct 387 ms 8616 KB Output is correct
7 Correct 969 ms 51108 KB Output is correct
8 Correct 530 ms 17860 KB Output is correct
9 Correct 977 ms 51176 KB Output is correct
10 Correct 958 ms 51876 KB Output is correct
11 Correct 866 ms 51828 KB Output is correct
12 Correct 1002 ms 51816 KB Output is correct
13 Correct 890 ms 51116 KB Output is correct
14 Correct 813 ms 51464 KB Output is correct
15 Correct 620 ms 51900 KB Output is correct
16 Correct 891 ms 51876 KB Output is correct
17 Correct 0 ms 336 KB Output is correct
18 Correct 1 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 3 ms 336 KB Output is correct
23 Correct 2 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 18 ms 848 KB Output is correct
28 Correct 18 ms 848 KB Output is correct
29 Correct 17 ms 848 KB Output is correct
30 Correct 20 ms 848 KB Output is correct
31 Correct 16 ms 848 KB Output is correct
32 Correct 0 ms 336 KB Output is correct
33 Correct 56 ms 29728 KB Output is correct
34 Correct 100 ms 51124 KB Output is correct
35 Correct 89 ms 51880 KB Output is correct
36 Correct 109 ms 51180 KB Output is correct
37 Correct 110 ms 51428 KB Output is correct
38 Correct 89 ms 51908 KB Output is correct

Subtask #6
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 1 ms 336 KB Output is correct
4 Correct 260 ms 23516 KB Output is correct
5 Correct 758 ms 51108 KB Output is correct
6 Correct 387 ms 8616 KB Output is correct
7 Correct 969 ms 51108 KB Output is correct
8 Correct 530 ms 17860 KB Output is correct
9 Correct 977 ms 51176 KB Output is correct
10 Correct 958 ms 51876 KB Output is correct
11 Correct 866 ms 51828 KB Output is correct
12 Correct 1002 ms 51816 KB Output is correct
13 Correct 890 ms 51116 KB Output is correct
14 Correct 813 ms 51464 KB Output is correct
15 Correct 620 ms 51900 KB Output is correct
16 Correct 891 ms 51876 KB Output is correct
17 Correct 0 ms 336 KB Output is correct
18 Correct 1 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 3 ms 336 KB Output is correct
23 Correct 2 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 18 ms 848 KB Output is correct
28 Correct 18 ms 848 KB Output is correct
29 Correct 17 ms 848 KB Output is correct
30 Correct 20 ms 848 KB Output is correct
31 Correct 16 ms 848 KB Output is correct
32 Correct 0 ms 336 KB Output is correct
33 Correct 56 ms 29728 KB Output is correct
34 Correct 100 ms 51124 KB Output is correct
35 Correct 89 ms 51880 KB Output is correct
36 Correct 109 ms 51180 KB Output is correct
37 Correct 110 ms 51428 KB Output is correct
38 Correct 89 ms 51908 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 264 ms 23564 KB Output is correct
43 Correct 814 ms 51116 KB Output is correct
44 Correct 464 ms 8656 KB Output is correct
45 Correct 835 ms 51216 KB Output is correct
46 Correct 550 ms 17856 KB Output is correct
47 Correct 920 ms 51176 KB Output is correct
48 Correct 900 ms 52036 KB Output is correct
49 Correct 963 ms 51920 KB Output is correct
50 Correct 788 ms 51876 KB Output is correct
51 Correct 844 ms 51144 KB Output is correct
52 Correct 1000 ms 51480 KB Output is correct
53 Correct 864 ms 51912 KB Output is correct
54 Correct 872 ms 52004 KB Output is correct
55 Correct 0 ms 336 KB Output is correct
56 Incorrect 154 ms 50988 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 Correct 189 ms 41376 KB Output is correct
4 Correct 1036 ms 51932 KB Output is correct
5 Correct 1055 ms 26296 KB Output is correct
6 Correct 1029 ms 52004 KB Output is correct
7 Correct 751 ms 35652 KB Output is correct
8 Correct 1059 ms 51876 KB Output is correct
9 Incorrect 0 ms 336 KB Output isn't correct
10 Halted 0 ms 0 KB -