oj.uz

Submission #561347

# Submission time Handle Problem Language Result Execution time Memory
561347 2022-05-12T16:38:33 Z ian2024 Rainforest Jumps (APIO21_jumps) C++14
23 / 100
 1113 ms 41064 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];
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;
    }
  }

  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--;
      lo[i][0] = H[*l];
    }
    auto r = s.upper_bound(pos[i]);
    if (r != s.end()) hi[i][0] = H[*r];
    if (hi[i][0] < lo[i][0]) {
      swap(hi[i][0], lo[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];
    }
  }
}

int minimum_jumps(int A, int B, int C, int D) {
  int jumps = 0;
  int curr = h[A];
  for (int i = 17; i >= 0; --i) {
    if (hi[curr][i] <= h[C]) {
      curr = hi[curr][i];
      jumps += (1 << i);
    }
  }

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

  if (curr != h[C]) return -1;
  return jumps;
}

#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
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 28368 KB Output is correct
2 Correct 18 ms 28432 KB Output is correct
3 Incorrect 228 ms 38400 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 28452 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 28452 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 14 ms 28368 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 15 ms 28368 KB Output is correct
2 Correct 16 ms 28432 KB Output is correct
3 Correct 15 ms 28368 KB Output is correct
4 Correct 335 ms 34088 KB Output is correct
5 Correct 1113 ms 41000 KB Output is correct
6 Correct 644 ms 30536 KB Output is correct
7 Correct 878 ms 40996 KB Output is correct
8 Correct 483 ms 32784 KB Output is correct
9 Correct 819 ms 41008 KB Output is correct
10 Correct 1047 ms 40992 KB Output is correct
11 Correct 1006 ms 40868 KB Output is correct
12 Correct 985 ms 40872 KB Output is correct
13 Correct 818 ms 41036 KB Output is correct
14 Correct 1073 ms 40888 KB Output is correct
15 Correct 947 ms 40920 KB Output is correct
16 Correct 915 ms 40996 KB Output is correct
17 Correct 15 ms 28368 KB Output is correct
18 Correct 18 ms 28404 KB Output is correct
19 Correct 16 ms 28460 KB Output is correct
20 Correct 15 ms 28496 KB Output is correct
21 Correct 16 ms 28408 KB Output is correct
22 Correct 18 ms 28420 KB Output is correct
23 Correct 16 ms 28496 KB Output is correct
24 Correct 16 ms 28496 KB Output is correct
25 Correct 15 ms 28496 KB Output is correct
26 Correct 16 ms 28460 KB Output is correct
27 Correct 32 ms 28496 KB Output is correct
28 Correct 33 ms 28496 KB Output is correct
29 Correct 26 ms 28528 KB Output is correct
30 Correct 31 ms 28496 KB Output is correct
31 Correct 31 ms 28592 KB Output is correct
32 Correct 17 ms 28368 KB Output is correct
33 Correct 123 ms 35728 KB Output is correct
34 Correct 217 ms 40996 KB Output is correct
35 Correct 146 ms 40932 KB Output is correct
36 Correct 171 ms 40872 KB Output is correct
37 Correct 163 ms 40996 KB Output is correct
38 Correct 165 ms 40992 KB Output is correct

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 28368 KB Output is correct
2 Correct 16 ms 28432 KB Output is correct
3 Correct 15 ms 28368 KB Output is correct
4 Correct 335 ms 34088 KB Output is correct
5 Correct 1113 ms 41000 KB Output is correct
6 Correct 644 ms 30536 KB Output is correct
7 Correct 878 ms 40996 KB Output is correct
8 Correct 483 ms 32784 KB Output is correct
9 Correct 819 ms 41008 KB Output is correct
10 Correct 1047 ms 40992 KB Output is correct
11 Correct 1006 ms 40868 KB Output is correct
12 Correct 985 ms 40872 KB Output is correct
13 Correct 818 ms 41036 KB Output is correct
14 Correct 1073 ms 40888 KB Output is correct
15 Correct 947 ms 40920 KB Output is correct
16 Correct 915 ms 40996 KB Output is correct
17 Correct 15 ms 28368 KB Output is correct
18 Correct 18 ms 28404 KB Output is correct
19 Correct 16 ms 28460 KB Output is correct
20 Correct 15 ms 28496 KB Output is correct
21 Correct 16 ms 28408 KB Output is correct
22 Correct 18 ms 28420 KB Output is correct
23 Correct 16 ms 28496 KB Output is correct
24 Correct 16 ms 28496 KB Output is correct
25 Correct 15 ms 28496 KB Output is correct
26 Correct 16 ms 28460 KB Output is correct
27 Correct 32 ms 28496 KB Output is correct
28 Correct 33 ms 28496 KB Output is correct
29 Correct 26 ms 28528 KB Output is correct
30 Correct 31 ms 28496 KB Output is correct
31 Correct 31 ms 28592 KB Output is correct
32 Correct 17 ms 28368 KB Output is correct
33 Correct 123 ms 35728 KB Output is correct
34 Correct 217 ms 40996 KB Output is correct
35 Correct 146 ms 40932 KB Output is correct
36 Correct 171 ms 40872 KB Output is correct
37 Correct 163 ms 40996 KB Output is correct
38 Correct 165 ms 40992 KB Output is correct
39 Correct 15 ms 28464 KB Output is correct
40 Correct 14 ms 28368 KB Output is correct
41 Correct 14 ms 28464 KB Output is correct
42 Correct 292 ms 34168 KB Output is correct
43 Correct 1008 ms 41008 KB Output is correct
44 Correct 559 ms 30536 KB Output is correct
45 Correct 1074 ms 40904 KB Output is correct
46 Correct 550 ms 32712 KB Output is correct
47 Correct 1036 ms 40888 KB Output is correct
48 Correct 906 ms 40996 KB Output is correct
49 Correct 734 ms 40996 KB Output is correct
50 Correct 1020 ms 41064 KB Output is correct
51 Correct 937 ms 40996 KB Output is correct
52 Correct 812 ms 40904 KB Output is correct
53 Correct 886 ms 40996 KB Output is correct
54 Correct 745 ms 41004 KB Output is correct
55 Correct 14 ms 28496 KB Output is correct
56 Incorrect 247 ms 40924 KB Output isn't correct
57 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 28368 KB Output is correct
2 Correct 18 ms 28432 KB Output is correct
3 Incorrect 228 ms 38400 KB Output isn't correct
4 Halted 0 ms 0 KB -