oj.uz

답안 #558944

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
558944 2022-05-09T02:48:34 Z hoanghq2004 밀림 점프 (APIO21_jumps) C++14
44 / 100
 1575 ms 50508 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[high[B][0]][0] <= D) {
        B = high[B][0];
        ++cost;
    }
    for (int lg = 19; lg >= 0; --lg)
        if (B < C && R[B][lg] && R[B][lg] <= D) {
            B = R[B][lg];
            cost += (1 << lg);
        }
    if (B > D || 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
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Incorrect 166 ms 40224 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 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 0 ms 208 KB Output is correct
5 Incorrect 1 ms 208 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 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 0 ms 208 KB Output is correct
5 Incorrect 1 ms 208 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 ms 208 KB Output is correct
5 Correct 78 ms 39972 KB Output is correct
6 Correct 108 ms 49608 KB Output is correct
7 Correct 49 ms 25440 KB Output is correct
8 Correct 99 ms 49560 KB Output is correct
9 Correct 10 ms 7748 KB Output is correct
10 Correct 96 ms 49716 KB Output is correct
11 Incorrect 94 ms 50468 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 168 ms 22824 KB Output is correct
5 Correct 807 ms 49736 KB Output is correct
6 Correct 548 ms 8400 KB Output is correct
7 Correct 761 ms 49604 KB Output is correct
8 Correct 512 ms 17196 KB Output is correct
9 Correct 939 ms 49608 KB Output is correct
10 Correct 999 ms 50376 KB Output is correct
11 Correct 1063 ms 50224 KB Output is correct
12 Correct 891 ms 50212 KB Output is correct
13 Correct 867 ms 49560 KB Output is correct
14 Correct 1200 ms 49924 KB Output is correct
15 Correct 1055 ms 50436 KB Output is correct
16 Correct 837 ms 50392 KB Output is correct
17 Correct 1 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 3 ms 336 KB Output is correct
21 Correct 3 ms 336 KB Output is correct
22 Correct 2 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 1 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 12 ms 720 KB Output is correct
29 Correct 13 ms 720 KB Output is correct
30 Correct 15 ms 720 KB Output is correct
31 Correct 27 ms 720 KB Output is correct
32 Correct 1 ms 208 KB Output is correct
33 Correct 75 ms 28864 KB Output is correct
34 Correct 126 ms 49616 KB Output is correct
35 Correct 128 ms 50360 KB Output is correct
36 Correct 110 ms 49564 KB Output is correct
37 Correct 112 ms 49904 KB Output is correct
38 Correct 100 ms 50356 KB Output is correct

Subtask #6
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 168 ms 22824 KB Output is correct
5 Correct 807 ms 49736 KB Output is correct
6 Correct 548 ms 8400 KB Output is correct
7 Correct 761 ms 49604 KB Output is correct
8 Correct 512 ms 17196 KB Output is correct
9 Correct 939 ms 49608 KB Output is correct
10 Correct 999 ms 50376 KB Output is correct
11 Correct 1063 ms 50224 KB Output is correct
12 Correct 891 ms 50212 KB Output is correct
13 Correct 867 ms 49560 KB Output is correct
14 Correct 1200 ms 49924 KB Output is correct
15 Correct 1055 ms 50436 KB Output is correct
16 Correct 837 ms 50392 KB Output is correct
17 Correct 1 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 3 ms 336 KB Output is correct
21 Correct 3 ms 336 KB Output is correct
22 Correct 2 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 1 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 12 ms 720 KB Output is correct
29 Correct 13 ms 720 KB Output is correct
30 Correct 15 ms 720 KB Output is correct
31 Correct 27 ms 720 KB Output is correct
32 Correct 1 ms 208 KB Output is correct
33 Correct 75 ms 28864 KB Output is correct
34 Correct 126 ms 49616 KB Output is correct
35 Correct 128 ms 50360 KB Output is correct
36 Correct 110 ms 49564 KB Output is correct
37 Correct 112 ms 49904 KB Output is correct
38 Correct 100 ms 50356 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 315 ms 22816 KB Output is correct
43 Correct 1062 ms 49572 KB Output is correct
44 Correct 710 ms 8400 KB Output is correct
45 Correct 964 ms 49568 KB Output is correct
46 Correct 549 ms 17268 KB Output is correct
47 Correct 1077 ms 49688 KB Output is correct
48 Correct 1037 ms 50436 KB Output is correct
49 Correct 1028 ms 50264 KB Output is correct
50 Correct 915 ms 50224 KB Output is correct
51 Correct 854 ms 49588 KB Output is correct
52 Correct 1025 ms 49928 KB Output is correct
53 Correct 1122 ms 50400 KB Output is correct
54 Correct 1097 ms 50436 KB Output is correct
55 Correct 1 ms 208 KB Output is correct
56 Correct 174 ms 49328 KB Output is correct
57 Correct 1141 ms 49588 KB Output is correct
58 Correct 469 ms 8876 KB Output is correct
59 Correct 1223 ms 49676 KB Output is correct
60 Correct 444 ms 17736 KB Output is correct
61 Correct 1028 ms 49676 KB Output is correct
62 Correct 1190 ms 50468 KB Output is correct
63 Correct 1258 ms 50204 KB Output is correct
64 Correct 1179 ms 50072 KB Output is correct
65 Correct 1227 ms 49636 KB Output is correct
66 Correct 1575 ms 50020 KB Output is correct
67 Correct 1490 ms 50508 KB Output is correct
68 Correct 1187 ms 50484 KB Output is correct
69 Correct 1 ms 256 KB Output is correct
70 Correct 1 ms 336 KB Output is correct
71 Correct 2 ms 336 KB Output is correct
72 Correct 4 ms 336 KB Output is correct
73 Correct 2 ms 336 KB Output is correct
74 Correct 1 ms 336 KB Output is correct
75 Correct 4 ms 336 KB Output is correct
76 Correct 1 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 4 ms 336 KB Output is correct
80 Correct 3 ms 336 KB Output is correct
81 Correct 2 ms 372 KB Output is correct
82 Correct 2 ms 336 KB Output is correct
83 Correct 3 ms 336 KB Output is correct
84 Correct 1 ms 336 KB Output is correct
85 Correct 3 ms 336 KB Output is correct
86 Correct 19 ms 720 KB Output is correct
87 Correct 20 ms 768 KB Output is correct
88 Correct 23 ms 768 KB Output is correct
89 Correct 20 ms 720 KB Output is correct
90 Correct 25 ms 768 KB Output is correct
91 Correct 1 ms 336 KB Output is correct
92 Correct 1 ms 464 KB Output is correct
93 Correct 18 ms 720 KB Output is correct
94 Correct 18 ms 720 KB Output is correct
95 Correct 16 ms 768 KB Output is correct
96 Correct 27 ms 720 KB Output is correct
97 Correct 10 ms 720 KB Output is correct
98 Correct 1 ms 208 KB Output is correct
99 Correct 125 ms 49536 KB Output is correct
100 Correct 125 ms 49612 KB Output is correct
101 Correct 113 ms 50196 KB Output is correct
102 Correct 120 ms 49512 KB Output is correct
103 Correct 133 ms 49932 KB Output is correct
104 Correct 125 ms 50436 KB Output is correct
105 Correct 0 ms 208 KB Output is correct
106 Correct 78 ms 28860 KB Output is correct
107 Correct 132 ms 49612 KB Output is correct
108 Correct 154 ms 50312 KB Output is correct
109 Correct 132 ms 49584 KB Output is correct
110 Correct 160 ms 49968 KB Output is correct
111 Correct 130 ms 50436 KB Output is correct

Subtask #7
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Incorrect 166 ms 40224 KB Output isn't correct
4 Halted 0 ms 0 KB -