oj.uz

Submission #649614

# Submission time Handle Problem Language Result Execution time Memory
649614 2022-10-11T05:26:48 Z alvinpiter Rainforest Jumps (APIO21_jumps) C++17
23 / 100
 1883 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 <= MAXLG; 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;
    }
  }

  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) {
  // Find the best starting height
  int startingHeight;
  if (true) {
    int lo = A, hi = B, mid;
    while (hi >= lo) {
      mid = (lo + hi)/2;
      if (rangeMaxQuery(mid, B) <= h[C]) {
        hi = mid - 1;
      } else {
        lo = mid + 1;
      }
    }

    if (lo > B) {
      return -1;
    } else {
      startingHeight = h[lo];
    }
  }

  // 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 1 ms 208 KB Output is correct
2 Correct 1 ms 388 KB Output is correct
3 Incorrect 261 ms 40864 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 0 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 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 256 ms 23584 KB Output is correct
5 Correct 924 ms 51112 KB Output is correct
6 Correct 426 ms 8660 KB Output is correct
7 Correct 946 ms 51176 KB Output is correct
8 Correct 715 ms 17828 KB Output is correct
9 Correct 1114 ms 51144 KB Output is correct
10 Correct 1620 ms 51404 KB Output is correct
11 Correct 1511 ms 51260 KB Output is correct
12 Correct 1688 ms 51288 KB Output is correct
13 Correct 1252 ms 51108 KB Output is correct
14 Correct 1883 ms 51528 KB Output is correct
15 Correct 1031 ms 51884 KB Output is correct
16 Correct 952 ms 51968 KB Output is correct
17 Correct 0 ms 336 KB Output is correct
18 Correct 0 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 3 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 19 ms 720 KB Output is correct
28 Correct 21 ms 848 KB Output is correct
29 Correct 21 ms 720 KB Output is correct
30 Correct 12 ms 720 KB Output is correct
31 Correct 18 ms 848 KB Output is correct
32 Correct 0 ms 336 KB Output is correct
33 Correct 71 ms 29732 KB Output is correct
34 Correct 133 ms 51180 KB Output is correct
35 Correct 106 ms 51320 KB Output is correct
36 Correct 115 ms 51272 KB Output is correct
37 Correct 121 ms 51592 KB Output is correct
38 Correct 107 ms 51880 KB Output is correct

Subtask #6
0 / 21.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 1 ms 208 KB Output is correct
4 Correct 256 ms 23584 KB Output is correct
5 Correct 924 ms 51112 KB Output is correct
6 Correct 426 ms 8660 KB Output is correct
7 Correct 946 ms 51176 KB Output is correct
8 Correct 715 ms 17828 KB Output is correct
9 Correct 1114 ms 51144 KB Output is correct
10 Correct 1620 ms 51404 KB Output is correct
11 Correct 1511 ms 51260 KB Output is correct
12 Correct 1688 ms 51288 KB Output is correct
13 Correct 1252 ms 51108 KB Output is correct
14 Correct 1883 ms 51528 KB Output is correct
15 Correct 1031 ms 51884 KB Output is correct
16 Correct 952 ms 51968 KB Output is correct
17 Correct 0 ms 336 KB Output is correct
18 Correct 0 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 3 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 19 ms 720 KB Output is correct
28 Correct 21 ms 848 KB Output is correct
29 Correct 21 ms 720 KB Output is correct
30 Correct 12 ms 720 KB Output is correct
31 Correct 18 ms 848 KB Output is correct
32 Correct 0 ms 336 KB Output is correct
33 Correct 71 ms 29732 KB Output is correct
34 Correct 133 ms 51180 KB Output is correct
35 Correct 106 ms 51320 KB Output is correct
36 Correct 115 ms 51272 KB Output is correct
37 Correct 121 ms 51592 KB Output is correct
38 Correct 107 ms 51880 KB Output is correct
39 Correct 0 ms 208 KB Output is correct
40 Correct 0 ms 336 KB Output is correct
41 Correct 0 ms 336 KB Output is correct
42 Correct 268 ms 23476 KB Output is correct
43 Correct 890 ms 51240 KB Output is correct
44 Correct 438 ms 8712 KB Output is correct
45 Correct 1164 ms 51108 KB Output is correct
46 Correct 729 ms 17736 KB Output is correct
47 Correct 1043 ms 51176 KB Output is correct
48 Correct 1550 ms 51292 KB Output is correct
49 Correct 1451 ms 51388 KB Output is correct
50 Correct 1673 ms 51284 KB Output is correct
51 Correct 1182 ms 51092 KB Output is correct
52 Correct 1636 ms 51524 KB Output is correct
53 Correct 936 ms 51880 KB Output is correct
54 Correct 929 ms 51904 KB Output is correct
55 Correct 0 ms 336 KB Output is correct
56 Incorrect 179 ms 50884 KB Output isn't correct
57 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

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