oj.uz

Submission #982916

# Submission time Handle Problem Language Result Execution time Memory
982916 2024-05-15T03:49:37 Z shjeong Rainforest Jumps (APIO21_jumps) C++17
44 / 100
 1032 ms 115696 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)cur = M[cur][i], ret += (1<<i);
    }
    if(C<=cur and cur<=D)return ret;
    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
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 Incorrect 179 ms 97684 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

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

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 11000 KB Output is correct
2 Correct 2 ms 8792 KB Output is correct
3 Correct 2 ms 8792 KB Output is correct
4 Correct 2 ms 8792 KB Output is correct
5 Correct 3 ms 10644 KB Output is correct
6 Incorrect 2 ms 10884 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 10836 KB Output is correct
2 Correct 2 ms 8792 KB Output is correct
3 Correct 2 ms 8792 KB Output is correct
4 Correct 2 ms 8792 KB Output is correct
5 Correct 88 ms 99680 KB Output is correct
6 Correct 111 ms 113984 KB Output is correct
7 Correct 55 ms 68160 KB Output is correct
8 Correct 120 ms 113900 KB Output is correct
9 Correct 12 ms 29908 KB Output is correct
10 Correct 117 ms 114040 KB Output is correct
11 Incorrect 128 ms 115560 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9044 KB Output is correct
2 Correct 2 ms 8792 KB Output is correct
3 Correct 2 ms 8792 KB Output is correct
4 Correct 225 ms 61836 KB Output is correct
5 Correct 866 ms 113896 KB Output is correct
6 Correct 477 ms 30072 KB Output is correct
7 Correct 802 ms 113900 KB Output is correct
8 Correct 463 ms 49144 KB Output is correct
9 Correct 858 ms 113892 KB Output is correct
10 Correct 1032 ms 115424 KB Output is correct
11 Correct 889 ms 115428 KB Output is correct
12 Correct 969 ms 115340 KB Output is correct
13 Correct 883 ms 114040 KB Output is correct
14 Correct 924 ms 114924 KB Output is correct
15 Correct 784 ms 115696 KB Output is correct
16 Correct 798 ms 115168 KB Output is correct
17 Correct 2 ms 10840 KB Output is correct
18 Correct 2 ms 8792 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 11092 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 12 ms 15080 KB Output is correct
29 Correct 12 ms 15192 KB Output is correct
30 Correct 13 ms 15088 KB Output is correct
31 Correct 11 ms 15192 KB Output is correct
32 Correct 2 ms 8792 KB Output is correct
33 Correct 65 ms 74544 KB Output is correct
34 Correct 114 ms 114060 KB Output is correct
35 Correct 131 ms 115176 KB Output is correct
36 Correct 110 ms 113888 KB Output is correct
37 Correct 121 ms 114740 KB Output is correct
38 Correct 118 ms 115232 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9044 KB Output is correct
2 Correct 2 ms 8792 KB Output is correct
3 Correct 2 ms 8792 KB Output is correct
4 Correct 225 ms 61836 KB Output is correct
5 Correct 866 ms 113896 KB Output is correct
6 Correct 477 ms 30072 KB Output is correct
7 Correct 802 ms 113900 KB Output is correct
8 Correct 463 ms 49144 KB Output is correct
9 Correct 858 ms 113892 KB Output is correct
10 Correct 1032 ms 115424 KB Output is correct
11 Correct 889 ms 115428 KB Output is correct
12 Correct 969 ms 115340 KB Output is correct
13 Correct 883 ms 114040 KB Output is correct
14 Correct 924 ms 114924 KB Output is correct
15 Correct 784 ms 115696 KB Output is correct
16 Correct 798 ms 115168 KB Output is correct
17 Correct 2 ms 10840 KB Output is correct
18 Correct 2 ms 8792 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 11092 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 12 ms 15080 KB Output is correct
29 Correct 12 ms 15192 KB Output is correct
30 Correct 13 ms 15088 KB Output is correct
31 Correct 11 ms 15192 KB Output is correct
32 Correct 2 ms 8792 KB Output is correct
33 Correct 65 ms 74544 KB Output is correct
34 Correct 114 ms 114060 KB Output is correct
35 Correct 131 ms 115176 KB Output is correct
36 Correct 110 ms 113888 KB Output is correct
37 Correct 121 ms 114740 KB Output is correct
38 Correct 118 ms 115232 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 232 ms 61768 KB Output is correct
43 Correct 797 ms 114044 KB Output is correct
44 Correct 522 ms 30160 KB Output is correct
45 Correct 847 ms 113900 KB Output is correct
46 Correct 529 ms 49152 KB Output is correct
47 Correct 877 ms 113908 KB Output is correct
48 Correct 974 ms 115576 KB Output is correct
49 Correct 898 ms 115440 KB Output is correct
50 Correct 950 ms 115332 KB Output is correct
51 Correct 755 ms 114048 KB Output is correct
52 Correct 936 ms 114676 KB Output is correct
53 Correct 750 ms 115432 KB Output is correct
54 Correct 796 ms 115224 KB Output is correct
55 Correct 2 ms 8792 KB Output is correct
56 Correct 150 ms 113880 KB Output is correct
57 Correct 825 ms 114060 KB Output is correct
58 Correct 367 ms 30208 KB Output is correct
59 Correct 826 ms 113912 KB Output is correct
60 Correct 335 ms 49236 KB Output is correct
61 Correct 819 ms 114056 KB Output is correct
62 Correct 930 ms 115568 KB Output is correct
63 Correct 917 ms 115408 KB Output is correct
64 Correct 887 ms 114880 KB Output is correct
65 Correct 892 ms 113904 KB Output is correct
66 Correct 967 ms 114744 KB Output is correct
67 Correct 922 ms 115228 KB Output is correct
68 Correct 919 ms 115044 KB Output is correct
69 Correct 2 ms 8788 KB Output is correct
70 Correct 2 ms 10840 KB Output is correct
71 Correct 3 ms 10920 KB Output is correct
72 Correct 3 ms 10840 KB Output is correct
73 Correct 3 ms 10840 KB Output is correct
74 Correct 4 ms 10840 KB Output is correct
75 Correct 4 ms 10840 KB Output is correct
76 Correct 2 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 4 ms 10840 KB Output is correct
80 Correct 4 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 3 ms 10840 KB Output is correct
85 Correct 5 ms 10840 KB Output is correct
86 Correct 16 ms 14976 KB Output is correct
87 Correct 16 ms 15192 KB Output is correct
88 Correct 16 ms 15392 KB Output is correct
89 Correct 18 ms 15192 KB Output is correct
90 Correct 21 ms 13400 KB Output is correct
91 Correct 2 ms 10840 KB Output is correct
92 Correct 3 ms 10840 KB Output is correct
93 Correct 15 ms 15192 KB Output is correct
94 Correct 15 ms 15192 KB Output is correct
95 Correct 13 ms 15192 KB Output is correct
96 Correct 12 ms 15200 KB Output is correct
97 Correct 17 ms 15192 KB Output is correct
98 Correct 2 ms 8792 KB Output is correct
99 Correct 133 ms 113932 KB Output is correct
100 Correct 147 ms 114064 KB Output is correct
101 Correct 158 ms 115396 KB Output is correct
102 Correct 137 ms 114040 KB Output is correct
103 Correct 147 ms 114744 KB Output is correct
104 Correct 145 ms 115252 KB Output is correct
105 Correct 2 ms 8948 KB Output is correct
106 Correct 79 ms 73808 KB Output is correct
107 Correct 129 ms 114064 KB Output is correct
108 Correct 132 ms 115292 KB Output is correct
109 Correct 142 ms 114036 KB Output is correct
110 Correct 157 ms 114660 KB Output is correct
111 Correct 150 ms 115228 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 Incorrect 179 ms 97684 KB Output isn't correct
4 Halted 0 ms 0 KB -