oj.uz

답안 #979703

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
979703 2024-05-11T10:08:58 Z nnin 밀림 점프 (APIO21_jumps) C++14
48 / 100
 819 ms 42920 KB 
#include "jumps.h"
#include <bits/stdc++.h>
#define pii pair<int,int>
using namespace std;

int n, l[200005], r[200005], jump[200005][20], jump2[200005][20];
vector<int> h;

struct segTree {
  pii seg[4*200005];

  void build(int i, int l, int r) {
    if(l==r) {
      seg[i] = {h[l], l};
      return;
    }
    int m = (l+r)/2;
    build(i*2+1, l, m);
    build(i*2+2, m+1, r);
    seg[i] = max(seg[i*2+1], seg[i*2+2]);
  }

  pii query(int i, int l, int r, int wl, int wr) {
    if(wl>r || wr<l) return {-2e9, -1};
    if(wl<=l && wr>=r) return seg[i];
    int m = (l+r)/2;
    return max(query(i*2+1, l, m, wl, wr), query(i*2+2, m+1, r, wl, wr));
  }
}t;

void init(int N, std::vector<int> H) {
  n = N;
  h = H;
  stack<int> st;
  for(int i=0;i<n;i++) {
    while(!st.empty() && H[st.top()]<H[i]) st.pop();
    if(st.empty()) l[i] = -1;
    else l[i] = st.top();
    st.push(i);
  }
  while(!st.empty()) st.pop();
  for(int i=n-1;i>=0;i--) {
    while(!st.empty() && H[st.top()]<H[i]) st.pop();
    if(st.empty()) r[i] = n;
    else r[i] = st.top();
    st.push(i);
  }
  t.build(0, 0, n-1);
  h.push_back(n+1);
  for(int i=0;i<n;i++) {
    int mx = l[i], mx2 = r[i];
    if(mx==-1) mx = n;
    if(h[mx]<h[mx2]) swap(mx, mx2);
    jump[i][0] = mx;
    jump2[i][0] = mx2;
  }
  jump[n][0] = jump2[n][0] = n;
  for(int j=1;j<20;j++) for(int i=0;i<=n;i++) jump[i][j] = jump[jump[i][j-1]][j-1];
  for(int j=1;j<20;j++) for(int i=0;i<=n;i++) jump2[i][j] = jump2[jump2[i][j-1]][j-1];
}

int minimum_jumps(int A, int B, int C, int D) {
  A = t.query(0, 0, n-1, max(A, l[C]+1), min(B, r[C]-1)).second;
  if(A==-1) return -1;
  int ans = 0;
  for(int i=19;i>=0;i--) if(h[jump[A][i]]<h[C]) {
    A = jump[A][i];
    ans += (1<<i);
  }
  if(jump[A][0]==C) return ans+1;
  for(int i=19;i>=0;i--) if(h[jump2[A][i]]<h[C]) {
    A = jump2[A][i];
    ans += (1<<i);
  }
  if(jump2[A][0]==C) return ans+1;
  return -1;
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6488 KB Output is correct
3 Correct 103 ms 39920 KB Output is correct
4 Correct 794 ms 42568 KB Output is correct
5 Correct 659 ms 26796 KB Output is correct
6 Correct 772 ms 42744 KB Output is correct
7 Correct 656 ms 35504 KB Output is correct
8 Correct 807 ms 42672 KB Output is correct

Subtask #2
0 / 8.0

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

Subtask #3
0 / 13.0

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

Subtask #4
0 / 12.0

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

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6488 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 148 ms 26292 KB Output is correct
5 Correct 618 ms 41876 KB Output is correct
6 Correct 394 ms 15316 KB Output is correct
7 Correct 628 ms 41904 KB Output is correct
8 Correct 363 ms 21832 KB Output is correct
9 Correct 598 ms 42052 KB Output is correct
10 Correct 748 ms 42568 KB Output is correct
11 Correct 748 ms 42664 KB Output is correct
12 Correct 718 ms 42392 KB Output is correct
13 Correct 596 ms 41792 KB Output is correct
14 Correct 719 ms 42112 KB Output is correct
15 Correct 611 ms 42920 KB Output is correct
16 Correct 568 ms 42704 KB Output is correct
17 Correct 1 ms 6488 KB Output is correct
18 Correct 1 ms 6488 KB Output is correct
19 Correct 1 ms 6740 KB Output is correct
20 Correct 2 ms 6488 KB Output is correct
21 Correct 2 ms 6488 KB Output is correct
22 Correct 2 ms 6488 KB Output is correct
23 Correct 2 ms 6488 KB Output is correct
24 Correct 2 ms 6488 KB Output is correct
25 Correct 1 ms 6488 KB Output is correct
26 Correct 1 ms 6488 KB Output is correct
27 Correct 14 ms 8536 KB Output is correct
28 Correct 9 ms 8536 KB Output is correct
29 Correct 9 ms 8536 KB Output is correct
30 Correct 9 ms 8608 KB Output is correct
31 Correct 9 ms 8536 KB Output is correct
32 Correct 1 ms 6488 KB Output is correct
33 Correct 25 ms 30700 KB Output is correct
34 Correct 55 ms 41900 KB Output is correct
35 Correct 50 ms 42392 KB Output is correct
36 Correct 55 ms 42036 KB Output is correct
37 Correct 57 ms 42280 KB Output is correct
38 Correct 56 ms 42764 KB Output is correct

Subtask #6
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6488 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 148 ms 26292 KB Output is correct
5 Correct 618 ms 41876 KB Output is correct
6 Correct 394 ms 15316 KB Output is correct
7 Correct 628 ms 41904 KB Output is correct
8 Correct 363 ms 21832 KB Output is correct
9 Correct 598 ms 42052 KB Output is correct
10 Correct 748 ms 42568 KB Output is correct
11 Correct 748 ms 42664 KB Output is correct
12 Correct 718 ms 42392 KB Output is correct
13 Correct 596 ms 41792 KB Output is correct
14 Correct 719 ms 42112 KB Output is correct
15 Correct 611 ms 42920 KB Output is correct
16 Correct 568 ms 42704 KB Output is correct
17 Correct 1 ms 6488 KB Output is correct
18 Correct 1 ms 6488 KB Output is correct
19 Correct 1 ms 6740 KB Output is correct
20 Correct 2 ms 6488 KB Output is correct
21 Correct 2 ms 6488 KB Output is correct
22 Correct 2 ms 6488 KB Output is correct
23 Correct 2 ms 6488 KB Output is correct
24 Correct 2 ms 6488 KB Output is correct
25 Correct 1 ms 6488 KB Output is correct
26 Correct 1 ms 6488 KB Output is correct
27 Correct 14 ms 8536 KB Output is correct
28 Correct 9 ms 8536 KB Output is correct
29 Correct 9 ms 8536 KB Output is correct
30 Correct 9 ms 8608 KB Output is correct
31 Correct 9 ms 8536 KB Output is correct
32 Correct 1 ms 6488 KB Output is correct
33 Correct 25 ms 30700 KB Output is correct
34 Correct 55 ms 41900 KB Output is correct
35 Correct 50 ms 42392 KB Output is correct
36 Correct 55 ms 42036 KB Output is correct
37 Correct 57 ms 42280 KB Output is correct
38 Correct 56 ms 42764 KB Output is correct
39 Correct 1 ms 6488 KB Output is correct
40 Correct 1 ms 6488 KB Output is correct
41 Correct 1 ms 6488 KB Output is correct
42 Correct 141 ms 26032 KB Output is correct
43 Correct 600 ms 41892 KB Output is correct
44 Correct 374 ms 15280 KB Output is correct
45 Correct 678 ms 41792 KB Output is correct
46 Correct 317 ms 21832 KB Output is correct
47 Correct 613 ms 42048 KB Output is correct
48 Correct 735 ms 42568 KB Output is correct
49 Correct 749 ms 42680 KB Output is correct
50 Correct 722 ms 42392 KB Output is correct
51 Correct 603 ms 41912 KB Output is correct
52 Correct 739 ms 42108 KB Output is correct
53 Correct 638 ms 42764 KB Output is correct
54 Correct 609 ms 42672 KB Output is correct
55 Correct 1 ms 6488 KB Output is correct
56 Correct 87 ms 41896 KB Output is correct
57 Correct 590 ms 41884 KB Output is correct
58 Correct 345 ms 15308 KB Output is correct
59 Correct 623 ms 41904 KB Output is correct
60 Correct 234 ms 21940 KB Output is correct
61 Correct 584 ms 41908 KB Output is correct
62 Correct 819 ms 42660 KB Output is correct
63 Correct 708 ms 42396 KB Output is correct
64 Correct 748 ms 42456 KB Output is correct
65 Correct 581 ms 41908 KB Output is correct
66 Correct 707 ms 42296 KB Output is correct
67 Correct 667 ms 42760 KB Output is correct
68 Correct 603 ms 42668 KB Output is correct
69 Correct 1 ms 6488 KB Output is correct
70 Correct 1 ms 6488 KB Output is correct
71 Correct 2 ms 6488 KB Output is correct
72 Correct 2 ms 6488 KB Output is correct
73 Correct 2 ms 6488 KB Output is correct
74 Correct 2 ms 6488 KB Output is correct
75 Correct 2 ms 6488 KB Output is correct
76 Correct 1 ms 6488 KB Output is correct
77 Correct 1 ms 6488 KB Output is correct
78 Correct 1 ms 6488 KB Output is correct
79 Correct 2 ms 6488 KB Output is correct
80 Correct 2 ms 6488 KB Output is correct
81 Correct 2 ms 6488 KB Output is correct
82 Correct 2 ms 6488 KB Output is correct
83 Correct 2 ms 6488 KB Output is correct
84 Correct 1 ms 6488 KB Output is correct
85 Correct 2 ms 6488 KB Output is correct
86 Correct 10 ms 8536 KB Output is correct
87 Correct 12 ms 8536 KB Output is correct
88 Correct 9 ms 8536 KB Output is correct
89 Correct 11 ms 8536 KB Output is correct
90 Correct 13 ms 8536 KB Output is correct
91 Correct 1 ms 6496 KB Output is correct
92 Correct 1 ms 6488 KB Output is correct
93 Correct 9 ms 8536 KB Output is correct
94 Correct 10 ms 8536 KB Output is correct
95 Correct 9 ms 8536 KB Output is correct
96 Correct 9 ms 8536 KB Output is correct
97 Correct 10 ms 8536 KB Output is correct
98 Correct 1 ms 6488 KB Output is correct
99 Correct 54 ms 42172 KB Output is correct
100 Correct 55 ms 42088 KB Output is correct
101 Correct 51 ms 42568 KB Output is correct
102 Correct 56 ms 41896 KB Output is correct
103 Correct 64 ms 42296 KB Output is correct
104 Correct 50 ms 42660 KB Output is correct
105 Correct 1 ms 6488 KB Output is correct
106 Correct 26 ms 30668 KB Output is correct
107 Correct 58 ms 41908 KB Output is correct
108 Correct 47 ms 42412 KB Output is correct
109 Correct 59 ms 41916 KB Output is correct
110 Correct 52 ms 42100 KB Output is correct
111 Correct 57 ms 42648 KB Output is correct

Subtask #7
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6488 KB Output is correct
3 Correct 103 ms 39920 KB Output is correct
4 Correct 794 ms 42568 KB Output is correct
5 Correct 659 ms 26796 KB Output is correct
6 Correct 772 ms 42744 KB Output is correct
7 Correct 656 ms 35504 KB Output is correct
8 Correct 807 ms 42672 KB Output is correct
9 Incorrect 1 ms 6488 KB Output isn't correct
10 Halted 0 ms 0 KB -