oj.uz

Submission #649601

# Submission time Handle Problem Language Result Execution time Memory
649601 2022-10-11T03:22:44 Z alvinpiter Rainforest Jumps (APIO21_jumps) C++17
23 / 100
 1791 ms 51968 KB 
#include "jumps.h"
#include<bits/stdc++.h>
using namespace std;
#define INF 1000000000
#define MAXN 200000
#define MAXH 200000
#define MAXLG 17

int n, prevHigher[MAXN + 3], nextHigher[MAXN + 3], highest[MAXH + 3][MAXLG + 3], secondHighest[MAXH + 3][MAXLG + 3];
int spTableMax[MAXN + 3][MAXLG + 3];
vector<int> h;

void initPrevHigher() {
  stack<int> stHeight;
  for (int i = 0; i < n; i++) {
    while (!stHeight.empty() && h[i] > stHeight.top()) {
      stHeight.pop();
    }

    prevHigher[i] = (stHeight.empty() ? INF : stHeight.top());
    stHeight.push(h[i]);
  }
}

void initNextHigher() {
  stack<int> stHeight;
  for (int i = n - 1; i >= 0; i--) {
    while (!stHeight.empty() && h[i] > stHeight.top()) {
      stHeight.pop();
    }

    nextHigher[i] = (stHeight.empty() ? INF : stHeight.top());
    stHeight.push(h[i]);
  }
}

void initHighestAndSecondHighest() {
  for (int h = 1; h <= n; h++) {
    highest[h][0] = secondHighest[h][0] = INF;
  }

  for (int i = 0; i < n; i++) {
    highest[h[i]][0] = max(prevHigher[i], nextHigher[i]);
    secondHighest[h[i]][0] = min(prevHigher[i], nextHigher[i]);
  }

  for (int lg = 1; lg <= MAXLG; lg++) {
    for (int h = 1; h <= n; h++) {
      if (highest[h][lg - 1] < INF) {
        highest[h][lg] = highest[highest[h][lg - 1]][lg - 1];
      } else {
        highest[h][lg] = INF;
      }

      if (secondHighest[h][lg - 1] < INF) {
        secondHighest[h][lg] = secondHighest[secondHighest[h][lg - 1]][lg - 1];
      } else {
        secondHighest[h][lg] = INF;
      }
    }
  }
}

int getLastHeightFollowingHighest(int startingHeight, int numJumps) {
  int currentHeight = startingHeight;
  for (int lg = 0; lg <= MAXLG && currentHeight < INF; lg++) {
    if (numJumps & (1 << lg)) {
      currentHeight = highest[currentHeight][lg];
    }
  }

  return currentHeight;
}

int getLastHeightFollowingSecondHighest(int startingHeight, int numJumps) {
  int currentHeight = startingHeight;
  for (int lg = 0; lg <= MAXLG && currentHeight < INF; lg++) {
    if (numJumps & (1 << lg)) {
      currentHeight = secondHighest[currentHeight][lg];
    }
  }

  return currentHeight;
}

void initSpTableMax() {
  for (int i = 0; i < n; i++) {
    spTableMax[i][0] = h[i];
  }

  for (int lg = 1; lg <= 2; lg++) {
    for (int i = 0; i < n; i++) {
      if (i + (1 << (lg - 1)) < n) {
        spTableMax[i][lg] = max(spTableMax[i][lg - 1], spTableMax[i + (1 << (lg - 1))][lg - 1]);
      } else {
        spTableMax[i][lg] = spTableMax[i][lg - 1];
      }
    }
  }
}

int rangeMaxQuery(int a, int b) {
  int len = b - a + 1;
  int msb;
  for (int lg = MAXLG; lg >= 0; lg--) {
    if (len & (1 << lg)) {
      msb = lg;
      break;
    }
  }

  // cout << "hihi " << msb << " " << a << " " << b + 1 - (1 << msb) << endl;

  return max(spTableMax[a][msb], spTableMax[b + 1 - (1 << msb)][msb]);
}

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

  initPrevHigher();
  initNextHigher();
  initHighestAndSecondHighest();

  initSpTableMax();

  // cout << "\nprevHigher\n";
  // for (int i = 0; i < n; i++) {
  //   cout << prevHigher[i] << endl;
  // }

  // cout << "\nnextHigher\n";
  // for (int i = 0; i < n; i++) {
  //   cout << nextHigher[i] << endl;
  // }

  // cout << endl;
  // for (int i = 1; i <= 3; i++) {
  //   cout << "highest[" << i << "]: " << highest[i][0] << endl;
  //   cout << "secondHighest[" << i << "]: " << secondHighest[i][0] << endl;
  // }
}

int minimum_jumps(int A, int B, int C, int D) {
  int startingHeight = rangeMaxQuery(A, B);

  // cout << "\nstartingHeight: " << startingHeight << endl;
  // Calculate max number of jumps if we follow the highest pointer

  int numHighestJumps;
  if (true) {
    int lo = 0, hi = MAXN, mid;
    while (hi >= lo) {
      mid = (lo + hi)/2;
      if (getLastHeightFollowingHighest(startingHeight, mid) <= h[C]) {
        lo = mid + 1;
      } else {
        hi = mid - 1;
      }
    }

    numHighestJumps = hi;
  }

  // cout << "\nnumHighestJumps: " << numHighestJumps << endl;

  int heightAfterFollowingHighest = getLastHeightFollowingHighest(startingHeight, numHighestJumps);
  // cout << "\nheight after following highest:" << heightAfterFollowingHighest << endl;

  // Calculate max number of jumps if we follow the second highest pointer
  int numSecondHighestJumps;
  if (true) {
    int lo = 0, hi = MAXN, mid;
    while (hi >= lo) {
      mid = (lo + hi)/2;
      if (getLastHeightFollowingSecondHighest(heightAfterFollowingHighest, mid) <= h[C]) {
        lo = mid + 1;
      } else {
        hi = mid - 1;
      }
    }

    numSecondHighestJumps = hi;
  }

  int finalHeight = getLastHeightFollowingSecondHighest(heightAfterFollowingHighest, numSecondHighestJumps);
  // cout << "numSecondHighestJumps: " << numSecondHighestJumps << endl;
  // cout << "finalHeight: " << finalHeight << endl;

  if (finalHeight == h[C]) {
    return numHighestJumps + numSecondHighestJumps;
  } else {
    return -1;
  }
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Incorrect 178 ms 40872 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 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 1 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 208 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 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 287 ms 23464 KB Output is correct
5 Correct 1078 ms 51144 KB Output is correct
6 Correct 557 ms 8724 KB Output is correct
7 Correct 1166 ms 51144 KB Output is correct
8 Correct 566 ms 17732 KB Output is correct
9 Correct 1031 ms 51140 KB Output is correct
10 Correct 1593 ms 51220 KB Output is correct
11 Correct 1559 ms 51284 KB Output is correct
12 Correct 1465 ms 51288 KB Output is correct
13 Correct 1027 ms 51116 KB Output is correct
14 Correct 1494 ms 51528 KB Output is correct
15 Correct 750 ms 51912 KB Output is correct
16 Correct 971 ms 51968 KB Output is correct
17 Correct 0 ms 336 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 2 ms 336 KB Output is correct
22 Correct 4 ms 336 KB Output is correct
23 Correct 3 ms 336 KB Output is correct
24 Correct 2 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 18 ms 720 KB Output is correct
28 Correct 21 ms 848 KB Output is correct
29 Correct 22 ms 720 KB Output is correct
30 Correct 20 ms 720 KB Output is correct
31 Correct 22 ms 848 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 54 ms 29672 KB Output is correct
34 Correct 105 ms 51128 KB Output is correct
35 Correct 88 ms 51320 KB Output is correct
36 Correct 93 ms 51140 KB Output is correct
37 Correct 96 ms 51500 KB Output is correct
38 Correct 87 ms 51968 KB Output is correct

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 287 ms 23464 KB Output is correct
5 Correct 1078 ms 51144 KB Output is correct
6 Correct 557 ms 8724 KB Output is correct
7 Correct 1166 ms 51144 KB Output is correct
8 Correct 566 ms 17732 KB Output is correct
9 Correct 1031 ms 51140 KB Output is correct
10 Correct 1593 ms 51220 KB Output is correct
11 Correct 1559 ms 51284 KB Output is correct
12 Correct 1465 ms 51288 KB Output is correct
13 Correct 1027 ms 51116 KB Output is correct
14 Correct 1494 ms 51528 KB Output is correct
15 Correct 750 ms 51912 KB Output is correct
16 Correct 971 ms 51968 KB Output is correct
17 Correct 0 ms 336 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 2 ms 336 KB Output is correct
22 Correct 4 ms 336 KB Output is correct
23 Correct 3 ms 336 KB Output is correct
24 Correct 2 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 18 ms 720 KB Output is correct
28 Correct 21 ms 848 KB Output is correct
29 Correct 22 ms 720 KB Output is correct
30 Correct 20 ms 720 KB Output is correct
31 Correct 22 ms 848 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 54 ms 29672 KB Output is correct
34 Correct 105 ms 51128 KB Output is correct
35 Correct 88 ms 51320 KB Output is correct
36 Correct 93 ms 51140 KB Output is correct
37 Correct 96 ms 51500 KB Output is correct
38 Correct 87 ms 51968 KB Output is correct
39 Correct 1 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 290 ms 23584 KB Output is correct
43 Correct 1156 ms 51144 KB Output is correct
44 Correct 655 ms 8656 KB Output is correct
45 Correct 1225 ms 51112 KB Output is correct
46 Correct 621 ms 17736 KB Output is correct
47 Correct 1130 ms 51144 KB Output is correct
48 Correct 1593 ms 51196 KB Output is correct
49 Correct 1643 ms 51256 KB Output is correct
50 Correct 1573 ms 51216 KB Output is correct
51 Correct 1159 ms 51112 KB Output is correct
52 Correct 1791 ms 51564 KB Output is correct
53 Correct 956 ms 51912 KB Output is correct
54 Correct 1033 ms 51912 KB Output is correct
55 Correct 1 ms 336 KB Output is correct
56 Incorrect 172 ms 50872 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 208 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Incorrect 178 ms 40872 KB Output isn't correct
4 Halted 0 ms 0 KB -