oj.uz

답안 #984448

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
984448 2024-05-16T16:48:41 Z shjeong 밀림 점프 (APIO21_jumps) C++17
48 / 100
 1078 ms 109308 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(v[cur] == H)return (C <= R[cur][0] and R[cur][0] <= D ? ret+1 : -1);
    if(0<M[cur][0] and v[M[cur][0]]<mx){
        cur = M[cur][0], ret++;
        return (C <= R[cur][0] and R[cur][0] <= D ? ret+1 : -1);
    }
    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 1 ms 2392 KB Output is correct
3 Correct 193 ms 91204 KB Output is correct
4 Correct 1066 ms 109000 KB Output is correct
5 Correct 830 ms 59204 KB Output is correct
6 Correct 1044 ms 109140 KB Output is correct
7 Correct 820 ms 78540 KB Output is correct
8 Correct 1078 ms 108988 KB Output is correct

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 0 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 Incorrect 1 ms 4440 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 0 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 Incorrect 1 ms 4440 KB Output isn't correct
6 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 2388 KB Output is correct
5 Correct 98 ms 93412 KB Output is correct
6 Correct 122 ms 107748 KB Output is correct
7 Correct 52 ms 61704 KB Output is correct
8 Correct 107 ms 107580 KB Output is correct
9 Correct 11 ms 23640 KB Output is correct
10 Correct 112 ms 107584 KB Output is correct
11 Correct 126 ms 109044 KB Output is correct
12 Incorrect 111 ms 108788 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 189 ms 55340 KB Output is correct
5 Correct 769 ms 107576 KB Output is correct
6 Correct 488 ms 23892 KB Output is correct
7 Correct 793 ms 107396 KB Output is correct
8 Correct 408 ms 42492 KB Output is correct
9 Correct 752 ms 107564 KB Output is correct
10 Correct 904 ms 109000 KB Output is correct
11 Correct 857 ms 109008 KB Output is correct
12 Correct 955 ms 109240 KB Output is correct
13 Correct 687 ms 107544 KB Output is correct
14 Correct 812 ms 108228 KB Output is correct
15 Correct 745 ms 109172 KB Output is correct
16 Correct 752 ms 109004 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 2 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 1 ms 4440 KB Output is correct
24 Correct 1 ms 4440 KB Output is correct
25 Correct 1 ms 4580 KB Output is correct
26 Correct 1 ms 4440 KB Output is correct
27 Correct 12 ms 8792 KB Output is correct
28 Correct 12 ms 8792 KB Output is correct
29 Correct 13 ms 8792 KB Output is correct
30 Correct 13 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 63 ms 68084 KB Output is correct
34 Correct 122 ms 107448 KB Output is correct
35 Correct 121 ms 109124 KB Output is correct
36 Correct 105 ms 107584 KB Output is correct
37 Correct 122 ms 108196 KB Output is correct
38 Correct 122 ms 108988 KB Output is correct

Subtask #6
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 189 ms 55340 KB Output is correct
5 Correct 769 ms 107576 KB Output is correct
6 Correct 488 ms 23892 KB Output is correct
7 Correct 793 ms 107396 KB Output is correct
8 Correct 408 ms 42492 KB Output is correct
9 Correct 752 ms 107564 KB Output is correct
10 Correct 904 ms 109000 KB Output is correct
11 Correct 857 ms 109008 KB Output is correct
12 Correct 955 ms 109240 KB Output is correct
13 Correct 687 ms 107544 KB Output is correct
14 Correct 812 ms 108228 KB Output is correct
15 Correct 745 ms 109172 KB Output is correct
16 Correct 752 ms 109004 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 2 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 1 ms 4440 KB Output is correct
24 Correct 1 ms 4440 KB Output is correct
25 Correct 1 ms 4580 KB Output is correct
26 Correct 1 ms 4440 KB Output is correct
27 Correct 12 ms 8792 KB Output is correct
28 Correct 12 ms 8792 KB Output is correct
29 Correct 13 ms 8792 KB Output is correct
30 Correct 13 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 63 ms 68084 KB Output is correct
34 Correct 122 ms 107448 KB Output is correct
35 Correct 121 ms 109124 KB Output is correct
36 Correct 105 ms 107584 KB Output is correct
37 Correct 122 ms 108196 KB Output is correct
38 Correct 122 ms 108988 KB Output is correct
39 Correct 1 ms 2392 KB Output is correct
40 Correct 1 ms 2392 KB Output is correct
41 Correct 1 ms 2392 KB Output is correct
42 Correct 207 ms 55404 KB Output is correct
43 Correct 771 ms 107476 KB Output is correct
44 Correct 478 ms 23640 KB Output is correct
45 Correct 739 ms 107464 KB Output is correct
46 Correct 404 ms 42704 KB Output is correct
47 Correct 738 ms 107456 KB Output is correct
48 Correct 991 ms 109244 KB Output is correct
49 Correct 824 ms 109100 KB Output is correct
50 Correct 960 ms 108996 KB Output is correct
51 Correct 829 ms 107708 KB Output is correct
52 Correct 938 ms 108236 KB Output is correct
53 Correct 741 ms 109232 KB Output is correct
54 Correct 760 ms 109308 KB Output is correct
55 Correct 1 ms 2644 KB Output is correct
56 Correct 139 ms 107212 KB Output is correct
57 Correct 785 ms 107708 KB Output is correct
58 Correct 333 ms 23628 KB Output is correct
59 Correct 785 ms 107712 KB Output is correct
60 Correct 329 ms 42756 KB Output is correct
61 Correct 750 ms 107560 KB Output is correct
62 Correct 947 ms 108980 KB Output is correct
63 Correct 936 ms 108996 KB Output is correct
64 Correct 909 ms 108744 KB Output is correct
65 Correct 763 ms 107452 KB Output is correct
66 Correct 979 ms 108208 KB Output is correct
67 Correct 821 ms 109196 KB Output is correct
68 Correct 751 ms 109000 KB Output is correct
69 Correct 1 ms 2392 KB Output is correct
70 Correct 1 ms 4440 KB Output is correct
71 Correct 1 ms 4440 KB Output is correct
72 Correct 2 ms 4440 KB Output is correct
73 Correct 2 ms 4440 KB Output is correct
74 Correct 2 ms 4440 KB Output is correct
75 Correct 1 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 2 ms 4440 KB Output is correct
82 Correct 2 ms 4440 KB Output is correct
83 Correct 1 ms 4440 KB Output is correct
84 Correct 1 ms 4440 KB Output is correct
85 Correct 3 ms 4440 KB Output is correct
86 Correct 14 ms 8792 KB Output is correct
87 Correct 10 ms 8792 KB Output is correct
88 Correct 12 ms 8792 KB Output is correct
89 Correct 12 ms 8792 KB Output is correct
90 Correct 13 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 10 ms 8792 KB Output is correct
95 Correct 12 ms 8792 KB Output is correct
96 Correct 11 ms 8792 KB Output is correct
97 Correct 12 ms 8792 KB Output is correct
98 Correct 1 ms 2392 KB Output is correct
99 Correct 120 ms 107516 KB Output is correct
100 Correct 116 ms 107468 KB Output is correct
101 Correct 136 ms 108760 KB Output is correct
102 Correct 105 ms 107576 KB Output is correct
103 Correct 130 ms 108240 KB Output is correct
104 Correct 122 ms 109224 KB Output is correct
105 Correct 1 ms 2392 KB Output is correct
106 Correct 63 ms 67976 KB Output is correct
107 Correct 118 ms 107716 KB Output is correct
108 Correct 119 ms 108904 KB Output is correct
109 Correct 109 ms 107448 KB Output is correct
110 Correct 131 ms 108216 KB Output is correct
111 Correct 118 ms 109232 KB Output is correct

Subtask #7
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 193 ms 91204 KB Output is correct
4 Correct 1066 ms 109000 KB Output is correct
5 Correct 830 ms 59204 KB Output is correct
6 Correct 1044 ms 109140 KB Output is correct
7 Correct 820 ms 78540 KB Output is correct
8 Correct 1078 ms 108988 KB Output is correct
9 Correct 1 ms 4440 KB Output is correct
10 Correct 0 ms 2392 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Incorrect 1 ms 4440 KB Output isn't correct
14 Halted 0 ms 0 KB -