oj.uz

답안 #984423

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
984423 2024-05-16T15:57:07 Z shjeong 밀림 점프 (APIO21_jumps) C++17
48 / 100
 1043 ms 109248 KB 
#include "jumps.h"

#include <iostream>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <cstring>
#include <vector>
#include <string>
#include <climits>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <bitset>
#include <cassert>
#include <list>
using namespace std;
typedef long long ll;
vector<ll> v;
ll n;
ll L[202020][22];
ll R[202020][22];
ll M[202020][22];
void init(int N, std::vector<int> H) {
    n=N;
    v.resize(n+1,0);
    for(int i = 1 ; i <= n ; i++)v[i] = H[i-1];
    stack<ll> st;
    for(int i = 1 ; i <= n ; i++){
        while(st.size() and v[st.top()] < v[i]){
            M[st.top()][0] = R[st.top()][0] = i;
            st.pop();
        }
        st.push(i);
    }
    while(st.size())st.pop();
    for(int i = n ; i >= 1 ; i--){
        while(st.size() and v[st.top()] < v[i]){
            L[st.top()][0] = i;
            M[st.top()][0] = (v[i] > v[R[st.top()][0]] ? i : R[st.top()][0]);
            st.pop();
        }
        st.push(i);
    }
    for(int j = 1 ; j <= 20 ; j++){
        for(int i = 1 ; i <= n ; i++){
            L[i][j] = L[L[i][j-1]][j-1];
            R[i][j] = R[R[i][j-1]][j-1];
            M[i][j] = M[M[i][j-1]][j-1];
        }
    }
}

ll RMQ(ll l, ll r){
    ll ret = l;
    for(int i = 20 ; i >= 0 ; i--){
        if(R[ret][i]>0 and R[ret][i]<=r)ret = R[ret][i];
    }
    return v[ret];
}
int minimum_jumps(int A, int B, int C, int D) {
    A++; B++; C++; D++;
    ll H = RMQ(B,C-1);
    ll mx = RMQ(C,D);
    ll cur = B;
    for(int i = 20 ; i >= 0 ; i--){
        if(L[cur][i]>0 and L[cur][i]>=A and v[L[cur][i]]<=mx)cur = L[cur][i];
    }
    ll ret = 0;
    for(int i = 20 ; i >= 0 ; i--){
        if(M[cur][i]>0 and v[M[cur][i]]<H)cur = M[cur][i], ret += (1<<i);
    }
    if(0<M[cur][0] and v[M[cur][0]]<=mx)cur = M[cur][0], ret++;
    for(int i = 20 ; i >= 0 ; i--){
        if(R[cur][i]>0 and R[cur][i]<C)cur = R[cur][i], ret += (1<<i);
    }
    if(cur<C)cur = R[cur][0], ret++;
    return C <= cur and cur <= D ? ret : -1;
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2392 KB Output is correct
3 Correct 201 ms 91328 KB Output is correct
4 Correct 1043 ms 109228 KB Output is correct
5 Correct 882 ms 59220 KB Output is correct
6 Correct 1037 ms 109248 KB Output is correct
7 Correct 751 ms 78552 KB Output is correct
8 Correct 1008 ms 108984 KB Output is correct

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 0 ms 2392 KB Output is correct
5 Correct 2 ms 4440 KB Output is correct
6 Incorrect 2 ms 4440 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 0 ms 2392 KB Output is correct
5 Correct 2 ms 4440 KB Output is correct
6 Incorrect 2 ms 4440 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 89 ms 93416 KB Output is correct
6 Correct 109 ms 107580 KB Output is correct
7 Correct 60 ms 61496 KB Output is correct
8 Correct 108 ms 107560 KB Output is correct
9 Correct 10 ms 23636 KB Output is correct
10 Correct 107 ms 107448 KB Output is correct
11 Correct 122 ms 109024 KB Output is correct
12 Correct 117 ms 108780 KB Output is correct
13 Correct 117 ms 108512 KB Output is correct
14 Correct 107 ms 107448 KB Output is correct
15 Correct 120 ms 108220 KB Output is correct
16 Correct 109 ms 108996 KB Output is correct
17 Correct 108 ms 109000 KB Output is correct
18 Correct 1 ms 2392 KB Output is correct
19 Correct 1 ms 4440 KB Output is correct
20 Correct 1 ms 4440 KB Output is correct
21 Correct 1 ms 4440 KB Output is correct
22 Incorrect 1 ms 4440 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 199 ms 55384 KB Output is correct
5 Correct 737 ms 107608 KB Output is correct
6 Correct 445 ms 23640 KB Output is correct
7 Correct 760 ms 107580 KB Output is correct
8 Correct 389 ms 42724 KB Output is correct
9 Correct 740 ms 107584 KB Output is correct
10 Correct 934 ms 109236 KB Output is correct
11 Correct 851 ms 109044 KB Output is correct
12 Correct 897 ms 109004 KB Output is correct
13 Correct 753 ms 107584 KB Output is correct
14 Correct 855 ms 108228 KB Output is correct
15 Correct 725 ms 109236 KB Output is correct
16 Correct 765 ms 108988 KB Output is correct
17 Correct 1 ms 4440 KB Output is correct
18 Correct 1 ms 2392 KB Output is correct
19 Correct 1 ms 4440 KB Output is correct
20 Correct 1 ms 4440 KB Output is correct
21 Correct 2 ms 4440 KB Output is correct
22 Correct 2 ms 4440 KB Output is correct
23 Correct 2 ms 4440 KB Output is correct
24 Correct 2 ms 4440 KB Output is correct
25 Correct 1 ms 4440 KB Output is correct
26 Correct 1 ms 4440 KB Output is correct
27 Correct 11 ms 8792 KB Output is correct
28 Correct 11 ms 8792 KB Output is correct
29 Correct 11 ms 8792 KB Output is correct
30 Correct 10 ms 8792 KB Output is correct
31 Correct 10 ms 8792 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct
33 Correct 60 ms 67980 KB Output is correct
34 Correct 119 ms 107584 KB Output is correct
35 Correct 127 ms 108976 KB Output is correct
36 Correct 108 ms 107584 KB Output is correct
37 Correct 128 ms 108240 KB Output is correct
38 Correct 114 ms 109236 KB Output is correct

Subtask #6
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 199 ms 55384 KB Output is correct
5 Correct 737 ms 107608 KB Output is correct
6 Correct 445 ms 23640 KB Output is correct
7 Correct 760 ms 107580 KB Output is correct
8 Correct 389 ms 42724 KB Output is correct
9 Correct 740 ms 107584 KB Output is correct
10 Correct 934 ms 109236 KB Output is correct
11 Correct 851 ms 109044 KB Output is correct
12 Correct 897 ms 109004 KB Output is correct
13 Correct 753 ms 107584 KB Output is correct
14 Correct 855 ms 108228 KB Output is correct
15 Correct 725 ms 109236 KB Output is correct
16 Correct 765 ms 108988 KB Output is correct
17 Correct 1 ms 4440 KB Output is correct
18 Correct 1 ms 2392 KB Output is correct
19 Correct 1 ms 4440 KB Output is correct
20 Correct 1 ms 4440 KB Output is correct
21 Correct 2 ms 4440 KB Output is correct
22 Correct 2 ms 4440 KB Output is correct
23 Correct 2 ms 4440 KB Output is correct
24 Correct 2 ms 4440 KB Output is correct
25 Correct 1 ms 4440 KB Output is correct
26 Correct 1 ms 4440 KB Output is correct
27 Correct 11 ms 8792 KB Output is correct
28 Correct 11 ms 8792 KB Output is correct
29 Correct 11 ms 8792 KB Output is correct
30 Correct 10 ms 8792 KB Output is correct
31 Correct 10 ms 8792 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct
33 Correct 60 ms 67980 KB Output is correct
34 Correct 119 ms 107584 KB Output is correct
35 Correct 127 ms 108976 KB Output is correct
36 Correct 108 ms 107584 KB Output is correct
37 Correct 128 ms 108240 KB Output is correct
38 Correct 114 ms 109236 KB Output is correct
39 Correct 0 ms 2392 KB Output is correct
40 Correct 1 ms 2392 KB Output is correct
41 Correct 0 ms 2392 KB Output is correct
42 Correct 186 ms 55316 KB Output is correct
43 Correct 716 ms 107768 KB Output is correct
44 Correct 497 ms 23640 KB Output is correct
45 Correct 741 ms 107584 KB Output is correct
46 Correct 463 ms 42584 KB Output is correct
47 Correct 763 ms 107448 KB Output is correct
48 Correct 962 ms 109244 KB Output is correct
49 Correct 879 ms 109232 KB Output is correct
50 Correct 953 ms 109000 KB Output is correct
51 Correct 722 ms 107476 KB Output is correct
52 Correct 943 ms 108216 KB Output is correct
53 Correct 739 ms 109244 KB Output is correct
54 Correct 728 ms 109224 KB Output is correct
55 Correct 1 ms 2392 KB Output is correct
56 Correct 141 ms 107448 KB Output is correct
57 Correct 772 ms 107732 KB Output is correct
58 Correct 336 ms 23640 KB Output is correct
59 Correct 746 ms 107448 KB Output is correct
60 Correct 300 ms 42964 KB Output is correct
61 Correct 752 ms 107580 KB Output is correct
62 Correct 958 ms 109000 KB Output is correct
63 Correct 895 ms 108816 KB Output is correct
64 Correct 852 ms 108472 KB Output is correct
65 Correct 753 ms 107424 KB Output is correct
66 Correct 1012 ms 108244 KB Output is correct
67 Correct 816 ms 109240 KB Output is correct
68 Correct 835 ms 109000 KB Output is correct
69 Correct 0 ms 2392 KB Output is correct
70 Correct 1 ms 4440 KB Output is correct
71 Correct 2 ms 4440 KB Output is correct
72 Correct 2 ms 4440 KB Output is correct
73 Correct 1 ms 4440 KB Output is correct
74 Correct 2 ms 4440 KB Output is correct
75 Correct 2 ms 4440 KB Output is correct
76 Correct 1 ms 4440 KB Output is correct
77 Correct 1 ms 2392 KB Output is correct
78 Correct 1 ms 4440 KB Output is correct
79 Correct 2 ms 4440 KB Output is correct
80 Correct 1 ms 4440 KB Output is correct
81 Correct 1 ms 4436 KB Output is correct
82 Correct 2 ms 4440 KB Output is correct
83 Correct 2 ms 4440 KB Output is correct
84 Correct 1 ms 4440 KB Output is correct
85 Correct 2 ms 4440 KB Output is correct
86 Correct 11 ms 8792 KB Output is correct
87 Correct 10 ms 8792 KB Output is correct
88 Correct 11 ms 8792 KB Output is correct
89 Correct 13 ms 8792 KB Output is correct
90 Correct 14 ms 7000 KB Output is correct
91 Correct 1 ms 4440 KB Output is correct
92 Correct 1 ms 4440 KB Output is correct
93 Correct 10 ms 8792 KB Output is correct
94 Correct 11 ms 8792 KB Output is correct
95 Correct 9 ms 8792 KB Output is correct
96 Correct 10 ms 8792 KB Output is correct
97 Correct 10 ms 8792 KB Output is correct
98 Correct 0 ms 2392 KB Output is correct
99 Correct 115 ms 107284 KB Output is correct
100 Correct 108 ms 107452 KB Output is correct
101 Correct 119 ms 108748 KB Output is correct
102 Correct 107 ms 107580 KB Output is correct
103 Correct 124 ms 108404 KB Output is correct
104 Correct 113 ms 109232 KB Output is correct
105 Correct 1 ms 2392 KB Output is correct
106 Correct 62 ms 68260 KB Output is correct
107 Correct 110 ms 107576 KB Output is correct
108 Correct 125 ms 108984 KB Output is correct
109 Correct 103 ms 107548 KB Output is correct
110 Correct 124 ms 108220 KB Output is correct
111 Correct 113 ms 108996 KB Output is correct

Subtask #7
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2392 KB Output is correct
3 Correct 201 ms 91328 KB Output is correct
4 Correct 1043 ms 109228 KB Output is correct
5 Correct 882 ms 59220 KB Output is correct
6 Correct 1037 ms 109248 KB Output is correct
7 Correct 751 ms 78552 KB Output is correct
8 Correct 1008 ms 108984 KB Output is correct
9 Correct 1 ms 4440 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 0 ms 2392 KB Output is correct
13 Correct 2 ms 4440 KB Output is correct
14 Incorrect 2 ms 4440 KB Output isn't correct
15 Halted 0 ms 0 KB -