oj.uz

답안 #982920

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
982920 2024-05-15T04:05:14 Z shjeong 밀림 점프 (APIO21_jumps) C++17
48 / 100
 1016 ms 115776 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;
ll n;
struct segtree{
    vector<ll> tree;
    segtree(): tree(808080){}
    void init(ll node, ll s, ll e, vector<ll> &v){
        if(s==e)tree[node] = v[s];
        else{
            ll mid = s+e>>1;
            init(node<<1,s,mid,v); init(node<<1|1,mid+1,e,v);
            tree[node] = max(tree[node<<1],tree[node<<1|1]);
        }
    }
    ll query(ll node, ll s, ll e, ll l, ll r){
        if(l>r)return -1;
        if(e<l or r<s)return 0;
        if(l<=s and e<=r)return tree[node];
        ll mid = s+e>>1;
        return max(query(node<<1,s,mid,l,r), query(node<<1|1,mid+1,e,l,r));
    }
    ll Q(ll l, ll r){ return query(1,1,n,l,r); }
} seg;
vector<ll> v;
ll L[202020][22];
ll R[202020][22];
ll M[202020][22];
void init(int N, std::vector<int> H) {
    n=N;
    v.push_back(0);
    for(int i = 1 ; i <= n ; i++)v.push_back(H[i-1]);
    seg.init(1,1,n,v);
    stack<ll> st;
    for(int i = 1 ; i <= n ; i++){
        while(st.size() and v[st.top()] < v[i]){
            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;
            st.pop();
        }
        st.push(i);
    }
    for(int i = 1 ; i <= n ; i++){
        M[i][0] = (v[L[i][0]] > v[R[i][0]] ? L[i][0] : R[i][0]);
    }
    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 AB, BC, CD;
ll c;
int minimum_jumps(int A, int B, int C, int D) {
    A++; B++; C++; D++;
    AB = seg.Q(A,B), BC = seg.Q(B+1,C-1), CD = seg.Q(C,D);
    if(BC>CD)return -1;
    ll ret = 0;
    ll cur = B;
    for(int i = 20 ; i >= 0 ; i--){
        if(L[cur][i]<=0)continue;
        if(L[cur][i]>=A and v[L[cur][i]] < CD)cur = L[cur][i];
    }
    for(int i = 20 ; i >= 0 ; i--){
        if(M[cur][i]<=0)continue;
        if(v[M[cur][i]]<CD and R[cur][i]<C)cur = M[cur][i], ret += (1<<i);
    }
    for(int i = 20 ; i >= 0 ; i--){
        if(R[cur][i]<=0)continue;
        if(R[cur][i]<C)cur = R[cur][i], ret += (1<<i);
    }
    ret++; cur = R[cur][0];
    if(cur<C or cur>D)ret = -1;
    return ret;
}
/*
10 100
8 7 2 1 3 4 5 6 9 10
3 3 9 9
 ans : 4
 */

Compilation message

jumps.cpp: In member function 'void segtree::init(ll, ll, ll, std::vector<long long int>&)':
jumps.cpp:26:23: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   26 |             ll mid = s+e>>1;
      |                      ~^~
jumps.cpp: In member function 'll segtree::query(ll, ll, ll, ll, ll)':
jumps.cpp:35:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   35 |         ll mid = s+e>>1;
      |                  ~^~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8792 KB Output is correct
2 Correct 2 ms 8792 KB Output is correct
3 Correct 196 ms 97516 KB Output is correct
4 Correct 990 ms 115740 KB Output is correct
5 Correct 873 ms 65652 KB Output is correct
6 Correct 1016 ms 115572 KB Output is correct
7 Correct 732 ms 85048 KB Output is correct
8 Correct 982 ms 115436 KB Output is correct

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 10840 KB Output is correct
2 Correct 2 ms 8820 KB Output is correct
3 Correct 2 ms 8792 KB Output is correct
4 Correct 2 ms 8604 KB Output is correct
5 Correct 3 ms 10840 KB Output is correct
6 Correct 3 ms 10840 KB Output is correct
7 Correct 2 ms 10840 KB Output is correct
8 Correct 3 ms 10840 KB Output is correct
9 Correct 2 ms 10840 KB Output is correct
10 Incorrect 3 ms 10840 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 10840 KB Output is correct
2 Correct 2 ms 8820 KB Output is correct
3 Correct 2 ms 8792 KB Output is correct
4 Correct 2 ms 8604 KB Output is correct
5 Correct 3 ms 10840 KB Output is correct
6 Correct 3 ms 10840 KB Output is correct
7 Correct 2 ms 10840 KB Output is correct
8 Correct 3 ms 10840 KB Output is correct
9 Correct 2 ms 10840 KB Output is correct
10 Incorrect 3 ms 10840 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 10840 KB Output is correct
2 Correct 2 ms 8696 KB Output is correct
3 Correct 2 ms 8792 KB Output is correct
4 Correct 2 ms 8792 KB Output is correct
5 Correct 87 ms 99668 KB Output is correct
6 Correct 120 ms 113800 KB Output is correct
7 Correct 57 ms 67956 KB Output is correct
8 Correct 120 ms 114144 KB Output is correct
9 Correct 13 ms 30060 KB Output is correct
10 Correct 120 ms 113888 KB Output is correct
11 Correct 128 ms 115472 KB Output is correct
12 Correct 123 ms 114932 KB Output is correct
13 Incorrect 122 ms 114880 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8792 KB Output is correct
2 Correct 2 ms 8776 KB Output is correct
3 Correct 2 ms 8792 KB Output is correct
4 Correct 207 ms 61776 KB Output is correct
5 Correct 796 ms 114052 KB Output is correct
6 Correct 446 ms 30160 KB Output is correct
7 Correct 766 ms 114180 KB Output is correct
8 Correct 412 ms 48996 KB Output is correct
9 Correct 706 ms 113912 KB Output is correct
10 Correct 962 ms 115776 KB Output is correct
11 Correct 945 ms 115440 KB Output is correct
12 Correct 908 ms 115316 KB Output is correct
13 Correct 704 ms 114048 KB Output is correct
14 Correct 935 ms 114516 KB Output is correct
15 Correct 763 ms 115264 KB Output is correct
16 Correct 770 ms 115228 KB Output is correct
17 Correct 2 ms 11092 KB Output is correct
18 Correct 2 ms 8788 KB Output is correct
19 Correct 3 ms 10840 KB Output is correct
20 Correct 3 ms 10840 KB Output is correct
21 Correct 3 ms 10840 KB Output is correct
22 Correct 3 ms 10840 KB Output is correct
23 Correct 3 ms 10840 KB Output is correct
24 Correct 3 ms 10840 KB Output is correct
25 Correct 2 ms 10840 KB Output is correct
26 Correct 3 ms 10840 KB Output is correct
27 Correct 16 ms 15192 KB Output is correct
28 Correct 16 ms 15192 KB Output is correct
29 Correct 16 ms 15192 KB Output is correct
30 Correct 12 ms 15192 KB Output is correct
31 Correct 11 ms 15192 KB Output is correct
32 Correct 2 ms 8792 KB Output is correct
33 Correct 70 ms 74420 KB Output is correct
34 Correct 118 ms 113900 KB Output is correct
35 Correct 132 ms 115256 KB Output is correct
36 Correct 114 ms 114064 KB Output is correct
37 Correct 134 ms 114676 KB Output is correct
38 Correct 114 ms 115168 KB Output is correct

Subtask #6
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8792 KB Output is correct
2 Correct 2 ms 8776 KB Output is correct
3 Correct 2 ms 8792 KB Output is correct
4 Correct 207 ms 61776 KB Output is correct
5 Correct 796 ms 114052 KB Output is correct
6 Correct 446 ms 30160 KB Output is correct
7 Correct 766 ms 114180 KB Output is correct
8 Correct 412 ms 48996 KB Output is correct
9 Correct 706 ms 113912 KB Output is correct
10 Correct 962 ms 115776 KB Output is correct
11 Correct 945 ms 115440 KB Output is correct
12 Correct 908 ms 115316 KB Output is correct
13 Correct 704 ms 114048 KB Output is correct
14 Correct 935 ms 114516 KB Output is correct
15 Correct 763 ms 115264 KB Output is correct
16 Correct 770 ms 115228 KB Output is correct
17 Correct 2 ms 11092 KB Output is correct
18 Correct 2 ms 8788 KB Output is correct
19 Correct 3 ms 10840 KB Output is correct
20 Correct 3 ms 10840 KB Output is correct
21 Correct 3 ms 10840 KB Output is correct
22 Correct 3 ms 10840 KB Output is correct
23 Correct 3 ms 10840 KB Output is correct
24 Correct 3 ms 10840 KB Output is correct
25 Correct 2 ms 10840 KB Output is correct
26 Correct 3 ms 10840 KB Output is correct
27 Correct 16 ms 15192 KB Output is correct
28 Correct 16 ms 15192 KB Output is correct
29 Correct 16 ms 15192 KB Output is correct
30 Correct 12 ms 15192 KB Output is correct
31 Correct 11 ms 15192 KB Output is correct
32 Correct 2 ms 8792 KB Output is correct
33 Correct 70 ms 74420 KB Output is correct
34 Correct 118 ms 113900 KB Output is correct
35 Correct 132 ms 115256 KB Output is correct
36 Correct 114 ms 114064 KB Output is correct
37 Correct 134 ms 114676 KB Output is correct
38 Correct 114 ms 115168 KB Output is correct
39 Correct 2 ms 8792 KB Output is correct
40 Correct 1 ms 8792 KB Output is correct
41 Correct 2 ms 8792 KB Output is correct
42 Correct 202 ms 61836 KB Output is correct
43 Correct 746 ms 114044 KB Output is correct
44 Correct 477 ms 30160 KB Output is correct
45 Correct 757 ms 114048 KB Output is correct
46 Correct 418 ms 49100 KB Output is correct
47 Correct 781 ms 114000 KB Output is correct
48 Correct 978 ms 115572 KB Output is correct
49 Correct 852 ms 115444 KB Output is correct
50 Correct 901 ms 115348 KB Output is correct
51 Correct 748 ms 114148 KB Output is correct
52 Correct 882 ms 115156 KB Output is correct
53 Correct 832 ms 115228 KB Output is correct
54 Correct 751 ms 115392 KB Output is correct
55 Correct 2 ms 8792 KB Output is correct
56 Correct 140 ms 113904 KB Output is correct
57 Correct 784 ms 114044 KB Output is correct
58 Correct 354 ms 30160 KB Output is correct
59 Correct 752 ms 113984 KB Output is correct
60 Correct 301 ms 49348 KB Output is correct
61 Correct 743 ms 114048 KB Output is correct
62 Correct 903 ms 115568 KB Output is correct
63 Correct 937 ms 114920 KB Output is correct
64 Correct 897 ms 114948 KB Output is correct
65 Correct 818 ms 113912 KB Output is correct
66 Correct 969 ms 114488 KB Output is correct
67 Correct 811 ms 115192 KB Output is correct
68 Correct 759 ms 115164 KB Output is correct
69 Correct 3 ms 8792 KB Output is correct
70 Correct 2 ms 10840 KB Output is correct
71 Correct 3 ms 10840 KB Output is correct
72 Correct 3 ms 10840 KB Output is correct
73 Correct 3 ms 10840 KB Output is correct
74 Correct 2 ms 10840 KB Output is correct
75 Correct 3 ms 10840 KB Output is correct
76 Correct 1 ms 10840 KB Output is correct
77 Correct 2 ms 8792 KB Output is correct
78 Correct 3 ms 10840 KB Output is correct
79 Correct 3 ms 10840 KB Output is correct
80 Correct 3 ms 10840 KB Output is correct
81 Correct 3 ms 10840 KB Output is correct
82 Correct 3 ms 10840 KB Output is correct
83 Correct 3 ms 10840 KB Output is correct
84 Correct 2 ms 10840 KB Output is correct
85 Correct 4 ms 10840 KB Output is correct
86 Correct 12 ms 15192 KB Output is correct
87 Correct 15 ms 15192 KB Output is correct
88 Correct 13 ms 15192 KB Output is correct
89 Correct 14 ms 15196 KB Output is correct
90 Correct 12 ms 13400 KB Output is correct
91 Correct 2 ms 10840 KB Output is correct
92 Correct 2 ms 10840 KB Output is correct
93 Correct 14 ms 15192 KB Output is correct
94 Correct 13 ms 15192 KB Output is correct
95 Correct 12 ms 15192 KB Output is correct
96 Correct 15 ms 15192 KB Output is correct
97 Correct 13 ms 15192 KB Output is correct
98 Correct 2 ms 8792 KB Output is correct
99 Correct 125 ms 113976 KB Output is correct
100 Correct 107 ms 114052 KB Output is correct
101 Correct 130 ms 115180 KB Output is correct
102 Correct 118 ms 113984 KB Output is correct
103 Correct 121 ms 114740 KB Output is correct
104 Correct 125 ms 115260 KB Output is correct
105 Correct 2 ms 9044 KB Output is correct
106 Correct 63 ms 74540 KB Output is correct
107 Correct 110 ms 113804 KB Output is correct
108 Correct 124 ms 115192 KB Output is correct
109 Correct 123 ms 113888 KB Output is correct
110 Correct 120 ms 114740 KB Output is correct
111 Correct 112 ms 115232 KB Output is correct

Subtask #7
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8792 KB Output is correct
2 Correct 2 ms 8792 KB Output is correct
3 Correct 196 ms 97516 KB Output is correct
4 Correct 990 ms 115740 KB Output is correct
5 Correct 873 ms 65652 KB Output is correct
6 Correct 1016 ms 115572 KB Output is correct
7 Correct 732 ms 85048 KB Output is correct
8 Correct 982 ms 115436 KB Output is correct
9 Correct 2 ms 10840 KB Output is correct
10 Correct 2 ms 8820 KB Output is correct
11 Correct 2 ms 8792 KB Output is correct
12 Correct 2 ms 8604 KB Output is correct
13 Correct 3 ms 10840 KB Output is correct
14 Correct 3 ms 10840 KB Output is correct
15 Correct 2 ms 10840 KB Output is correct
16 Correct 3 ms 10840 KB Output is correct
17 Correct 2 ms 10840 KB Output is correct
18 Incorrect 3 ms 10840 KB Output isn't correct
19 Halted 0 ms 0 KB -