oj.uz

답안 #984395

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
984395 2024-05-16T15:20:28 Z shjeong 밀림 점프 (APIO21_jumps) C++17
27 / 100
 961 ms 74448 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 M[202020][22];
ll R[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]){
            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++){
            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];
}
ll arcRMQ(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 ret;
}
int minimum_jumps(int A, int B, int C, int D) {
    A++; B++; C++; D++;
    ll ret = 0;
    ll cur = arcRMQ(A,B);
    ll H = RMQ(B,C-1);
    for(int i = 20 ; i >= 0 ; i--){
        if(M[cur][i]>0 and v[M[cur][i]]<=v[C])cur = M[cur][i], ret += (1<<i);
    }
    for(int i = 20 ; i >= 0 ; i--){
        if(R[cur][i]>0 and R[cur][i]<=C)cur = R[cur][i], ret += (1<<i);
    }
    return cur == C ? ret : -1;
}

Compilation message

jumps.cpp: In function 'int minimum_jumps(int, int, int, int)':
jumps.cpp:70:8: warning: unused variable 'H' [-Wunused-variable]
   70 |     ll H = RMQ(B,C-1);
      |        ^

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 0 ms 2392 KB Output is correct
3 Correct 163 ms 63824 KB Output is correct
4 Correct 943 ms 74320 KB Output is correct
5 Correct 804 ms 41956 KB Output is correct
6 Correct 961 ms 74444 KB Output is correct
7 Correct 702 ms 55000 KB Output is correct
8 Correct 921 ms 74448 KB Output is correct

Subtask #2
0 / 8.0

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

Subtask #3
0 / 13.0

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

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 2392 KB Output isn't correct
2 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 0 ms 2392 KB Output is correct
4 Correct 171 ms 36932 KB Output is correct
5 Correct 696 ms 72792 KB Output is correct
6 Correct 439 ms 15704 KB Output is correct
7 Correct 689 ms 72632 KB Output is correct
8 Correct 370 ms 28248 KB Output is correct
9 Correct 691 ms 72656 KB Output is correct
10 Correct 822 ms 74448 KB Output is correct
11 Correct 748 ms 74168 KB Output is correct
12 Correct 872 ms 74212 KB Output is correct
13 Correct 680 ms 72788 KB Output is correct
14 Correct 790 ms 73420 KB Output is correct
15 Correct 691 ms 74432 KB Output is correct
16 Correct 817 ms 74448 KB Output is correct
17 Correct 0 ms 2392 KB Output is correct
18 Correct 1 ms 2392 KB Output is correct
19 Correct 1 ms 2392 KB Output is correct
20 Correct 1 ms 2392 KB Output is correct
21 Correct 1 ms 2392 KB Output is correct
22 Correct 2 ms 2392 KB Output is correct
23 Correct 1 ms 2392 KB Output is correct
24 Correct 1 ms 2392 KB Output is correct
25 Correct 1 ms 2392 KB Output is correct
26 Correct 1 ms 2392 KB Output is correct
27 Correct 11 ms 6744 KB Output is correct
28 Correct 10 ms 6744 KB Output is correct
29 Correct 11 ms 6988 KB Output is correct
30 Correct 12 ms 6996 KB Output is correct
31 Correct 10 ms 6744 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct
33 Correct 45 ms 45392 KB Output is correct
34 Correct 86 ms 72648 KB Output is correct
35 Correct 92 ms 74196 KB Output is correct
36 Correct 92 ms 72808 KB Output is correct
37 Correct 97 ms 73424 KB Output is correct
38 Correct 92 ms 74252 KB Output is correct

Subtask #6
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 0 ms 2392 KB Output is correct
4 Correct 171 ms 36932 KB Output is correct
5 Correct 696 ms 72792 KB Output is correct
6 Correct 439 ms 15704 KB Output is correct
7 Correct 689 ms 72632 KB Output is correct
8 Correct 370 ms 28248 KB Output is correct
9 Correct 691 ms 72656 KB Output is correct
10 Correct 822 ms 74448 KB Output is correct
11 Correct 748 ms 74168 KB Output is correct
12 Correct 872 ms 74212 KB Output is correct
13 Correct 680 ms 72788 KB Output is correct
14 Correct 790 ms 73420 KB Output is correct
15 Correct 691 ms 74432 KB Output is correct
16 Correct 817 ms 74448 KB Output is correct
17 Correct 0 ms 2392 KB Output is correct
18 Correct 1 ms 2392 KB Output is correct
19 Correct 1 ms 2392 KB Output is correct
20 Correct 1 ms 2392 KB Output is correct
21 Correct 1 ms 2392 KB Output is correct
22 Correct 2 ms 2392 KB Output is correct
23 Correct 1 ms 2392 KB Output is correct
24 Correct 1 ms 2392 KB Output is correct
25 Correct 1 ms 2392 KB Output is correct
26 Correct 1 ms 2392 KB Output is correct
27 Correct 11 ms 6744 KB Output is correct
28 Correct 10 ms 6744 KB Output is correct
29 Correct 11 ms 6988 KB Output is correct
30 Correct 12 ms 6996 KB Output is correct
31 Correct 10 ms 6744 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct
33 Correct 45 ms 45392 KB Output is correct
34 Correct 86 ms 72648 KB Output is correct
35 Correct 92 ms 74196 KB Output is correct
36 Correct 92 ms 72808 KB Output is correct
37 Correct 97 ms 73424 KB Output is correct
38 Correct 92 ms 74252 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 161 ms 37112 KB Output is correct
43 Correct 727 ms 72644 KB Output is correct
44 Correct 420 ms 15424 KB Output is correct
45 Correct 700 ms 72784 KB Output is correct
46 Correct 375 ms 28380 KB Output is correct
47 Correct 760 ms 72648 KB Output is correct
48 Correct 811 ms 74436 KB Output is correct
49 Correct 766 ms 74304 KB Output is correct
50 Correct 855 ms 74192 KB Output is correct
51 Correct 700 ms 72628 KB Output is correct
52 Correct 801 ms 73616 KB Output is correct
53 Correct 676 ms 74436 KB Output is correct
54 Correct 686 ms 74432 KB Output is correct
55 Correct 1 ms 2392 KB Output is correct
56 Incorrect 114 ms 72640 KB Output isn't correct
57 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 0 ms 2392 KB Output is correct
3 Correct 163 ms 63824 KB Output is correct
4 Correct 943 ms 74320 KB Output is correct
5 Correct 804 ms 41956 KB Output is correct
6 Correct 961 ms 74444 KB Output is correct
7 Correct 702 ms 55000 KB Output is correct
8 Correct 921 ms 74448 KB Output is correct
9 Incorrect 1 ms 2392 KB Output isn't correct
10 Halted 0 ms 0 KB -