oj.uz

Submission #954925

# Submission time Handle Problem Language Result Execution time Memory
954925 2024-03-28T20:04:43 Z Unforgettablepl Rainforest Jumps (APIO21_jumps) C++17
48 / 100
 940 ms 122244 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long

int L[200002][18];
int Left[200002][18];
int Right[200002][18];
int arr[200001];
int tree[524288];
int R[200002][18];
int n;

void update(int k,int x){
    k+=262144;
    tree[k]=x;
    k/=2;
    while(k){
        tree[k]=max(tree[2*k],tree[2*k+1]);
        k/=2;
    }
}

int get(int a,int b){
    a+=262144;b+=262144;
    int ans = INT32_MIN;
    while(a<=b){
        if(a&1)ans=max(ans,tree[a++]);
        if(b%2==0)ans=max(ans,tree[b--]);
        a/=2;b/=2;
    }
    return ans;
}

void init(int32_t N, vector<int32_t> H) {
    n=N;
    for(int i=0;i<N;i++)arr[i]=H[i];
    for(int i=0;i<N;i++)update(i,arr[i]);
    stack<int> q;
    for(int i=0;i<N;i++){
        while(!q.empty() and q.top()<arr[i])q.pop();
        if(!q.empty())Left[arr[i]][0]=L[arr[i]][0]=q.top();
        else Left[arr[i]][0]=L[arr[i]][0]=n+1;
        q.emplace(arr[i]);
    }
    while(!q.empty())q.pop();
    for(int i=N-1;i>=0;i--){
        while(!q.empty() and q.top()<arr[i])q.pop();
        if(!q.empty())Right[arr[i]][0]=R[arr[i]][0]=q.top();
        else Right[arr[i]][0]=R[arr[i]][0]=n+1;
        q.emplace(arr[i]);
    }
    for(int bit=0;bit<=17;bit++)Right[n+1][bit]=Left[n+1][bit]=L[n+1][bit]=R[n+1][bit]=n+1;
    for(int i=1;i<=N;i++)if(L[i][0] > R[i][0])swap(L[i][0], R[i][0]);
    for(int bit=1;bit<=17;bit++){
        for(int i=1;i<=N;i++){
            R[i][bit] = R[R[i][bit - 1]][bit - 1];
        }
    }
    for(int bit=1;bit<=17;bit++){
        for(int i=1;i<=N;i++){
            L[i][bit] = L[L[i][bit - 1]][bit - 1];
        }
    }
    for(int bit=1;bit<=17;bit++){
        for(int i=1;i<=N;i++){
            Left[i][bit] = Left[Left[i][bit - 1]][bit - 1];
        }
    }
    for(int bit=1;bit<=17;bit++){
        for(int i=1;i<=N;i++){
            Right[i][bit] = Right[Right[i][bit - 1]][bit - 1];
        }
    }
}

int getans(int base,int tar){
    int ans = 0;
    for(int jump=17;jump>=0;jump--){
        if(R[base][jump] <= tar) { base = R[base][jump]; ans+=(1 << jump);}
    }
    for(int jump=17;jump>=0;jump--){
        if(L[base][jump] <= tar) { base = L[base][jump]; ans+=(1 << jump);}
    }
    return base==tar ? ans : -1;
}

int getrangeans(int A,int B,int tar){
    int base = arr[B];
    int limit = min(tar,get(A,B));
    for(int jump=17;jump>=0;jump--){
        if(Left[base][jump]<=limit)base=Left[base][jump];
    }
    return getans(base,tar);
}

int32_t minimum_jumps(int32_t A, int32_t B, int32_t C, int32_t D) {
    int rightmax = get(C,D);
    int midmax = get(B+1,C-1);
    int leftmax = get(A,B);
    if(rightmax<midmax)return -1;
    int optR = arr[C];
    if(optR<midmax){
        for(int jump=17;jump>=0;jump--){
            if(Right[optR][jump]<midmax)optR=Right[optR][jump];
        }
        optR = Right[optR][0];
    }
    if(leftmax<midmax)return getrangeans(A,B,optR);
    if(leftmax<rightmax)return 1;
    int optL = arr[B];
    if(optL<midmax){
        for(int jump=17;jump>=0;jump--){
            if(Left[optL][jump]<midmax)optL=Left[optL][jump];
        }
        optL = Left[optL][0];
    }
    if(optL<rightmax)return 1;
    return getrangeans(A,B,optR);
}

//int32_t main() {
//    int32_t N, Q;
//    assert(2 == scanf("%d %d", &N, &Q));
//    std::vector<int32_t> H(N);
//    for (int32_t i = 0; i < N; ++i) {
//        assert(1 == scanf("%d", &H[i]));
//    }
//    init(N, H);
//
//    for (int32_t i = 0; i < Q; ++i) {
//        int32_t A, B, C, D;
//        assert(4 == scanf("%d %d %d %d", &A, &B, &C, &D));
//        printf("%d\n", minimum_jumps(A, B, C, D));
//    }
//    return 0;
//}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12632 KB Output is correct
2 Correct 2 ms 12632 KB Output is correct
3 Correct 188 ms 105648 KB Output is correct
4 Correct 923 ms 121800 KB Output is correct
5 Correct 727 ms 71768 KB Output is correct
6 Correct 940 ms 122064 KB Output is correct
7 Correct 699 ms 93272 KB Output is correct
8 Correct 932 ms 122028 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12632 KB Output is correct
2 Correct 2 ms 12632 KB Output is correct
3 Correct 2 ms 12632 KB Output is correct
4 Correct 2 ms 12744 KB Output is correct
5 Correct 2 ms 12628 KB Output is correct
6 Correct 3 ms 12632 KB Output is correct
7 Correct 2 ms 12632 KB Output is correct
8 Correct 3 ms 12632 KB Output is correct
9 Correct 2 ms 12740 KB Output is correct
10 Correct 2 ms 12632 KB Output is correct
11 Correct 3 ms 12632 KB Output is correct
12 Correct 2 ms 12632 KB Output is correct
13 Incorrect 2 ms 12632 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12632 KB Output is correct
2 Correct 2 ms 12632 KB Output is correct
3 Correct 2 ms 12632 KB Output is correct
4 Correct 2 ms 12744 KB Output is correct
5 Correct 2 ms 12628 KB Output is correct
6 Correct 3 ms 12632 KB Output is correct
7 Correct 2 ms 12632 KB Output is correct
8 Correct 3 ms 12632 KB Output is correct
9 Correct 2 ms 12740 KB Output is correct
10 Correct 2 ms 12632 KB Output is correct
11 Correct 3 ms 12632 KB Output is correct
12 Correct 2 ms 12632 KB Output is correct
13 Incorrect 2 ms 12632 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12632 KB Output is correct
2 Correct 2 ms 12632 KB Output is correct
3 Correct 2 ms 12632 KB Output is correct
4 Correct 2 ms 12632 KB Output is correct
5 Correct 103 ms 104248 KB Output is correct
6 Correct 138 ms 120360 KB Output is correct
7 Correct 48 ms 70996 KB Output is correct
8 Correct 140 ms 120272 KB Output is correct
9 Correct 12 ms 29476 KB Output is correct
10 Correct 147 ms 120248 KB Output is correct
11 Correct 130 ms 121788 KB Output is correct
12 Correct 133 ms 121432 KB Output is correct
13 Incorrect 140 ms 121360 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12632 KB Output is correct
2 Correct 2 ms 12632 KB Output is correct
3 Correct 2 ms 12888 KB Output is correct
4 Correct 179 ms 67132 KB Output is correct
5 Correct 754 ms 120248 KB Output is correct
6 Correct 440 ms 33624 KB Output is correct
7 Correct 678 ms 120444 KB Output is correct
8 Correct 345 ms 52432 KB Output is correct
9 Correct 660 ms 120380 KB Output is correct
10 Correct 834 ms 122024 KB Output is correct
11 Correct 828 ms 121796 KB Output is correct
12 Correct 873 ms 121784 KB Output is correct
13 Correct 758 ms 120248 KB Output is correct
14 Correct 850 ms 121204 KB Output is correct
15 Correct 757 ms 121868 KB Output is correct
16 Correct 707 ms 122028 KB Output is correct
17 Correct 2 ms 12632 KB Output is correct
18 Correct 2 ms 12632 KB Output is correct
19 Correct 3 ms 12632 KB Output is correct
20 Correct 2 ms 12632 KB Output is correct
21 Correct 2 ms 12632 KB Output is correct
22 Correct 3 ms 12632 KB Output is correct
23 Correct 2 ms 12632 KB Output is correct
24 Correct 2 ms 12632 KB Output is correct
25 Correct 2 ms 12632 KB Output is correct
26 Correct 2 ms 12632 KB Output is correct
27 Correct 14 ms 16984 KB Output is correct
28 Correct 14 ms 16984 KB Output is correct
29 Correct 11 ms 16984 KB Output is correct
30 Correct 11 ms 16980 KB Output is correct
31 Correct 11 ms 16984 KB Output is correct
32 Correct 2 ms 12632 KB Output is correct
33 Correct 61 ms 79496 KB Output is correct
34 Correct 154 ms 120372 KB Output is correct
35 Correct 133 ms 121780 KB Output is correct
36 Correct 138 ms 120380 KB Output is correct
37 Correct 152 ms 121048 KB Output is correct
38 Correct 130 ms 122244 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12632 KB Output is correct
2 Correct 2 ms 12632 KB Output is correct
3 Correct 2 ms 12888 KB Output is correct
4 Correct 179 ms 67132 KB Output is correct
5 Correct 754 ms 120248 KB Output is correct
6 Correct 440 ms 33624 KB Output is correct
7 Correct 678 ms 120444 KB Output is correct
8 Correct 345 ms 52432 KB Output is correct
9 Correct 660 ms 120380 KB Output is correct
10 Correct 834 ms 122024 KB Output is correct
11 Correct 828 ms 121796 KB Output is correct
12 Correct 873 ms 121784 KB Output is correct
13 Correct 758 ms 120248 KB Output is correct
14 Correct 850 ms 121204 KB Output is correct
15 Correct 757 ms 121868 KB Output is correct
16 Correct 707 ms 122028 KB Output is correct
17 Correct 2 ms 12632 KB Output is correct
18 Correct 2 ms 12632 KB Output is correct
19 Correct 3 ms 12632 KB Output is correct
20 Correct 2 ms 12632 KB Output is correct
21 Correct 2 ms 12632 KB Output is correct
22 Correct 3 ms 12632 KB Output is correct
23 Correct 2 ms 12632 KB Output is correct
24 Correct 2 ms 12632 KB Output is correct
25 Correct 2 ms 12632 KB Output is correct
26 Correct 2 ms 12632 KB Output is correct
27 Correct 14 ms 16984 KB Output is correct
28 Correct 14 ms 16984 KB Output is correct
29 Correct 11 ms 16984 KB Output is correct
30 Correct 11 ms 16980 KB Output is correct
31 Correct 11 ms 16984 KB Output is correct
32 Correct 2 ms 12632 KB Output is correct
33 Correct 61 ms 79496 KB Output is correct
34 Correct 154 ms 120372 KB Output is correct
35 Correct 133 ms 121780 KB Output is correct
36 Correct 138 ms 120380 KB Output is correct
37 Correct 152 ms 121048 KB Output is correct
38 Correct 130 ms 122244 KB Output is correct
39 Correct 1 ms 12632 KB Output is correct
40 Correct 2 ms 12632 KB Output is correct
41 Correct 2 ms 12632 KB Output is correct
42 Correct 177 ms 66904 KB Output is correct
43 Correct 726 ms 120508 KB Output is correct
44 Correct 407 ms 33600 KB Output is correct
45 Correct 761 ms 120528 KB Output is correct
46 Correct 387 ms 52312 KB Output is correct
47 Correct 686 ms 120600 KB Output is correct
48 Correct 837 ms 122044 KB Output is correct
49 Correct 822 ms 122108 KB Output is correct
50 Correct 853 ms 121800 KB Output is correct
51 Correct 721 ms 120140 KB Output is correct
52 Correct 843 ms 121048 KB Output is correct
53 Correct 669 ms 122040 KB Output is correct
54 Correct 694 ms 121780 KB Output is correct
55 Correct 2 ms 12632 KB Output is correct
56 Correct 167 ms 120072 KB Output is correct
57 Correct 789 ms 120604 KB Output is correct
58 Correct 304 ms 33624 KB Output is correct
59 Correct 762 ms 120248 KB Output is correct
60 Correct 288 ms 54492 KB Output is correct
61 Correct 714 ms 120376 KB Output is correct
62 Correct 940 ms 121968 KB Output is correct
63 Correct 848 ms 121680 KB Output is correct
64 Correct 848 ms 121428 KB Output is correct
65 Correct 695 ms 120268 KB Output is correct
66 Correct 910 ms 121224 KB Output is correct
67 Correct 776 ms 122024 KB Output is correct
68 Correct 699 ms 121788 KB Output is correct
69 Correct 2 ms 12632 KB Output is correct
70 Correct 2 ms 12632 KB Output is correct
71 Correct 3 ms 12632 KB Output is correct
72 Correct 3 ms 12632 KB Output is correct
73 Correct 3 ms 12632 KB Output is correct
74 Correct 3 ms 12632 KB Output is correct
75 Correct 3 ms 12632 KB Output is correct
76 Correct 2 ms 12632 KB Output is correct
77 Correct 2 ms 12632 KB Output is correct
78 Correct 2 ms 12632 KB Output is correct
79 Correct 2 ms 12632 KB Output is correct
80 Correct 2 ms 12632 KB Output is correct
81 Correct 2 ms 12632 KB Output is correct
82 Correct 3 ms 12632 KB Output is correct
83 Correct 4 ms 12632 KB Output is correct
84 Correct 2 ms 12632 KB Output is correct
85 Correct 3 ms 12632 KB Output is correct
86 Correct 13 ms 16984 KB Output is correct
87 Correct 12 ms 16984 KB Output is correct
88 Correct 12 ms 16984 KB Output is correct
89 Correct 11 ms 16984 KB Output is correct
90 Correct 10 ms 16984 KB Output is correct
91 Correct 2 ms 12632 KB Output is correct
92 Correct 2 ms 12632 KB Output is correct
93 Correct 12 ms 16808 KB Output is correct
94 Correct 13 ms 16984 KB Output is correct
95 Correct 12 ms 16984 KB Output is correct
96 Correct 13 ms 17236 KB Output is correct
97 Correct 15 ms 16984 KB Output is correct
98 Correct 3 ms 12632 KB Output is correct
99 Correct 138 ms 120260 KB Output is correct
100 Correct 142 ms 120396 KB Output is correct
101 Correct 145 ms 121636 KB Output is correct
102 Correct 144 ms 120376 KB Output is correct
103 Correct 136 ms 121144 KB Output is correct
104 Correct 159 ms 121820 KB Output is correct
105 Correct 2 ms 12884 KB Output is correct
106 Correct 60 ms 79480 KB Output is correct
107 Correct 144 ms 120248 KB Output is correct
108 Correct 134 ms 121796 KB Output is correct
109 Correct 146 ms 120760 KB Output is correct
110 Correct 152 ms 121036 KB Output is correct
111 Correct 128 ms 122040 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12632 KB Output is correct
2 Correct 2 ms 12632 KB Output is correct
3 Correct 188 ms 105648 KB Output is correct
4 Correct 923 ms 121800 KB Output is correct
5 Correct 727 ms 71768 KB Output is correct
6 Correct 940 ms 122064 KB Output is correct
7 Correct 699 ms 93272 KB Output is correct
8 Correct 932 ms 122028 KB Output is correct
9 Correct 2 ms 12632 KB Output is correct
10 Correct 2 ms 12632 KB Output is correct
11 Correct 2 ms 12632 KB Output is correct
12 Correct 2 ms 12744 KB Output is correct
13 Correct 2 ms 12628 KB Output is correct
14 Correct 3 ms 12632 KB Output is correct
15 Correct 2 ms 12632 KB Output is correct
16 Correct 3 ms 12632 KB Output is correct
17 Correct 2 ms 12740 KB Output is correct
18 Correct 2 ms 12632 KB Output is correct
19 Correct 3 ms 12632 KB Output is correct
20 Correct 2 ms 12632 KB Output is correct
21 Incorrect 2 ms 12632 KB Output isn't correct
22 Halted 0 ms 0 KB -