oj.uz

답안 #558946

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
558946 2022-05-09T02:49:28 Z hoanghq2004 밀림 점프 (APIO21_jumps) C++14
44 / 100
 1350 ms 50516 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;
    }
    assert(R[B][0]);
    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 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Incorrect 193 ms 40212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

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

Subtask #3
0 / 13.0

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

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 106 ms 39968 KB Output is correct
6 Correct 132 ms 49612 KB Output is correct
7 Correct 60 ms 25564 KB Output is correct
8 Correct 103 ms 49572 KB Output is correct
9 Correct 11 ms 7632 KB Output is correct
10 Correct 130 ms 49572 KB Output is correct
11 Incorrect 103 ms 50436 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 265 ms 22852 KB Output is correct
5 Correct 992 ms 49596 KB Output is correct
6 Correct 686 ms 8400 KB Output is correct
7 Correct 992 ms 49580 KB Output is correct
8 Correct 620 ms 17248 KB Output is correct
9 Correct 1058 ms 49588 KB Output is correct
10 Correct 840 ms 50432 KB Output is correct
11 Correct 1118 ms 50268 KB Output is correct
12 Correct 1295 ms 50392 KB Output is correct
13 Correct 1214 ms 49584 KB Output is correct
14 Correct 1350 ms 49968 KB Output is correct
15 Correct 1247 ms 50396 KB Output is correct
16 Correct 1067 ms 50404 KB Output is correct
17 Correct 1 ms 208 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 1 ms 208 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 4 ms 332 KB Output is correct
24 Correct 4 ms 336 KB Output is correct
25 Correct 4 ms 336 KB Output is correct
26 Correct 1 ms 464 KB Output is correct
27 Correct 25 ms 784 KB Output is correct
28 Correct 20 ms 720 KB Output is correct
29 Correct 14 ms 768 KB Output is correct
30 Correct 22 ms 720 KB Output is correct
31 Correct 19 ms 720 KB Output is correct
32 Correct 1 ms 244 KB Output is correct
33 Correct 70 ms 28776 KB Output is correct
34 Correct 130 ms 49532 KB Output is correct
35 Correct 134 ms 50308 KB Output is correct
36 Correct 133 ms 49584 KB Output is correct
37 Correct 177 ms 49972 KB Output is correct
38 Correct 99 ms 50432 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 265 ms 22852 KB Output is correct
5 Correct 992 ms 49596 KB Output is correct
6 Correct 686 ms 8400 KB Output is correct
7 Correct 992 ms 49580 KB Output is correct
8 Correct 620 ms 17248 KB Output is correct
9 Correct 1058 ms 49588 KB Output is correct
10 Correct 840 ms 50432 KB Output is correct
11 Correct 1118 ms 50268 KB Output is correct
12 Correct 1295 ms 50392 KB Output is correct
13 Correct 1214 ms 49584 KB Output is correct
14 Correct 1350 ms 49968 KB Output is correct
15 Correct 1247 ms 50396 KB Output is correct
16 Correct 1067 ms 50404 KB Output is correct
17 Correct 1 ms 208 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 1 ms 208 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 4 ms 332 KB Output is correct
24 Correct 4 ms 336 KB Output is correct
25 Correct 4 ms 336 KB Output is correct
26 Correct 1 ms 464 KB Output is correct
27 Correct 25 ms 784 KB Output is correct
28 Correct 20 ms 720 KB Output is correct
29 Correct 14 ms 768 KB Output is correct
30 Correct 22 ms 720 KB Output is correct
31 Correct 19 ms 720 KB Output is correct
32 Correct 1 ms 244 KB Output is correct
33 Correct 70 ms 28776 KB Output is correct
34 Correct 130 ms 49532 KB Output is correct
35 Correct 134 ms 50308 KB Output is correct
36 Correct 133 ms 49584 KB Output is correct
37 Correct 177 ms 49972 KB Output is correct
38 Correct 99 ms 50432 KB Output is correct
39 Correct 0 ms 208 KB Output is correct
40 Correct 0 ms 208 KB Output is correct
41 Correct 1 ms 208 KB Output is correct
42 Correct 329 ms 22744 KB Output is correct
43 Correct 898 ms 49604 KB Output is correct
44 Correct 561 ms 8364 KB Output is correct
45 Correct 738 ms 49612 KB Output is correct
46 Correct 600 ms 17336 KB Output is correct
47 Correct 867 ms 49612 KB Output is correct
48 Correct 1025 ms 50516 KB Output is correct
49 Correct 1128 ms 50216 KB Output is correct
50 Correct 1077 ms 50328 KB Output is correct
51 Correct 744 ms 49608 KB Output is correct
52 Correct 1092 ms 49940 KB Output is correct
53 Correct 1088 ms 50328 KB Output is correct
54 Correct 926 ms 50364 KB Output is correct
55 Correct 0 ms 208 KB Output is correct
56 Correct 141 ms 49320 KB Output is correct
57 Correct 1000 ms 49588 KB Output is correct
58 Correct 491 ms 8912 KB Output is correct
59 Correct 907 ms 49600 KB Output is correct
60 Correct 411 ms 17744 KB Output is correct
61 Correct 930 ms 49596 KB Output is correct
62 Correct 1041 ms 50376 KB Output is correct
63 Correct 785 ms 50080 KB Output is correct
64 Correct 1004 ms 50120 KB Output is correct
65 Correct 982 ms 49572 KB Output is correct
66 Correct 992 ms 49984 KB Output is correct
67 Correct 969 ms 50356 KB Output is correct
68 Correct 947 ms 50376 KB Output is correct
69 Correct 0 ms 208 KB Output is correct
70 Correct 1 ms 336 KB Output is correct
71 Correct 1 ms 336 KB Output is correct
72 Correct 2 ms 336 KB Output is correct
73 Correct 2 ms 336 KB Output is correct
74 Correct 3 ms 336 KB Output is correct
75 Correct 2 ms 336 KB Output is correct
76 Correct 0 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 2 ms 336 KB Output is correct
80 Correct 2 ms 336 KB Output is correct
81 Correct 3 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 3 ms 336 KB Output is correct
86 Correct 17 ms 720 KB Output is correct
87 Correct 20 ms 720 KB Output is correct
88 Correct 20 ms 720 KB Output is correct
89 Correct 23 ms 720 KB Output is correct
90 Correct 16 ms 720 KB Output is correct
91 Correct 0 ms 336 KB Output is correct
92 Correct 1 ms 464 KB Output is correct
93 Correct 24 ms 720 KB Output is correct
94 Correct 19 ms 720 KB Output is correct
95 Correct 18 ms 720 KB Output is correct
96 Correct 9 ms 720 KB Output is correct
97 Correct 18 ms 720 KB Output is correct
98 Correct 0 ms 208 KB Output is correct
99 Correct 97 ms 49532 KB Output is correct
100 Correct 95 ms 49552 KB Output is correct
101 Correct 95 ms 50232 KB Output is correct
102 Correct 109 ms 49612 KB Output is correct
103 Correct 102 ms 49936 KB Output is correct
104 Correct 107 ms 50344 KB Output is correct
105 Correct 0 ms 208 KB Output is correct
106 Correct 60 ms 28872 KB Output is correct
107 Correct 98 ms 49588 KB Output is correct
108 Correct 90 ms 50248 KB Output is correct
109 Correct 100 ms 49480 KB Output is correct
110 Correct 111 ms 49932 KB Output is correct
111 Correct 87 ms 50324 KB Output is correct

Subtask #7
0 / 19.0

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