oj.uz

Submission #649615

# Submission time Handle Problem Language Result Execution time Memory
649615 2022-10-11T05:32:17 Z alvinpiter Rainforest Jumps (APIO21_jumps) C++17
48 / 100
 1755 ms 52108 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 = rangeMaxQuery(lo, 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
4.0 / 4.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 308 ms 40852 KB Output is correct
4 Correct 1755 ms 51232 KB Output is correct
5 Correct 1399 ms 26012 KB Output is correct
6 Correct 1564 ms 51288 KB Output is correct
7 Correct 1270 ms 35152 KB Output is correct
8 Correct 1576 ms 51212 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 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 0 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 336 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 1 ms 208 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 341 ms 23568 KB Output is correct
5 Correct 1073 ms 51148 KB Output is correct
6 Correct 611 ms 8656 KB Output is correct
7 Correct 1219 ms 51116 KB Output is correct
8 Correct 610 ms 17736 KB Output is correct
9 Correct 855 ms 51116 KB Output is correct
10 Correct 1258 ms 51232 KB Output is correct
11 Correct 1428 ms 51276 KB Output is correct
12 Correct 1495 ms 51212 KB Output is correct
13 Correct 921 ms 51144 KB Output is correct
14 Correct 1632 ms 51708 KB Output is correct
15 Correct 959 ms 51908 KB Output is correct
16 Correct 942 ms 52032 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 2 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 0 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 23 ms 720 KB Output is correct
29 Correct 14 ms 720 KB Output is correct
30 Correct 22 ms 720 KB Output is correct
31 Correct 21 ms 720 KB Output is correct
32 Correct 1 ms 208 KB Output is correct
33 Correct 64 ms 29672 KB Output is correct
34 Correct 137 ms 51176 KB Output is correct
35 Correct 107 ms 51224 KB Output is correct
36 Correct 119 ms 51272 KB Output is correct
37 Correct 118 ms 51520 KB Output is correct
38 Correct 117 ms 51892 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 341 ms 23568 KB Output is correct
5 Correct 1073 ms 51148 KB Output is correct
6 Correct 611 ms 8656 KB Output is correct
7 Correct 1219 ms 51116 KB Output is correct
8 Correct 610 ms 17736 KB Output is correct
9 Correct 855 ms 51116 KB Output is correct
10 Correct 1258 ms 51232 KB Output is correct
11 Correct 1428 ms 51276 KB Output is correct
12 Correct 1495 ms 51212 KB Output is correct
13 Correct 921 ms 51144 KB Output is correct
14 Correct 1632 ms 51708 KB Output is correct
15 Correct 959 ms 51908 KB Output is correct
16 Correct 942 ms 52032 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 2 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 0 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 23 ms 720 KB Output is correct
29 Correct 14 ms 720 KB Output is correct
30 Correct 22 ms 720 KB Output is correct
31 Correct 21 ms 720 KB Output is correct
32 Correct 1 ms 208 KB Output is correct
33 Correct 64 ms 29672 KB Output is correct
34 Correct 137 ms 51176 KB Output is correct
35 Correct 107 ms 51224 KB Output is correct
36 Correct 119 ms 51272 KB Output is correct
37 Correct 118 ms 51520 KB Output is correct
38 Correct 117 ms 51892 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 336 KB Output is correct
42 Correct 285 ms 23580 KB Output is correct
43 Correct 990 ms 51180 KB Output is correct
44 Correct 601 ms 8656 KB Output is correct
45 Correct 1070 ms 51108 KB Output is correct
46 Correct 721 ms 17724 KB Output is correct
47 Correct 1086 ms 51144 KB Output is correct
48 Correct 1192 ms 51200 KB Output is correct
49 Correct 1589 ms 51288 KB Output is correct
50 Correct 1633 ms 51244 KB Output is correct
51 Correct 1012 ms 51112 KB Output is correct
52 Correct 1539 ms 51508 KB Output is correct
53 Correct 1000 ms 51912 KB Output is correct
54 Correct 844 ms 51968 KB Output is correct
55 Correct 0 ms 336 KB Output is correct
56 Correct 190 ms 50988 KB Output is correct
57 Correct 1158 ms 51148 KB Output is correct
58 Correct 533 ms 9168 KB Output is correct
59 Correct 1102 ms 51144 KB Output is correct
60 Correct 469 ms 18364 KB Output is correct
61 Correct 1193 ms 51164 KB Output is correct
62 Correct 1752 ms 51192 KB Output is correct
63 Correct 1402 ms 51332 KB Output is correct
64 Correct 1549 ms 51224 KB Output is correct
65 Correct 1276 ms 51144 KB Output is correct
66 Correct 1739 ms 51656 KB Output is correct
67 Correct 1045 ms 52108 KB Output is correct
68 Correct 1079 ms 51884 KB Output is correct
69 Correct 0 ms 336 KB Output is correct
70 Correct 1 ms 336 KB Output is correct
71 Correct 2 ms 336 KB Output is correct
72 Correct 2 ms 336 KB Output is correct
73 Correct 3 ms 336 KB Output is correct
74 Correct 3 ms 336 KB Output is correct
75 Correct 3 ms 336 KB Output is correct
76 Correct 1 ms 336 KB Output is correct
77 Correct 0 ms 208 KB Output is correct
78 Correct 3 ms 336 KB Output is correct
79 Correct 3 ms 336 KB Output is correct
80 Correct 2 ms 336 KB Output is correct
81 Correct 2 ms 336 KB Output is correct
82 Correct 3 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 4 ms 336 KB Output is correct
86 Correct 17 ms 720 KB Output is correct
87 Correct 23 ms 720 KB Output is correct
88 Correct 18 ms 752 KB Output is correct
89 Correct 21 ms 720 KB Output is correct
90 Correct 19 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 16 ms 720 KB Output is correct
94 Correct 22 ms 848 KB Output is correct
95 Correct 22 ms 720 KB Output is correct
96 Correct 22 ms 720 KB Output is correct
97 Correct 22 ms 848 KB Output is correct
98 Correct 1 ms 336 KB Output is correct
99 Correct 138 ms 51028 KB Output is correct
100 Correct 115 ms 51132 KB Output is correct
101 Correct 107 ms 51320 KB Output is correct
102 Correct 117 ms 51176 KB Output is correct
103 Correct 128 ms 51508 KB Output is correct
104 Correct 108 ms 52008 KB Output is correct
105 Correct 1 ms 208 KB Output is correct
106 Correct 63 ms 29732 KB Output is correct
107 Correct 121 ms 51240 KB Output is correct
108 Correct 112 ms 51356 KB Output is correct
109 Correct 114 ms 51144 KB Output is correct
110 Correct 133 ms 51528 KB Output is correct
111 Correct 107 ms 51912 KB Output is correct

Subtask #7
0 / 19.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 308 ms 40852 KB Output is correct
4 Correct 1755 ms 51232 KB Output is correct
5 Correct 1399 ms 26012 KB Output is correct
6 Correct 1564 ms 51288 KB Output is correct
7 Correct 1270 ms 35152 KB Output is correct
8 Correct 1576 ms 51212 KB Output is correct
9 Incorrect 0 ms 336 KB Output isn't correct
10 Halted 0 ms 0 KB -