oj.uz

Submission #561998

# Submission time Handle Problem Language Result Execution time Memory
561998 2022-05-14T03:52:49 Z ian2024 Rainforest Jumps (APIO21_jumps) C++14
48 / 100
 1509 ms 83488 KB 
#include <bits/stdc++.h>

using namespace std;

struct C_HASH {
  static uint64_t splitmix64(uint64_t x) {
    // http://xorshift.di.unimi.it/splitmix64.c
    x += 0x9e3779b97f4a7c15;
    x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
    x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
    return x ^ (x >> 31);
  }

  size_t operator()(uint64_t x) const {
    static const uint64_t FIXED_RANDOM =
        chrono::steady_clock::now().time_since_epoch().count();
    return splitmix64(x + FIXED_RANDOM);
  }
};

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());

typedef pair<int, int> ii;
typedef tuple<int, int, int> iii;
typedef long long ll;

const int INF = 1e9;
const ll INFL = 1e18;
const int MOD = 1000000007;

#define SIZE(a) (int)(a).size()
#define endl '\n'
#define all(x) x.begin(), x.end()
#define ALL(x) begin(x), end(x)

int pos[200005];
int h[200005];
int lo[200005][18];
int hi[200005][18];
int le[200005][18];
int ri[200005][18];
int pi[200005][18];
void init(int N, std::vector<int> H) {
  for (int i = 0; i < 200005; ++i) {
    for (int j = 0; j < 18; ++j) {
      lo[i][j] = INF;
      hi[i][j] = INF;
      le[i][j] = INF;
      ri[i][j] = INF;
      pi[i][j] = INF;
    }
  }

  for (int i = 0; i < N; ++i) {
    h[i] = H[i];
    pos[H[i]] = i;
  }

  set<int> s;
  for (int i = N; i >= 1; --i) {
    s.insert(pos[i]);
    auto l = s.lower_bound(pos[i]);
    if (l != s.begin()) {
      l--;
      le[i][0] = H[*l];
    }
    auto r = s.upper_bound(pos[i]);
    if (r != s.end()) {
    	ri[i][0] = H[*r];
    	pi[ri[i][0]][0] = i;
    }
    hi[i][0] = max(le[i][0], ri[i][0]);
    lo[i][0] = min(le[i][0], ri[i][0]);
  }

  for (int j = 1; j < 18; ++j) {
    for (int i = 1; i <= N; ++i) {
      if (lo[i][j - 1] != INF) lo[i][j] = lo[lo[i][j - 1]][j - 1];
      if (hi[i][j - 1] != INF) hi[i][j] = hi[hi[i][j - 1]][j - 1];
      if (le[i][j - 1] != INF) le[i][j] = le[le[i][j - 1]][j - 1];
      if (ri[i][j - 1] != INF) ri[i][j] = ri[ri[i][j - 1]][j - 1];
      if (pi[i][j - 1] != INF) pi[i][j] = pi[pi[i][j - 1]][j - 1];
    }
  }
}

int f(int curr, int ed) {
  int jumps = 0;
  for (int i = 17; i >= 0; --i) {
    if (hi[curr][i] <= ed) {
      curr = hi[curr][i];
      jumps += (1 << i);
    }
  }

  for (int i = 17; i >= 0; --i) {
    if (lo[curr][i] <= ed) {
      curr = lo[curr][i];
      jumps += (1 << i);
    }
  }

  if (curr != ed) return -1;
  return jumps;
}

int minimum_jumps(int A, int B, int C, int D) {
  int curr = h[B];
  for (int i = 17; i >= 0; --i) {
    if (le[curr][i] != INF and pos[le[curr][i]] >= A and le[curr][i] < h[C])
      curr = le[curr][i];
  }

  int rr = h[C];
  for (int i = 17; i >= 0; --i) {
  	if (ri[rr][i] != INF and pos[ri[rr][i]] <= D) rr = ri[rr][i];
  }
  
  int res = f(curr, rr);
  
  for (int x = 17; x >= 0; --x) {
  	if (pi[rr][x] != INF and pos[pi[rr][x]] >= C) {
  		int v = f(curr, pi[rr][x]);
  		if (v != -1) {
  			rr = pi[rr][x];
  			res = v;
  		}
  	}
  }
  
  return res;
}

#ifdef LOCAL_PROJECT
int main() {
  int N, Q;
  assert(2 == scanf("%d %d", &N, &Q));
  std::vector<int> H(N);
  for (int i = 0; i < N; ++i) {
    assert(1 == scanf("%d", &H[i]));
  }
  init(N, H);

  for (int i = 0; i < Q; ++i) {
    int A, B, C, D;
    assert(4 == scanf("%d %d %d %d", &A, &B, &C, &D));
    printf("%d\n", minimum_jumps(A, B, C, D));
  }
  return 0;
}
#else
#include "jumps.h"
#define cerr \
  if (false) cerr
#endif

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 70744 KB Output is correct
2 Correct 32 ms 70756 KB Output is correct
3 Correct 308 ms 80660 KB Output is correct
4 Correct 1509 ms 83380 KB Output is correct
5 Correct 1201 ms 76980 KB Output is correct
6 Correct 1495 ms 83272 KB Output is correct
7 Correct 1028 ms 79304 KB Output is correct
8 Correct 1497 ms 83224 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 70728 KB Output is correct
2 Correct 35 ms 70640 KB Output is correct
3 Correct 33 ms 70748 KB Output is correct
4 Correct 34 ms 70696 KB Output is correct
5 Incorrect 40 ms 70760 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 70728 KB Output is correct
2 Correct 35 ms 70640 KB Output is correct
3 Correct 33 ms 70748 KB Output is correct
4 Correct 34 ms 70696 KB Output is correct
5 Incorrect 40 ms 70760 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 70728 KB Output is correct
2 Correct 39 ms 70656 KB Output is correct
3 Correct 35 ms 70736 KB Output is correct
4 Correct 34 ms 70728 KB Output is correct
5 Incorrect 219 ms 80912 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 70764 KB Output is correct
2 Correct 34 ms 70708 KB Output is correct
3 Correct 34 ms 70708 KB Output is correct
4 Correct 312 ms 76360 KB Output is correct
5 Correct 823 ms 83272 KB Output is correct
6 Correct 668 ms 72812 KB Output is correct
7 Correct 1239 ms 83276 KB Output is correct
8 Correct 696 ms 75048 KB Output is correct
9 Correct 1092 ms 83272 KB Output is correct
10 Correct 1036 ms 83272 KB Output is correct
11 Correct 1167 ms 83228 KB Output is correct
12 Correct 1093 ms 83388 KB Output is correct
13 Correct 850 ms 83272 KB Output is correct
14 Correct 1134 ms 83192 KB Output is correct
15 Correct 896 ms 83208 KB Output is correct
16 Correct 989 ms 83144 KB Output is correct
17 Correct 32 ms 70728 KB Output is correct
18 Correct 34 ms 70756 KB Output is correct
19 Correct 33 ms 70748 KB Output is correct
20 Correct 35 ms 70752 KB Output is correct
21 Correct 34 ms 70712 KB Output is correct
22 Correct 35 ms 70724 KB Output is correct
23 Correct 33 ms 70756 KB Output is correct
24 Correct 36 ms 70636 KB Output is correct
25 Correct 34 ms 70652 KB Output is correct
26 Correct 35 ms 70740 KB Output is correct
27 Correct 51 ms 70892 KB Output is correct
28 Correct 53 ms 70856 KB Output is correct
29 Correct 52 ms 70868 KB Output is correct
30 Correct 53 ms 70796 KB Output is correct
31 Correct 51 ms 70844 KB Output is correct
32 Correct 36 ms 70732 KB Output is correct
33 Correct 152 ms 77980 KB Output is correct
34 Correct 263 ms 83396 KB Output is correct
35 Correct 215 ms 83400 KB Output is correct
36 Correct 233 ms 83280 KB Output is correct
37 Correct 249 ms 83272 KB Output is correct
38 Correct 207 ms 83248 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 70764 KB Output is correct
2 Correct 34 ms 70708 KB Output is correct
3 Correct 34 ms 70708 KB Output is correct
4 Correct 312 ms 76360 KB Output is correct
5 Correct 823 ms 83272 KB Output is correct
6 Correct 668 ms 72812 KB Output is correct
7 Correct 1239 ms 83276 KB Output is correct
8 Correct 696 ms 75048 KB Output is correct
9 Correct 1092 ms 83272 KB Output is correct
10 Correct 1036 ms 83272 KB Output is correct
11 Correct 1167 ms 83228 KB Output is correct
12 Correct 1093 ms 83388 KB Output is correct
13 Correct 850 ms 83272 KB Output is correct
14 Correct 1134 ms 83192 KB Output is correct
15 Correct 896 ms 83208 KB Output is correct
16 Correct 989 ms 83144 KB Output is correct
17 Correct 32 ms 70728 KB Output is correct
18 Correct 34 ms 70756 KB Output is correct
19 Correct 33 ms 70748 KB Output is correct
20 Correct 35 ms 70752 KB Output is correct
21 Correct 34 ms 70712 KB Output is correct
22 Correct 35 ms 70724 KB Output is correct
23 Correct 33 ms 70756 KB Output is correct
24 Correct 36 ms 70636 KB Output is correct
25 Correct 34 ms 70652 KB Output is correct
26 Correct 35 ms 70740 KB Output is correct
27 Correct 51 ms 70892 KB Output is correct
28 Correct 53 ms 70856 KB Output is correct
29 Correct 52 ms 70868 KB Output is correct
30 Correct 53 ms 70796 KB Output is correct
31 Correct 51 ms 70844 KB Output is correct
32 Correct 36 ms 70732 KB Output is correct
33 Correct 152 ms 77980 KB Output is correct
34 Correct 263 ms 83396 KB Output is correct
35 Correct 215 ms 83400 KB Output is correct
36 Correct 233 ms 83280 KB Output is correct
37 Correct 249 ms 83272 KB Output is correct
38 Correct 207 ms 83248 KB Output is correct
39 Correct 35 ms 70736 KB Output is correct
40 Correct 32 ms 70728 KB Output is correct
41 Correct 33 ms 70712 KB Output is correct
42 Correct 276 ms 76428 KB Output is correct
43 Correct 1092 ms 83264 KB Output is correct
44 Correct 512 ms 72776 KB Output is correct
45 Correct 1083 ms 83276 KB Output is correct
46 Correct 525 ms 75068 KB Output is correct
47 Correct 975 ms 83172 KB Output is correct
48 Correct 1113 ms 83272 KB Output is correct
49 Correct 958 ms 83248 KB Output is correct
50 Correct 1141 ms 83232 KB Output is correct
51 Correct 1035 ms 83276 KB Output is correct
52 Correct 1122 ms 83268 KB Output is correct
53 Correct 930 ms 83488 KB Output is correct
54 Correct 918 ms 83272 KB Output is correct
55 Correct 36 ms 70728 KB Output is correct
56 Correct 311 ms 83332 KB Output is correct
57 Correct 1066 ms 83280 KB Output is correct
58 Correct 500 ms 72960 KB Output is correct
59 Correct 1069 ms 83340 KB Output is correct
60 Correct 441 ms 75196 KB Output is correct
61 Correct 1237 ms 83276 KB Output is correct
62 Correct 1250 ms 83284 KB Output is correct
63 Correct 1062 ms 83248 KB Output is correct
64 Correct 1225 ms 83260 KB Output is correct
65 Correct 1195 ms 83276 KB Output is correct
66 Correct 1245 ms 83284 KB Output is correct
67 Correct 1145 ms 83276 KB Output is correct
68 Correct 1072 ms 83152 KB Output is correct
69 Correct 38 ms 70656 KB Output is correct
70 Correct 38 ms 70640 KB Output is correct
71 Correct 39 ms 70776 KB Output is correct
72 Correct 41 ms 70668 KB Output is correct
73 Correct 43 ms 70712 KB Output is correct
74 Correct 40 ms 70720 KB Output is correct
75 Correct 45 ms 70748 KB Output is correct
76 Correct 46 ms 70696 KB Output is correct
77 Correct 39 ms 70736 KB Output is correct
78 Correct 56 ms 70636 KB Output is correct
79 Correct 40 ms 70752 KB Output is correct
80 Correct 46 ms 70668 KB Output is correct
81 Correct 43 ms 70728 KB Output is correct
82 Correct 40 ms 70680 KB Output is correct
83 Correct 43 ms 70732 KB Output is correct
84 Correct 39 ms 70660 KB Output is correct
85 Correct 43 ms 70708 KB Output is correct
86 Correct 55 ms 70848 KB Output is correct
87 Correct 59 ms 70768 KB Output is correct
88 Correct 58 ms 70820 KB Output is correct
89 Correct 61 ms 70872 KB Output is correct
90 Correct 53 ms 70880 KB Output is correct
91 Correct 41 ms 70700 KB Output is correct
92 Correct 38 ms 70724 KB Output is correct
93 Correct 58 ms 70776 KB Output is correct
94 Correct 54 ms 70864 KB Output is correct
95 Correct 51 ms 70784 KB Output is correct
96 Correct 54 ms 70852 KB Output is correct
97 Correct 52 ms 70804 KB Output is correct
98 Correct 35 ms 70732 KB Output is correct
99 Correct 266 ms 83252 KB Output is correct
100 Correct 260 ms 83284 KB Output is correct
101 Correct 216 ms 83272 KB Output is correct
102 Correct 237 ms 83236 KB Output is correct
103 Correct 260 ms 83280 KB Output is correct
104 Correct 202 ms 83276 KB Output is correct
105 Correct 37 ms 70728 KB Output is correct
106 Correct 155 ms 77900 KB Output is correct
107 Correct 266 ms 83368 KB Output is correct
108 Correct 213 ms 83244 KB Output is correct
109 Correct 235 ms 83192 KB Output is correct
110 Correct 258 ms 83196 KB Output is correct
111 Correct 204 ms 83372 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 70744 KB Output is correct
2 Correct 32 ms 70756 KB Output is correct
3 Correct 308 ms 80660 KB Output is correct
4 Correct 1509 ms 83380 KB Output is correct
5 Correct 1201 ms 76980 KB Output is correct
6 Correct 1495 ms 83272 KB Output is correct
7 Correct 1028 ms 79304 KB Output is correct
8 Correct 1497 ms 83224 KB Output is correct
9 Correct 32 ms 70728 KB Output is correct
10 Correct 35 ms 70640 KB Output is correct
11 Correct 33 ms 70748 KB Output is correct
12 Correct 34 ms 70696 KB Output is correct
13 Incorrect 40 ms 70760 KB Output isn't correct
14 Halted 0 ms 0 KB -