oj.uz

답안 #478212

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
478212 2021-10-06T13:21:58 Z khoabright 밀림 점프 (APIO21_jumps) C++17
27 / 100
 1319 ms 50444 KB 
#include <bits/stdc++.h>
using namespace std;

#define ff first
#define ss second
#define pii pair<int, int>
#define all(x) x.begin(), x.end()
#define rep(i, a, b) for (int i = (int)a; i <= (int)b; ++i)
#define rep1(i, a, b) for (int i = (int)a; i >= (int)b; --i)
#define mp make_pair

constexpr int kMaxLogN = 20;

int N;
vector<int> H;
vector<vector<int>> L, R;
vector<vector<int>> higher;

void init(int _N, std::vector<int> _H) {
  N = _N;
  H = _H;

  H.insert(H.begin(), INT_MAX);
  H.insert(H.end(), INT_MAX);
  N += 2;
  L = R = higher = vector<vector<int>>(kMaxLogN, vector<int>(N));

  stack<int> decreasing_height;
  for (int i = 0; i < N; ++i) {
    while (!decreasing_height.empty() && H[decreasing_height.top()] <= H[i]) {
      decreasing_height.pop();
    }
    L[0][i] = decreasing_height.empty() ? i : decreasing_height.top();
    decreasing_height.push(i);
  }

  while (!decreasing_height.empty()) {
    decreasing_height.pop();
  }
  for (int i = N - 1; i >= 0; --i) {
    while (!decreasing_height.empty() && H[decreasing_height.top()] <= H[i]) {
      decreasing_height.pop();
    }
    R[0][i] = decreasing_height.empty() ? i : decreasing_height.top();
    decreasing_height.push(i);
  }

  for (int i = 0; i < N; ++i) {
    higher[0][i] = H[L[0][i]] > H[R[0][i]] ? L[0][i] : R[0][i];
  }

  for (int j = 1; j < kMaxLogN; ++j) {
    for (int i = 0; i < N; ++i) {
      L[j][i] = L[j - 1][L[j - 1][i]];
      R[j][i] = R[j - 1][R[j - 1][i]];
      higher[j][i] = higher[j - 1][higher[j - 1][i]];
    }
  }
}

int minimum_jumps(int s, int e) {
  int jumps = 0;
  for (int j = kMaxLogN - 1; j >= 0; --j) {
    if (H[higher[j][s]] <= H[e]) {
      s = higher[j][s];
      jumps |= (1 << j);
    }
  }
  if (H[L[0][s]] > H[e]) {
    for (int j = kMaxLogN - 1; j >= 0; --j) {
      if (H[R[j][s]] <= H[e]) {
        s = R[j][s];
        jumps += (1 << j);
      }
    }
  } 
  else {
    for (int j = kMaxLogN - 1; j >= 0; --j) {
      if (H[L[j][s]] <= H[e]) {
        s = L[j][s];
        jumps += (1 << j);
      }
    }
  }
  return s == e ? jumps : -1;
}

int minimum_jumps(int A, int B, int C, int D) {
  ++A; ++B; ++C; ++D;

  return minimum_jumps(B, C);
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 218 ms 40096 KB Output is correct
4 Correct 1234 ms 50440 KB Output is correct
5 Correct 1061 ms 25528 KB Output is correct
6 Correct 1216 ms 50352 KB Output is correct
7 Correct 1027 ms 34416 KB Output is correct
8 Correct 1319 ms 50436 KB Output is correct

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 200 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 200 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 200 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 246 ms 23084 KB Output is correct
5 Correct 924 ms 50328 KB Output is correct
6 Correct 724 ms 8516 KB Output is correct
7 Correct 1155 ms 50384 KB Output is correct
8 Correct 857 ms 17416 KB Output is correct
9 Correct 1125 ms 50352 KB Output is correct
10 Correct 1317 ms 50444 KB Output is correct
11 Correct 1245 ms 50324 KB Output is correct
12 Correct 1035 ms 50296 KB Output is correct
13 Correct 906 ms 50384 KB Output is correct
14 Correct 1157 ms 50308 KB Output is correct
15 Correct 1016 ms 50376 KB Output is correct
16 Correct 873 ms 50432 KB Output is correct
17 Correct 0 ms 200 KB Output is correct
18 Correct 0 ms 200 KB Output is correct
19 Correct 2 ms 200 KB Output is correct
20 Correct 2 ms 328 KB Output is correct
21 Correct 4 ms 328 KB Output is correct
22 Correct 2 ms 328 KB Output is correct
23 Correct 1 ms 328 KB Output is correct
24 Correct 4 ms 328 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 1 ms 456 KB Output is correct
27 Correct 22 ms 788 KB Output is correct
28 Correct 26 ms 712 KB Output is correct
29 Correct 15 ms 712 KB Output is correct
30 Correct 25 ms 796 KB Output is correct
31 Correct 25 ms 712 KB Output is correct
32 Correct 0 ms 200 KB Output is correct
33 Correct 33 ms 29300 KB Output is correct
34 Correct 62 ms 50332 KB Output is correct
35 Correct 57 ms 50352 KB Output is correct
36 Correct 58 ms 50340 KB Output is correct
37 Correct 57 ms 50308 KB Output is correct
38 Correct 61 ms 50328 KB Output is correct

Subtask #6
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 246 ms 23084 KB Output is correct
5 Correct 924 ms 50328 KB Output is correct
6 Correct 724 ms 8516 KB Output is correct
7 Correct 1155 ms 50384 KB Output is correct
8 Correct 857 ms 17416 KB Output is correct
9 Correct 1125 ms 50352 KB Output is correct
10 Correct 1317 ms 50444 KB Output is correct
11 Correct 1245 ms 50324 KB Output is correct
12 Correct 1035 ms 50296 KB Output is correct
13 Correct 906 ms 50384 KB Output is correct
14 Correct 1157 ms 50308 KB Output is correct
15 Correct 1016 ms 50376 KB Output is correct
16 Correct 873 ms 50432 KB Output is correct
17 Correct 0 ms 200 KB Output is correct
18 Correct 0 ms 200 KB Output is correct
19 Correct 2 ms 200 KB Output is correct
20 Correct 2 ms 328 KB Output is correct
21 Correct 4 ms 328 KB Output is correct
22 Correct 2 ms 328 KB Output is correct
23 Correct 1 ms 328 KB Output is correct
24 Correct 4 ms 328 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 1 ms 456 KB Output is correct
27 Correct 22 ms 788 KB Output is correct
28 Correct 26 ms 712 KB Output is correct
29 Correct 15 ms 712 KB Output is correct
30 Correct 25 ms 796 KB Output is correct
31 Correct 25 ms 712 KB Output is correct
32 Correct 0 ms 200 KB Output is correct
33 Correct 33 ms 29300 KB Output is correct
34 Correct 62 ms 50332 KB Output is correct
35 Correct 57 ms 50352 KB Output is correct
36 Correct 58 ms 50340 KB Output is correct
37 Correct 57 ms 50308 KB Output is correct
38 Correct 61 ms 50328 KB Output is correct
39 Correct 0 ms 200 KB Output is correct
40 Correct 0 ms 200 KB Output is correct
41 Correct 0 ms 200 KB Output is correct
42 Correct 313 ms 23060 KB Output is correct
43 Correct 1184 ms 50324 KB Output is correct
44 Correct 576 ms 8516 KB Output is correct
45 Correct 1060 ms 50344 KB Output is correct
46 Correct 611 ms 17464 KB Output is correct
47 Correct 1124 ms 50352 KB Output is correct
48 Correct 1106 ms 50352 KB Output is correct
49 Correct 1109 ms 50312 KB Output is correct
50 Correct 1028 ms 50308 KB Output is correct
51 Correct 992 ms 50304 KB Output is correct
52 Correct 1060 ms 50308 KB Output is correct
53 Correct 1043 ms 50352 KB Output is correct
54 Correct 1058 ms 50308 KB Output is correct
55 Correct 0 ms 200 KB Output is correct
56 Incorrect 112 ms 50172 KB Output isn't correct
57 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 218 ms 40096 KB Output is correct
4 Correct 1234 ms 50440 KB Output is correct
5 Correct 1061 ms 25528 KB Output is correct
6 Correct 1216 ms 50352 KB Output is correct
7 Correct 1027 ms 34416 KB Output is correct
8 Correct 1319 ms 50436 KB Output is correct
9 Incorrect 1 ms 200 KB Output isn't correct
10 Halted 0 ms 0 KB -