oj.uz

Submission #649621

# Submission time Handle Problem Language Result Execution time Memory
649621 2022-10-11T06:38:43 Z alvinpiter Rainforest Jumps (APIO21_jumps) C++17
48 / 100
 1763 ms 52100 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) <= rangeMaxQuery(C, D)) {
        hi = mid - 1;
      } else {
        lo = mid + 1;
      }
    }

    if (lo > B) {
      return -1;
    } else {
      startingHeight = rangeMaxQuery(lo, B);
    }
  }

  // Find the best ending height
  int endingHeight;
  if (true) {
    int lo = C, hi = D, mid;
    while (hi >= lo) {
      mid = (lo + hi)/2;
      if (rangeMaxQuery(C, mid) < startingHeight) {
        lo = mid + 1;
      } else {
        hi = mid - 1;
      }
    }

    endingHeight = rangeMaxQuery(C, lo);
  }

  // cout << "\nstartingHeight: " << startingHeight << endl;
  // cout << "\nendingHeight: " << endingHeight << 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) <= endingHeight) {
        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) <= endingHeight) {
        lo = mid + 1;
      } else {
        hi = mid - 1;
      }
    }

    numSecondHighestJumps = hi;
  }

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

  if (finalHeight == endingHeight) {
    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 1 ms 336 KB Output is correct
3 Correct 220 ms 40864 KB Output is correct
4 Correct 1733 ms 51320 KB Output is correct
5 Correct 1318 ms 26008 KB Output is correct
6 Correct 1613 ms 51288 KB Output is correct
7 Correct 1104 ms 35104 KB Output is correct
8 Correct 1613 ms 51316 KB Output is correct

Subtask #2
0 / 8.0

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

Subtask #3
0 / 13.0

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

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 1 ms 436 KB Output is correct
5 Correct 101 ms 41252 KB Output is correct
6 Correct 116 ms 51140 KB Output is correct
7 Correct 64 ms 26312 KB Output is correct
8 Correct 118 ms 51112 KB Output is correct
9 Correct 10 ms 7888 KB Output is correct
10 Correct 118 ms 51140 KB Output is correct
11 Correct 108 ms 51224 KB Output is correct
12 Correct 107 ms 51304 KB Output is correct
13 Incorrect 106 ms 51292 KB Output isn't correct
14 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 208 KB Output is correct
4 Correct 290 ms 23464 KB Output is correct
5 Correct 876 ms 51112 KB Output is correct
6 Correct 565 ms 8656 KB Output is correct
7 Correct 928 ms 51144 KB Output is correct
8 Correct 654 ms 17832 KB Output is correct
9 Correct 1088 ms 51056 KB Output is correct
10 Correct 1504 ms 51320 KB Output is correct
11 Correct 1497 ms 51264 KB Output is correct
12 Correct 1600 ms 51196 KB Output is correct
13 Correct 674 ms 51148 KB Output is correct
14 Correct 1763 ms 51556 KB Output is correct
15 Correct 930 ms 52040 KB Output is correct
16 Correct 824 ms 52100 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 2 ms 336 KB Output is correct
21 Correct 3 ms 336 KB Output is correct
22 Correct 2 ms 336 KB Output is correct
23 Correct 2 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 22 ms 720 KB Output is correct
28 Correct 20 ms 720 KB Output is correct
29 Correct 23 ms 720 KB Output is correct
30 Correct 24 ms 720 KB Output is correct
31 Correct 18 ms 720 KB Output is correct
32 Correct 0 ms 336 KB Output is correct
33 Correct 66 ms 29680 KB Output is correct
34 Correct 117 ms 51056 KB Output is correct
35 Correct 109 ms 51320 KB Output is correct
36 Correct 115 ms 51116 KB Output is correct
37 Correct 115 ms 51560 KB Output is correct
38 Correct 114 ms 51892 KB Output is correct

Subtask #6
21.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 208 KB Output is correct
4 Correct 290 ms 23464 KB Output is correct
5 Correct 876 ms 51112 KB Output is correct
6 Correct 565 ms 8656 KB Output is correct
7 Correct 928 ms 51144 KB Output is correct
8 Correct 654 ms 17832 KB Output is correct
9 Correct 1088 ms 51056 KB Output is correct
10 Correct 1504 ms 51320 KB Output is correct
11 Correct 1497 ms 51264 KB Output is correct
12 Correct 1600 ms 51196 KB Output is correct
13 Correct 674 ms 51148 KB Output is correct
14 Correct 1763 ms 51556 KB Output is correct
15 Correct 930 ms 52040 KB Output is correct
16 Correct 824 ms 52100 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 2 ms 336 KB Output is correct
21 Correct 3 ms 336 KB Output is correct
22 Correct 2 ms 336 KB Output is correct
23 Correct 2 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 22 ms 720 KB Output is correct
28 Correct 20 ms 720 KB Output is correct
29 Correct 23 ms 720 KB Output is correct
30 Correct 24 ms 720 KB Output is correct
31 Correct 18 ms 720 KB Output is correct
32 Correct 0 ms 336 KB Output is correct
33 Correct 66 ms 29680 KB Output is correct
34 Correct 117 ms 51056 KB Output is correct
35 Correct 109 ms 51320 KB Output is correct
36 Correct 115 ms 51116 KB Output is correct
37 Correct 115 ms 51560 KB Output is correct
38 Correct 114 ms 51892 KB Output is correct
39 Correct 1 ms 336 KB Output is correct
40 Correct 1 ms 336 KB Output is correct
41 Correct 0 ms 208 KB Output is correct
42 Correct 289 ms 23496 KB Output is correct
43 Correct 1073 ms 51176 KB Output is correct
44 Correct 689 ms 8620 KB Output is correct
45 Correct 1006 ms 51052 KB Output is correct
46 Correct 639 ms 17736 KB Output is correct
47 Correct 1090 ms 51160 KB Output is correct
48 Correct 1648 ms 51196 KB Output is correct
49 Correct 1456 ms 51292 KB Output is correct
50 Correct 1625 ms 51212 KB Output is correct
51 Correct 1147 ms 51176 KB Output is correct
52 Correct 1537 ms 51656 KB Output is correct
53 Correct 886 ms 51912 KB Output is correct
54 Correct 1018 ms 52100 KB Output is correct
55 Correct 0 ms 336 KB Output is correct
56 Correct 198 ms 50976 KB Output is correct
57 Correct 946 ms 51128 KB Output is correct
58 Correct 622 ms 9168 KB Output is correct
59 Correct 915 ms 51144 KB Output is correct
60 Correct 342 ms 18376 KB Output is correct
61 Correct 989 ms 51228 KB Output is correct
62 Correct 1657 ms 51324 KB Output is correct
63 Correct 1524 ms 51304 KB Output is correct
64 Correct 1558 ms 51396 KB Output is correct
65 Correct 1336 ms 51144 KB Output is correct
66 Correct 1745 ms 51556 KB Output is correct
67 Correct 1180 ms 51912 KB Output is correct
68 Correct 962 ms 51912 KB Output is correct
69 Correct 1 ms 336 KB Output is correct
70 Correct 1 ms 336 KB Output is correct
71 Correct 3 ms 336 KB Output is correct
72 Correct 3 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 0 ms 208 KB Output is correct
77 Correct 0 ms 336 KB Output is correct
78 Correct 2 ms 208 KB Output is correct
79 Correct 3 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 3 ms 336 KB Output is correct
83 Correct 1 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 18 ms 720 KB Output is correct
87 Correct 20 ms 720 KB Output is correct
88 Correct 19 ms 720 KB Output is correct
89 Correct 23 ms 720 KB Output is correct
90 Correct 18 ms 848 KB Output is correct
91 Correct 0 ms 336 KB Output is correct
92 Correct 1 ms 464 KB Output is correct
93 Correct 11 ms 720 KB Output is correct
94 Correct 27 ms 848 KB Output is correct
95 Correct 21 ms 720 KB Output is correct
96 Correct 33 ms 720 KB Output is correct
97 Correct 20 ms 720 KB Output is correct
98 Correct 1 ms 336 KB Output is correct
99 Correct 161 ms 51208 KB Output is correct
100 Correct 173 ms 51144 KB Output is correct
101 Correct 171 ms 51264 KB Output is correct
102 Correct 209 ms 51144 KB Output is correct
103 Correct 191 ms 51528 KB Output is correct
104 Correct 161 ms 51968 KB Output is correct
105 Correct 1 ms 336 KB Output is correct
106 Correct 99 ms 29784 KB Output is correct
107 Correct 211 ms 51124 KB Output is correct
108 Correct 109 ms 51320 KB Output is correct
109 Correct 114 ms 51116 KB Output is correct
110 Correct 113 ms 51624 KB Output is correct
111 Correct 105 ms 51972 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 1 ms 336 KB Output is correct
3 Correct 220 ms 40864 KB Output is correct
4 Correct 1733 ms 51320 KB Output is correct
5 Correct 1318 ms 26008 KB Output is correct
6 Correct 1613 ms 51288 KB Output is correct
7 Correct 1104 ms 35104 KB Output is correct
8 Correct 1613 ms 51316 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 0 ms 336 KB Output is correct
13 Correct 2 ms 336 KB Output is correct
14 Incorrect 3 ms 336 KB Output isn't correct
15 Halted 0 ms 0 KB -