oj.uz

답안 #561979

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
561979 2022-05-14T02:52:04 Z ian2024 밀림 점프 (APIO21_jumps) C++14
27 / 100
 1120 ms 69220 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];
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;
    }
  }

  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];
    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];
    }
  }
}

int minimum_jumps(int A, int B, int C, int D) {
  int jumps = 0;
  int curr = h[B];
  for (int i = 17; i >= 0; --i) {
  	if (le[curr][i] != INF and pos[le[curr][i]] >= A) curr = le[curr][i];
  }
  
  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
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 56644 KB Output is correct
2 Correct 27 ms 56676 KB Output is correct
3 Correct 225 ms 66604 KB Output is correct
4 Correct 861 ms 69184 KB Output is correct
5 Correct 839 ms 62856 KB Output is correct
6 Correct 729 ms 69188 KB Output is correct
7 Correct 768 ms 65200 KB Output is correct
8 Correct 1016 ms 69164 KB Output is correct

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 29 ms 56588 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 29 ms 56588 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 27 ms 56604 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 56544 KB Output is correct
2 Correct 32 ms 56656 KB Output is correct
3 Correct 30 ms 56600 KB Output is correct
4 Correct 251 ms 62280 KB Output is correct
5 Correct 906 ms 69112 KB Output is correct
6 Correct 575 ms 58716 KB Output is correct
7 Correct 960 ms 69168 KB Output is correct
8 Correct 578 ms 60876 KB Output is correct
9 Correct 898 ms 69188 KB Output is correct
10 Correct 1035 ms 69064 KB Output is correct
11 Correct 1071 ms 69064 KB Output is correct
12 Correct 971 ms 69160 KB Output is correct
13 Correct 938 ms 69064 KB Output is correct
14 Correct 1120 ms 69164 KB Output is correct
15 Correct 1068 ms 69164 KB Output is correct
16 Correct 1092 ms 69064 KB Output is correct
17 Correct 27 ms 56656 KB Output is correct
18 Correct 27 ms 56564 KB Output is correct
19 Correct 28 ms 56648 KB Output is correct
20 Correct 29 ms 56564 KB Output is correct
21 Correct 28 ms 56584 KB Output is correct
22 Correct 29 ms 56656 KB Output is correct
23 Correct 29 ms 56560 KB Output is correct
24 Correct 28 ms 56656 KB Output is correct
25 Correct 26 ms 56540 KB Output is correct
26 Correct 29 ms 56708 KB Output is correct
27 Correct 46 ms 56688 KB Output is correct
28 Correct 50 ms 56784 KB Output is correct
29 Correct 45 ms 56776 KB Output is correct
30 Correct 46 ms 56784 KB Output is correct
31 Correct 45 ms 56676 KB Output is correct
32 Correct 27 ms 56584 KB Output is correct
33 Correct 141 ms 63816 KB Output is correct
34 Correct 240 ms 69164 KB Output is correct
35 Correct 203 ms 69164 KB Output is correct
36 Correct 205 ms 69184 KB Output is correct
37 Correct 221 ms 69184 KB Output is correct
38 Correct 187 ms 69184 KB Output is correct

Subtask #6
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 56544 KB Output is correct
2 Correct 32 ms 56656 KB Output is correct
3 Correct 30 ms 56600 KB Output is correct
4 Correct 251 ms 62280 KB Output is correct
5 Correct 906 ms 69112 KB Output is correct
6 Correct 575 ms 58716 KB Output is correct
7 Correct 960 ms 69168 KB Output is correct
8 Correct 578 ms 60876 KB Output is correct
9 Correct 898 ms 69188 KB Output is correct
10 Correct 1035 ms 69064 KB Output is correct
11 Correct 1071 ms 69064 KB Output is correct
12 Correct 971 ms 69160 KB Output is correct
13 Correct 938 ms 69064 KB Output is correct
14 Correct 1120 ms 69164 KB Output is correct
15 Correct 1068 ms 69164 KB Output is correct
16 Correct 1092 ms 69064 KB Output is correct
17 Correct 27 ms 56656 KB Output is correct
18 Correct 27 ms 56564 KB Output is correct
19 Correct 28 ms 56648 KB Output is correct
20 Correct 29 ms 56564 KB Output is correct
21 Correct 28 ms 56584 KB Output is correct
22 Correct 29 ms 56656 KB Output is correct
23 Correct 29 ms 56560 KB Output is correct
24 Correct 28 ms 56656 KB Output is correct
25 Correct 26 ms 56540 KB Output is correct
26 Correct 29 ms 56708 KB Output is correct
27 Correct 46 ms 56688 KB Output is correct
28 Correct 50 ms 56784 KB Output is correct
29 Correct 45 ms 56776 KB Output is correct
30 Correct 46 ms 56784 KB Output is correct
31 Correct 45 ms 56676 KB Output is correct
32 Correct 27 ms 56584 KB Output is correct
33 Correct 141 ms 63816 KB Output is correct
34 Correct 240 ms 69164 KB Output is correct
35 Correct 203 ms 69164 KB Output is correct
36 Correct 205 ms 69184 KB Output is correct
37 Correct 221 ms 69184 KB Output is correct
38 Correct 187 ms 69184 KB Output is correct
39 Correct 28 ms 56648 KB Output is correct
40 Correct 28 ms 56616 KB Output is correct
41 Correct 27 ms 56604 KB Output is correct
42 Correct 288 ms 62368 KB Output is correct
43 Correct 1052 ms 69116 KB Output is correct
44 Correct 476 ms 58696 KB Output is correct
45 Correct 843 ms 69180 KB Output is correct
46 Correct 581 ms 61024 KB Output is correct
47 Correct 978 ms 69064 KB Output is correct
48 Correct 969 ms 69220 KB Output is correct
49 Correct 1042 ms 69188 KB Output is correct
50 Correct 885 ms 69060 KB Output is correct
51 Correct 1063 ms 69104 KB Output is correct
52 Correct 997 ms 69192 KB Output is correct
53 Correct 895 ms 69176 KB Output is correct
54 Correct 1016 ms 69108 KB Output is correct
55 Correct 27 ms 56656 KB Output is correct
56 Incorrect 291 ms 69020 KB Output isn't correct
57 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 56644 KB Output is correct
2 Correct 27 ms 56676 KB Output is correct
3 Correct 225 ms 66604 KB Output is correct
4 Correct 861 ms 69184 KB Output is correct
5 Correct 839 ms 62856 KB Output is correct
6 Correct 729 ms 69188 KB Output is correct
7 Correct 768 ms 65200 KB Output is correct
8 Correct 1016 ms 69164 KB Output is correct
9 Incorrect 29 ms 56588 KB Output isn't correct
10 Halted 0 ms 0 KB -