oj.uz

Submission #649892

# Submission time Handle Problem Language Result Execution time Memory
649892 2022-10-11T14:37:06 Z ToroTN Rainforest Jumps (APIO21_jumps) C++14
48 / 100
 1612 ms 84680 KB 
#include "jumps.h"
#include<bits/stdc++.h>
using namespace std;
#define X first
#define Y second
#include <vector>
int n,h[200005],l[200005][25],r[200005][25],a,b,c,d,mx,node,cnt;
int low[200005][25],high[200005][25],seg[800005],ans;
stack<pair<int,int> > stk;
void build(int tree,int st,int ed)
{
    int md=(st+ed)/2;
    if(st==ed)
    {
        seg[tree]=h[st];
        return;
    }
    build(2*tree,st,md);
    build(2*tree+1,md+1,ed);
    seg[tree]=max(seg[2*tree],seg[2*tree+1]);
}
int query(int tree,int st,int ed,int l,int r)
{
    int md=(st+ed)/2;
    if(st>r||ed<l)return -1e9;
    if(st>=l&&ed<=r)return seg[tree];
    return max(query(2*tree,st,md,l,r),query(2*tree+1,md+1,ed,l,r));
}
void debug(int tree,int st,int ed)
{
    int md=(st+ed)/2;
    if(st==ed)
    {
        printf("%d %d %d %d\n",tree,st,ed,seg[tree]);
        return;
    }
    debug(2*tree,st,md);
    debug(2*tree+1,md+1,ed);
    printf("%d %d %d %d\n",tree,st,ed,seg[tree]);
}
void init(int N, std::vector<int> H) {
    n=N;
    for(int i=1;i<=n;i++)
    {
        h[i]=H[i-1];
    }
    build(1,1,n);
    //debug(1,1,n);
    for(int i=1;i<=n;i++)
    {
        while(!stk.empty())
        {
            if(stk.top().X>h[i])
            {
                break;
            }else
            {
                r[stk.top().Y][0]=i;
                stk.pop();
            }
        }
        stk.push({h[i],i});
    }
    while(!stk.empty())
    {
        stk.pop();
    }
    for(int i=n;i>=1;i--)
    {
        while(!stk.empty())
        {
            if(stk.top().X>h[i])
            {
                break;
            }else
            {
                l[stk.top().Y][0]=i;
                stk.pop();
            }
        }
        stk.push({h[i],i});
    }
    while(!stk.empty())
    {
        stk.pop();
    }
    for(int i=1;i<=n;i++)
    {
        if(l[i][0]!=0&&r[i][0]!=0)
        {
            low[i][0]=l[i][0];
            high[i][0]=r[i][0];
            if(h[l[i][0]]>h[r[i][0]])swap(low[i][0],high[i][0]);
        }else if(l[i][0]!=0||r[i][0]!=0)
        {
            low[i][0]=high[i][0]=max(l[i][0],r[i][0]);
        }
    }
    for(int i=1;i<=20;i++)
    {
        for(int j=1;j<=n;j++)
        {
            l[j][i]=l[l[j][i-1]][i-1];
            r[j][i]=r[r[j][i-1]][i-1];
            low[j][i]=low[low[j][i-1]][i-1];
            high[j][i]=high[high[j][i-1]][i-1];
        }
    }
    // for(int j=0;j<=20;j++)
    // {
    //     printf("%d\n",j);
    //     for(int i=1;i<=n;i++)
    //     {
    //         printf("%d ",r[i][j]);
    //     }
    //     printf("\n");
    //     for(int i=1;i<=n;i++)
    //     {
    //         printf("%d ",l[i][j]);
    //     }
    //     printf("\n");
    //     for(int i=1;i<=n;i++)
    //     {
    //         printf("%d ",low[i][j]);
    //     }
    //     printf("\n");
    //     for(int i=1;i<=n;i++)
    //     {
    //         printf("%d ",high[i][j]);
    //     }
    //     printf("\n");
    // }
}
int minimum_jumps(int A, int B, int C, int D) {
    a=A+1;
    b=B+1;
    c=C+1;
    d=D+1;
    mx=query(1,1,n,c,d);
    node=b;
    if(r[node][0]>=c&&r[node][0]<=d)return 1;
    //printf("mx=%d\n",mx);
    //printf("%d\n",node);
    for(int i=20;i>=0;i--)
    {
        if(l[node][i]!=0)
        {
            if(h[l[node][i]]<mx&&l[node][i]>=a)
            {
                node=l[node][i];
            }
        }
    }
    //printf("%d %d\n",node,ans);
    ans=0;
    if(r[node][0]>=c&&r[node][0]<=d)return ans+1;
    for(int i=20;i>=0;i--)
    {
        if(high[node][i]!=0)
        {
            //printf("high=%d %d\n",i,high[node][i]);
            if(h[high[node][i]]<mx&&high[node][i]<c&&r[node][i]<c&&r[node][i]!=0)
            {
                node=high[node][i];
                ans+=(1<<i);
            }
        }
    }
    //printf("%d %d\n",node,ans);
    if(r[node][0]>=c&&r[node][0]<=d)return ans+1;
    for(int i=20;i>=0;i--)
    {
        if(low[node][i]!=0)
        {
            if(h[low[node][i]]<mx&&low[node][i]<c)
            {
                node=low[node][i];
                ans+=(1<<i);
            }
        }
    }
    //printf("%d %d\n",node,ans);
    ans+=1;
    node=r[node][0];
    if(node>=c&&node<=d)
    {
        return ans;
    }
    return -1;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 236 ms 67860 KB Output is correct
4 Correct 1264 ms 84628 KB Output is correct
5 Correct 954 ms 42828 KB Output is correct
6 Correct 1612 ms 84648 KB Output is correct
7 Correct 977 ms 58564 KB Output is correct
8 Correct 1222 ms 84652 KB Output is correct

Subtask #2
0 / 8.0

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

Subtask #3
0 / 13.0

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

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 125 ms 67144 KB Output is correct
6 Correct 161 ms 82976 KB Output is correct
7 Correct 91 ms 42644 KB Output is correct
8 Correct 167 ms 83072 KB Output is correct
9 Correct 23 ms 12624 KB Output is correct
10 Correct 165 ms 82980 KB Output is correct
11 Correct 171 ms 84540 KB Output is correct
12 Correct 162 ms 84132 KB Output is correct
13 Correct 175 ms 84088 KB Output is correct
14 Correct 161 ms 82856 KB Output is correct
15 Incorrect 205 ms 83576 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 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 313 ms 38216 KB Output is correct
5 Correct 1035 ms 83092 KB Output is correct
6 Correct 592 ms 14124 KB Output is correct
7 Correct 848 ms 82976 KB Output is correct
8 Correct 694 ms 29136 KB Output is correct
9 Correct 1113 ms 82976 KB Output is correct
10 Correct 1236 ms 84552 KB Output is correct
11 Correct 1095 ms 84064 KB Output is correct
12 Correct 1119 ms 84392 KB Output is correct
13 Correct 968 ms 82976 KB Output is correct
14 Correct 1220 ms 83572 KB Output is correct
15 Correct 1078 ms 84524 KB Output is correct
16 Correct 1153 ms 84624 KB Output is correct
17 Correct 0 ms 336 KB Output is correct
18 Correct 0 ms 336 KB Output is correct
19 Correct 2 ms 336 KB Output is correct
20 Correct 3 ms 336 KB Output is correct
21 Correct 3 ms 336 KB Output is correct
22 Correct 2 ms 336 KB Output is correct
23 Correct 2 ms 336 KB Output is correct
24 Correct 2 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 592 KB Output is correct
27 Correct 21 ms 1104 KB Output is correct
28 Correct 21 ms 1104 KB Output is correct
29 Correct 16 ms 1104 KB Output is correct
30 Correct 19 ms 1104 KB Output is correct
31 Correct 20 ms 1104 KB Output is correct
32 Correct 0 ms 336 KB Output is correct
33 Correct 94 ms 47916 KB Output is correct
34 Correct 163 ms 82876 KB Output is correct
35 Correct 165 ms 84292 KB Output is correct
36 Correct 158 ms 82980 KB Output is correct
37 Correct 198 ms 83656 KB Output is correct
38 Correct 160 ms 84540 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 313 ms 38216 KB Output is correct
5 Correct 1035 ms 83092 KB Output is correct
6 Correct 592 ms 14124 KB Output is correct
7 Correct 848 ms 82976 KB Output is correct
8 Correct 694 ms 29136 KB Output is correct
9 Correct 1113 ms 82976 KB Output is correct
10 Correct 1236 ms 84552 KB Output is correct
11 Correct 1095 ms 84064 KB Output is correct
12 Correct 1119 ms 84392 KB Output is correct
13 Correct 968 ms 82976 KB Output is correct
14 Correct 1220 ms 83572 KB Output is correct
15 Correct 1078 ms 84524 KB Output is correct
16 Correct 1153 ms 84624 KB Output is correct
17 Correct 0 ms 336 KB Output is correct
18 Correct 0 ms 336 KB Output is correct
19 Correct 2 ms 336 KB Output is correct
20 Correct 3 ms 336 KB Output is correct
21 Correct 3 ms 336 KB Output is correct
22 Correct 2 ms 336 KB Output is correct
23 Correct 2 ms 336 KB Output is correct
24 Correct 2 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 592 KB Output is correct
27 Correct 21 ms 1104 KB Output is correct
28 Correct 21 ms 1104 KB Output is correct
29 Correct 16 ms 1104 KB Output is correct
30 Correct 19 ms 1104 KB Output is correct
31 Correct 20 ms 1104 KB Output is correct
32 Correct 0 ms 336 KB Output is correct
33 Correct 94 ms 47916 KB Output is correct
34 Correct 163 ms 82876 KB Output is correct
35 Correct 165 ms 84292 KB Output is correct
36 Correct 158 ms 82980 KB Output is correct
37 Correct 198 ms 83656 KB Output is correct
38 Correct 160 ms 84540 KB Output is correct
39 Correct 0 ms 336 KB Output is correct
40 Correct 0 ms 336 KB Output is correct
41 Correct 0 ms 336 KB Output is correct
42 Correct 321 ms 38216 KB Output is correct
43 Correct 1111 ms 82988 KB Output is correct
44 Correct 656 ms 14036 KB Output is correct
45 Correct 974 ms 82976 KB Output is correct
46 Correct 633 ms 29136 KB Output is correct
47 Correct 789 ms 82976 KB Output is correct
48 Correct 1149 ms 84624 KB Output is correct
49 Correct 1368 ms 84160 KB Output is correct
50 Correct 1402 ms 84296 KB Output is correct
51 Correct 1064 ms 82880 KB Output is correct
52 Correct 1025 ms 83556 KB Output is correct
53 Correct 1099 ms 84520 KB Output is correct
54 Correct 1107 ms 84544 KB Output is correct
55 Correct 0 ms 336 KB Output is correct
56 Correct 215 ms 82724 KB Output is correct
57 Correct 1030 ms 83000 KB Output is correct
58 Correct 400 ms 14928 KB Output is correct
59 Correct 1065 ms 82976 KB Output is correct
60 Correct 481 ms 29904 KB Output is correct
61 Correct 874 ms 82984 KB Output is correct
62 Correct 1139 ms 84628 KB Output is correct
63 Correct 1216 ms 83980 KB Output is correct
64 Correct 1144 ms 83912 KB Output is correct
65 Correct 881 ms 83028 KB Output is correct
66 Correct 1160 ms 83492 KB Output is correct
67 Correct 1016 ms 84680 KB Output is correct
68 Correct 1190 ms 84524 KB Output is correct
69 Correct 1 ms 336 KB Output is correct
70 Correct 1 ms 336 KB Output is correct
71 Correct 2 ms 336 KB Output is correct
72 Correct 2 ms 336 KB Output is correct
73 Correct 2 ms 336 KB Output is correct
74 Correct 2 ms 336 KB Output is correct
75 Correct 3 ms 336 KB Output is correct
76 Correct 0 ms 336 KB Output is correct
77 Correct 0 ms 336 KB Output is correct
78 Correct 2 ms 336 KB Output is correct
79 Correct 3 ms 336 KB Output is correct
80 Correct 3 ms 336 KB Output is correct
81 Correct 2 ms 336 KB Output is correct
82 Correct 2 ms 336 KB Output is correct
83 Correct 2 ms 336 KB Output is correct
84 Correct 1 ms 336 KB Output is correct
85 Correct 4 ms 336 KB Output is correct
86 Correct 19 ms 1104 KB Output is correct
87 Correct 18 ms 1104 KB Output is correct
88 Correct 22 ms 1104 KB Output is correct
89 Correct 24 ms 1104 KB Output is correct
90 Correct 19 ms 1104 KB Output is correct
91 Correct 0 ms 336 KB Output is correct
92 Correct 1 ms 592 KB Output is correct
93 Correct 21 ms 1104 KB Output is correct
94 Correct 20 ms 1104 KB Output is correct
95 Correct 22 ms 1104 KB Output is correct
96 Correct 18 ms 1104 KB Output is correct
97 Correct 21 ms 1104 KB Output is correct
98 Correct 0 ms 336 KB Output is correct
99 Correct 161 ms 82872 KB Output is correct
100 Correct 159 ms 82876 KB Output is correct
101 Correct 158 ms 84104 KB Output is correct
102 Correct 156 ms 82888 KB Output is correct
103 Correct 186 ms 83544 KB Output is correct
104 Correct 162 ms 84516 KB Output is correct
105 Correct 0 ms 336 KB Output is correct
106 Correct 94 ms 47928 KB Output is correct
107 Correct 162 ms 82868 KB Output is correct
108 Correct 166 ms 84260 KB Output is correct
109 Correct 171 ms 82888 KB Output is correct
110 Correct 187 ms 83652 KB Output is correct
111 Correct 163 ms 84680 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 236 ms 67860 KB Output is correct
4 Correct 1264 ms 84628 KB Output is correct
5 Correct 954 ms 42828 KB Output is correct
6 Correct 1612 ms 84648 KB Output is correct
7 Correct 977 ms 58564 KB Output is correct
8 Correct 1222 ms 84652 KB Output is correct
9 Correct 0 ms 336 KB Output is correct
10 Correct 0 ms 336 KB Output is correct
11 Correct 0 ms 336 KB Output is correct
12 Correct 0 ms 336 KB Output is correct
13 Correct 2 ms 336 KB Output is correct
14 Correct 3 ms 336 KB Output is correct
15 Correct 2 ms 336 KB Output is correct
16 Correct 3 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 2 ms 336 KB Output is correct
19 Correct 3 ms 336 KB Output is correct
20 Correct 3 ms 336 KB Output is correct
21 Correct 3 ms 336 KB Output is correct
22 Correct 2 ms 336 KB Output is correct
23 Incorrect 2 ms 336 KB Output isn't correct
24 Halted 0 ms 0 KB -