oj.uz

답안 #561987

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
561987 2022-05-14T03:08:11 Z ian2024 밀림 점프 (APIO21_jumps) C++14
48 / 100
 1127 ms 69292 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 and le[curr][i] < h[C]) 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 56656 KB Output is correct
2 Correct 27 ms 56648 KB Output is correct
3 Correct 249 ms 66552 KB Output is correct
4 Correct 1082 ms 69268 KB Output is correct
5 Correct 900 ms 63036 KB Output is correct
6 Correct 980 ms 69188 KB Output is correct
7 Correct 861 ms 65196 KB Output is correct
8 Correct 762 ms 69064 KB Output is correct

Subtask #2
0 / 8.0

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

Subtask #3
0 / 13.0

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

Subtask #4
0 / 12.0

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

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 56604 KB Output is correct
2 Correct 32 ms 56668 KB Output is correct
3 Correct 27 ms 56568 KB Output is correct
4 Correct 304 ms 62292 KB Output is correct
5 Correct 798 ms 69248 KB Output is correct
6 Correct 614 ms 58628 KB Output is correct
7 Correct 868 ms 69096 KB Output is correct
8 Correct 572 ms 60868 KB Output is correct
9 Correct 880 ms 69272 KB Output is correct
10 Correct 929 ms 69144 KB Output is correct
11 Correct 1097 ms 69188 KB Output is correct
12 Correct 1032 ms 69064 KB Output is correct
13 Correct 928 ms 69160 KB Output is correct
14 Correct 1127 ms 69184 KB Output is correct
15 Correct 860 ms 69164 KB Output is correct
16 Correct 968 ms 69188 KB Output is correct
17 Correct 29 ms 56568 KB Output is correct
18 Correct 26 ms 56648 KB Output is correct
19 Correct 28 ms 56648 KB Output is correct
20 Correct 31 ms 56656 KB Output is correct
21 Correct 29 ms 56612 KB Output is correct
22 Correct 28 ms 56644 KB Output is correct
23 Correct 31 ms 56620 KB Output is correct
24 Correct 28 ms 56672 KB Output is correct
25 Correct 28 ms 56608 KB Output is correct
26 Correct 30 ms 56640 KB Output is correct
27 Correct 52 ms 56708 KB Output is correct
28 Correct 45 ms 56672 KB Output is correct
29 Correct 35 ms 56780 KB Output is correct
30 Correct 46 ms 56784 KB Output is correct
31 Correct 40 ms 56752 KB Output is correct
32 Correct 26 ms 56656 KB Output is correct
33 Correct 133 ms 63924 KB Output is correct
34 Correct 235 ms 69184 KB Output is correct
35 Correct 187 ms 69168 KB Output is correct
36 Correct 200 ms 69192 KB Output is correct
37 Correct 224 ms 69160 KB Output is correct
38 Correct 197 ms 69280 KB Output is correct

Subtask #6
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 56604 KB Output is correct
2 Correct 32 ms 56668 KB Output is correct
3 Correct 27 ms 56568 KB Output is correct
4 Correct 304 ms 62292 KB Output is correct
5 Correct 798 ms 69248 KB Output is correct
6 Correct 614 ms 58628 KB Output is correct
7 Correct 868 ms 69096 KB Output is correct
8 Correct 572 ms 60868 KB Output is correct
9 Correct 880 ms 69272 KB Output is correct
10 Correct 929 ms 69144 KB Output is correct
11 Correct 1097 ms 69188 KB Output is correct
12 Correct 1032 ms 69064 KB Output is correct
13 Correct 928 ms 69160 KB Output is correct
14 Correct 1127 ms 69184 KB Output is correct
15 Correct 860 ms 69164 KB Output is correct
16 Correct 968 ms 69188 KB Output is correct
17 Correct 29 ms 56568 KB Output is correct
18 Correct 26 ms 56648 KB Output is correct
19 Correct 28 ms 56648 KB Output is correct
20 Correct 31 ms 56656 KB Output is correct
21 Correct 29 ms 56612 KB Output is correct
22 Correct 28 ms 56644 KB Output is correct
23 Correct 31 ms 56620 KB Output is correct
24 Correct 28 ms 56672 KB Output is correct
25 Correct 28 ms 56608 KB Output is correct
26 Correct 30 ms 56640 KB Output is correct
27 Correct 52 ms 56708 KB Output is correct
28 Correct 45 ms 56672 KB Output is correct
29 Correct 35 ms 56780 KB Output is correct
30 Correct 46 ms 56784 KB Output is correct
31 Correct 40 ms 56752 KB Output is correct
32 Correct 26 ms 56656 KB Output is correct
33 Correct 133 ms 63924 KB Output is correct
34 Correct 235 ms 69184 KB Output is correct
35 Correct 187 ms 69168 KB Output is correct
36 Correct 200 ms 69192 KB Output is correct
37 Correct 224 ms 69160 KB Output is correct
38 Correct 197 ms 69280 KB Output is correct
39 Correct 27 ms 56640 KB Output is correct
40 Correct 26 ms 56612 KB Output is correct
41 Correct 31 ms 56704 KB Output is correct
42 Correct 318 ms 62396 KB Output is correct
43 Correct 1024 ms 69064 KB Output is correct
44 Correct 555 ms 58824 KB Output is correct
45 Correct 1044 ms 69064 KB Output is correct
46 Correct 509 ms 61000 KB Output is correct
47 Correct 1055 ms 69084 KB Output is correct
48 Correct 1083 ms 69112 KB Output is correct
49 Correct 1068 ms 69188 KB Output is correct
50 Correct 996 ms 69068 KB Output is correct
51 Correct 865 ms 69064 KB Output is correct
52 Correct 902 ms 69132 KB Output is correct
53 Correct 972 ms 69180 KB Output is correct
54 Correct 1010 ms 69160 KB Output is correct
55 Correct 27 ms 56648 KB Output is correct
56 Correct 272 ms 69196 KB Output is correct
57 Correct 867 ms 69064 KB Output is correct
58 Correct 488 ms 58864 KB Output is correct
59 Correct 948 ms 69192 KB Output is correct
60 Correct 421 ms 61116 KB Output is correct
61 Correct 948 ms 69184 KB Output is correct
62 Correct 1098 ms 69292 KB Output is correct
63 Correct 1059 ms 69280 KB Output is correct
64 Correct 952 ms 69188 KB Output is correct
65 Correct 823 ms 69160 KB Output is correct
66 Correct 926 ms 69204 KB Output is correct
67 Correct 1000 ms 69184 KB Output is correct
68 Correct 995 ms 69180 KB Output is correct
69 Correct 31 ms 56540 KB Output is correct
70 Correct 28 ms 56624 KB Output is correct
71 Correct 35 ms 56656 KB Output is correct
72 Correct 29 ms 56648 KB Output is correct
73 Correct 28 ms 56640 KB Output is correct
74 Correct 28 ms 56656 KB Output is correct
75 Correct 29 ms 56648 KB Output is correct
76 Correct 26 ms 56656 KB Output is correct
77 Correct 27 ms 56656 KB Output is correct
78 Correct 28 ms 56576 KB Output is correct
79 Correct 29 ms 56616 KB Output is correct
80 Correct 30 ms 56656 KB Output is correct
81 Correct 29 ms 56596 KB Output is correct
82 Correct 30 ms 56656 KB Output is correct
83 Correct 30 ms 56664 KB Output is correct
84 Correct 32 ms 56648 KB Output is correct
85 Correct 32 ms 56620 KB Output is correct
86 Correct 47 ms 56760 KB Output is correct
87 Correct 47 ms 56656 KB Output is correct
88 Correct 48 ms 56684 KB Output is correct
89 Correct 50 ms 56704 KB Output is correct
90 Correct 43 ms 56736 KB Output is correct
91 Correct 28 ms 56748 KB Output is correct
92 Correct 27 ms 56648 KB Output is correct
93 Correct 44 ms 56696 KB Output is correct
94 Correct 45 ms 56768 KB Output is correct
95 Correct 48 ms 56776 KB Output is correct
96 Correct 45 ms 56680 KB Output is correct
97 Correct 44 ms 56660 KB Output is correct
98 Correct 28 ms 56580 KB Output is correct
99 Correct 251 ms 69168 KB Output is correct
100 Correct 245 ms 69176 KB Output is correct
101 Correct 212 ms 69292 KB Output is correct
102 Correct 218 ms 69192 KB Output is correct
103 Correct 224 ms 69064 KB Output is correct
104 Correct 190 ms 69220 KB Output is correct
105 Correct 27 ms 56648 KB Output is correct
106 Correct 131 ms 63860 KB Output is correct
107 Correct 240 ms 69184 KB Output is correct
108 Correct 186 ms 69288 KB Output is correct
109 Correct 207 ms 69212 KB Output is correct
110 Correct 218 ms 69168 KB Output is correct
111 Correct 191 ms 69184 KB Output is correct

Subtask #7
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 56656 KB Output is correct
2 Correct 27 ms 56648 KB Output is correct
3 Correct 249 ms 66552 KB Output is correct
4 Correct 1082 ms 69268 KB Output is correct
5 Correct 900 ms 63036 KB Output is correct
6 Correct 980 ms 69188 KB Output is correct
7 Correct 861 ms 65196 KB Output is correct
8 Correct 762 ms 69064 KB Output is correct
9 Incorrect 26 ms 56608 KB Output isn't correct
10 Halted 0 ms 0 KB -