oj.uz

Submission #982917

# Submission time Handle Problem Language Result Execution time Memory
982917 2024-05-15T03:50:41 Z shjeong Rainforest Jumps (APIO21_jumps) C++17
48 / 100
 1002 ms 115580 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);
    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 M[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

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8792 KB Output is correct
2 Correct 2 ms 8792 KB Output is correct
3 Correct 237 ms 96324 KB Output is correct
4 Correct 999 ms 115528 KB Output is correct
5 Correct 802 ms 65476 KB Output is correct
6 Correct 967 ms 115448 KB Output is correct
7 Correct 759 ms 85028 KB Output is correct
8 Correct 962 ms 115568 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10840 KB Output is correct
2 Correct 2 ms 8792 KB Output is correct
3 Correct 1 ms 8792 KB Output is correct
4 Correct 2 ms 8792 KB Output is correct
5 Correct 2 ms 10840 KB Output is correct
6 Incorrect 4 ms 10840 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10840 KB Output is correct
2 Correct 2 ms 8792 KB Output is correct
3 Correct 1 ms 8792 KB Output is correct
4 Correct 2 ms 8792 KB Output is correct
5 Correct 2 ms 10840 KB Output is correct
6 Incorrect 4 ms 10840 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10840 KB Output is correct
2 Correct 2 ms 8792 KB Output is correct
3 Correct 2 ms 9044 KB Output is correct
4 Correct 2 ms 8792 KB Output is correct
5 Correct 92 ms 99868 KB Output is correct
6 Correct 128 ms 114048 KB Output is correct
7 Correct 54 ms 67956 KB Output is correct
8 Correct 110 ms 114044 KB Output is correct
9 Correct 13 ms 29908 KB Output is correct
10 Correct 112 ms 114056 KB Output is correct
11 Correct 133 ms 115440 KB Output is correct
12 Correct 122 ms 114912 KB Output is correct
13 Correct 119 ms 114912 KB Output is correct
14 Correct 110 ms 114060 KB Output is correct
15 Incorrect 123 ms 114696 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8792 KB Output is correct
2 Correct 2 ms 8792 KB Output is correct
3 Correct 2 ms 8792 KB Output is correct
4 Correct 201 ms 61852 KB Output is correct
5 Correct 811 ms 114068 KB Output is correct
6 Correct 487 ms 30064 KB Output is correct
7 Correct 845 ms 113908 KB Output is correct
8 Correct 499 ms 49100 KB Output is correct
9 Correct 820 ms 113896 KB Output is correct
10 Correct 1002 ms 115440 KB Output is correct
11 Correct 867 ms 115276 KB Output is correct
12 Correct 993 ms 115172 KB Output is correct
13 Correct 883 ms 113900 KB Output is correct
14 Correct 943 ms 114880 KB Output is correct
15 Correct 831 ms 114976 KB Output is correct
16 Correct 850 ms 115248 KB Output is correct
17 Correct 3 ms 10840 KB Output is correct
18 Correct 2 ms 8792 KB Output is correct
19 Correct 2 ms 10840 KB Output is correct
20 Correct 3 ms 10924 KB Output is correct
21 Correct 3 ms 10840 KB Output is correct
22 Correct 3 ms 10840 KB Output is correct
23 Correct 4 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 2 ms 10840 KB Output is correct
27 Correct 12 ms 15192 KB Output is correct
28 Correct 14 ms 15192 KB Output is correct
29 Correct 12 ms 15192 KB Output is correct
30 Correct 12 ms 15192 KB Output is correct
31 Correct 12 ms 15192 KB Output is correct
32 Correct 2 ms 8792 KB Output is correct
33 Correct 68 ms 74980 KB Output is correct
34 Correct 110 ms 114044 KB Output is correct
35 Correct 124 ms 115200 KB Output is correct
36 Correct 112 ms 113912 KB Output is correct
37 Correct 128 ms 114924 KB Output is correct
38 Correct 139 ms 115184 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8792 KB Output is correct
2 Correct 2 ms 8792 KB Output is correct
3 Correct 2 ms 8792 KB Output is correct
4 Correct 201 ms 61852 KB Output is correct
5 Correct 811 ms 114068 KB Output is correct
6 Correct 487 ms 30064 KB Output is correct
7 Correct 845 ms 113908 KB Output is correct
8 Correct 499 ms 49100 KB Output is correct
9 Correct 820 ms 113896 KB Output is correct
10 Correct 1002 ms 115440 KB Output is correct
11 Correct 867 ms 115276 KB Output is correct
12 Correct 993 ms 115172 KB Output is correct
13 Correct 883 ms 113900 KB Output is correct
14 Correct 943 ms 114880 KB Output is correct
15 Correct 831 ms 114976 KB Output is correct
16 Correct 850 ms 115248 KB Output is correct
17 Correct 3 ms 10840 KB Output is correct
18 Correct 2 ms 8792 KB Output is correct
19 Correct 2 ms 10840 KB Output is correct
20 Correct 3 ms 10924 KB Output is correct
21 Correct 3 ms 10840 KB Output is correct
22 Correct 3 ms 10840 KB Output is correct
23 Correct 4 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 2 ms 10840 KB Output is correct
27 Correct 12 ms 15192 KB Output is correct
28 Correct 14 ms 15192 KB Output is correct
29 Correct 12 ms 15192 KB Output is correct
30 Correct 12 ms 15192 KB Output is correct
31 Correct 12 ms 15192 KB Output is correct
32 Correct 2 ms 8792 KB Output is correct
33 Correct 68 ms 74980 KB Output is correct
34 Correct 110 ms 114044 KB Output is correct
35 Correct 124 ms 115200 KB Output is correct
36 Correct 112 ms 113912 KB Output is correct
37 Correct 128 ms 114924 KB Output is correct
38 Correct 139 ms 115184 KB Output is correct
39 Correct 2 ms 8792 KB Output is correct
40 Correct 2 ms 8792 KB Output is correct
41 Correct 2 ms 8792 KB Output is correct
42 Correct 221 ms 61836 KB Output is correct
43 Correct 833 ms 114048 KB Output is correct
44 Correct 519 ms 30072 KB Output is correct
45 Correct 834 ms 114040 KB Output is correct
46 Correct 463 ms 49100 KB Output is correct
47 Correct 856 ms 113908 KB Output is correct
48 Correct 913 ms 115580 KB Output is correct
49 Correct 870 ms 115464 KB Output is correct
50 Correct 937 ms 115360 KB Output is correct
51 Correct 792 ms 113856 KB Output is correct
52 Correct 944 ms 114932 KB Output is correct
53 Correct 789 ms 115168 KB Output is correct
54 Correct 892 ms 115184 KB Output is correct
55 Correct 2 ms 8792 KB Output is correct
56 Correct 155 ms 113752 KB Output is correct
57 Correct 816 ms 113948 KB Output is correct
58 Correct 368 ms 30068 KB Output is correct
59 Correct 902 ms 114048 KB Output is correct
60 Correct 327 ms 49152 KB Output is correct
61 Correct 857 ms 114044 KB Output is correct
62 Correct 955 ms 115564 KB Output is correct
63 Correct 952 ms 115400 KB Output is correct
64 Correct 946 ms 114956 KB Output is correct
65 Correct 884 ms 114060 KB Output is correct
66 Correct 961 ms 114744 KB Output is correct
67 Correct 867 ms 115188 KB Output is correct
68 Correct 836 ms 115424 KB Output is correct
69 Correct 2 ms 8792 KB Output is correct
70 Correct 2 ms 10840 KB Output is correct
71 Correct 3 ms 10892 KB Output is correct
72 Correct 3 ms 10840 KB Output is correct
73 Correct 3 ms 10840 KB Output is correct
74 Correct 3 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 10836 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 14 ms 15192 KB Output is correct
87 Correct 13 ms 15192 KB Output is correct
88 Correct 13 ms 15192 KB Output is correct
89 Correct 12 ms 15188 KB Output is correct
90 Correct 12 ms 13400 KB Output is correct
91 Correct 2 ms 10868 KB Output is correct
92 Correct 3 ms 10840 KB Output is correct
93 Correct 13 ms 15192 KB Output is correct
94 Correct 13 ms 15192 KB Output is correct
95 Correct 13 ms 15192 KB Output is correct
96 Correct 12 ms 15192 KB Output is correct
97 Correct 16 ms 15192 KB Output is correct
98 Correct 2 ms 8792 KB Output is correct
99 Correct 108 ms 113904 KB Output is correct
100 Correct 108 ms 114040 KB Output is correct
101 Correct 126 ms 115180 KB Output is correct
102 Correct 117 ms 114060 KB Output is correct
103 Correct 123 ms 114676 KB Output is correct
104 Correct 119 ms 115216 KB Output is correct
105 Correct 1 ms 8792 KB Output is correct
106 Correct 64 ms 74404 KB Output is correct
107 Correct 111 ms 114056 KB Output is correct
108 Correct 128 ms 115316 KB Output is correct
109 Correct 115 ms 114040 KB Output is correct
110 Correct 124 ms 114660 KB Output is correct
111 Correct 115 ms 115168 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8792 KB Output is correct
2 Correct 2 ms 8792 KB Output is correct
3 Correct 237 ms 96324 KB Output is correct
4 Correct 999 ms 115528 KB Output is correct
5 Correct 802 ms 65476 KB Output is correct
6 Correct 967 ms 115448 KB Output is correct
7 Correct 759 ms 85028 KB Output is correct
8 Correct 962 ms 115568 KB Output is correct
9 Correct 2 ms 10840 KB Output is correct
10 Correct 2 ms 8792 KB Output is correct
11 Correct 1 ms 8792 KB Output is correct
12 Correct 2 ms 8792 KB Output is correct
13 Correct 2 ms 10840 KB Output is correct
14 Incorrect 4 ms 10840 KB Output isn't correct
15 Halted 0 ms 0 KB -