oj.uz

Submission #649885

# Submission time Handle Problem Language Result Execution time Memory
649885 2022-10-11T14:12:41 Z ToroTN Rainforest Jumps (APIO21_jumps) C++14
48 / 100
 1388 ms 84708 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;
    //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)
            {
                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 1 ms 336 KB Output is correct
3 Correct 247 ms 67848 KB Output is correct
4 Correct 1128 ms 84628 KB Output is correct
5 Correct 807 ms 42696 KB Output is correct
6 Correct 1388 ms 84620 KB Output is correct
7 Correct 1071 ms 58696 KB Output is correct
8 Correct 1261 ms 84552 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 3 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 2 ms 336 KB Output is correct
9 Correct 1 ms 296 KB Output is correct
10 Incorrect 3 ms 336 KB Output isn't correct
11 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 3 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 2 ms 336 KB Output is correct
9 Correct 1 ms 296 KB Output is correct
10 Incorrect 3 ms 336 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 336 KB Output is correct
5 Correct 127 ms 67224 KB Output is correct
6 Correct 156 ms 82868 KB Output is correct
7 Correct 82 ms 42568 KB Output is correct
8 Correct 162 ms 82980 KB Output is correct
9 Correct 24 ms 12624 KB Output is correct
10 Correct 160 ms 82852 KB Output is correct
11 Correct 171 ms 84628 KB Output is correct
12 Correct 169 ms 84136 KB Output is correct
13 Correct 164 ms 84148 KB Output is correct
14 Correct 163 ms 82968 KB Output is correct
15 Incorrect 199 ms 83704 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 238 ms 38212 KB Output is correct
5 Correct 1000 ms 82980 KB Output is correct
6 Correct 696 ms 14032 KB Output is correct
7 Correct 1219 ms 83016 KB Output is correct
8 Correct 525 ms 29152 KB Output is correct
9 Correct 1212 ms 82984 KB Output is correct
10 Correct 985 ms 84648 KB Output is correct
11 Correct 1246 ms 84084 KB Output is correct
12 Correct 1181 ms 84396 KB Output is correct
13 Correct 922 ms 82980 KB Output is correct
14 Correct 1356 ms 83572 KB Output is correct
15 Correct 1141 ms 84524 KB Output is correct
16 Correct 1260 ms 84548 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 3 ms 336 KB Output is correct
23 Correct 2 ms 336 KB Output is correct
24 Correct 3 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 23 ms 1104 KB Output is correct
28 Correct 24 ms 1104 KB Output is correct
29 Correct 17 ms 1104 KB Output is correct
30 Correct 18 ms 1116 KB Output is correct
31 Correct 23 ms 1104 KB Output is correct
32 Correct 0 ms 336 KB Output is correct
33 Correct 92 ms 48028 KB Output is correct
34 Correct 157 ms 82860 KB Output is correct
35 Correct 163 ms 84404 KB Output is correct
36 Correct 158 ms 82976 KB Output is correct
37 Correct 186 ms 83528 KB Output is correct
38 Correct 161 ms 84584 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 238 ms 38212 KB Output is correct
5 Correct 1000 ms 82980 KB Output is correct
6 Correct 696 ms 14032 KB Output is correct
7 Correct 1219 ms 83016 KB Output is correct
8 Correct 525 ms 29152 KB Output is correct
9 Correct 1212 ms 82984 KB Output is correct
10 Correct 985 ms 84648 KB Output is correct
11 Correct 1246 ms 84084 KB Output is correct
12 Correct 1181 ms 84396 KB Output is correct
13 Correct 922 ms 82980 KB Output is correct
14 Correct 1356 ms 83572 KB Output is correct
15 Correct 1141 ms 84524 KB Output is correct
16 Correct 1260 ms 84548 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 3 ms 336 KB Output is correct
23 Correct 2 ms 336 KB Output is correct
24 Correct 3 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 23 ms 1104 KB Output is correct
28 Correct 24 ms 1104 KB Output is correct
29 Correct 17 ms 1104 KB Output is correct
30 Correct 18 ms 1116 KB Output is correct
31 Correct 23 ms 1104 KB Output is correct
32 Correct 0 ms 336 KB Output is correct
33 Correct 92 ms 48028 KB Output is correct
34 Correct 157 ms 82860 KB Output is correct
35 Correct 163 ms 84404 KB Output is correct
36 Correct 158 ms 82976 KB Output is correct
37 Correct 186 ms 83528 KB Output is correct
38 Correct 161 ms 84584 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 190 ms 38224 KB Output is correct
43 Correct 1216 ms 82976 KB Output is correct
44 Correct 782 ms 14184 KB Output is correct
45 Correct 855 ms 82976 KB Output is correct
46 Correct 607 ms 29000 KB Output is correct
47 Correct 919 ms 82888 KB Output is correct
48 Correct 1094 ms 84708 KB Output is correct
49 Correct 1185 ms 84088 KB Output is correct
50 Correct 909 ms 84292 KB Output is correct
51 Correct 824 ms 82976 KB Output is correct
52 Correct 1265 ms 83556 KB Output is correct
53 Correct 1162 ms 84628 KB Output is correct
54 Correct 1116 ms 84648 KB Output is correct
55 Correct 0 ms 336 KB Output is correct
56 Correct 200 ms 82728 KB Output is correct
57 Correct 820 ms 82996 KB Output is correct
58 Correct 638 ms 14928 KB Output is correct
59 Correct 1012 ms 83016 KB Output is correct
60 Correct 332 ms 29956 KB Output is correct
61 Correct 1183 ms 82984 KB Output is correct
62 Correct 1304 ms 84552 KB Output is correct
63 Correct 1253 ms 83992 KB Output is correct
64 Correct 1115 ms 84020 KB Output is correct
65 Correct 928 ms 83016 KB Output is correct
66 Correct 1242 ms 83576 KB Output is correct
67 Correct 946 ms 84520 KB Output is correct
68 Correct 1211 ms 84524 KB Output is correct
69 Correct 0 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 2 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 2 ms 336 KB Output is correct
81 Correct 2 ms 336 KB Output is correct
82 Correct 3 ms 336 KB Output is correct
83 Correct 2 ms 336 KB Output is correct
84 Correct 0 ms 336 KB Output is correct
85 Correct 3 ms 336 KB Output is correct
86 Correct 22 ms 1104 KB Output is correct
87 Correct 17 ms 1104 KB Output is correct
88 Correct 24 ms 1104 KB Output is correct
89 Correct 19 ms 1104 KB Output is correct
90 Correct 20 ms 1104 KB Output is correct
91 Correct 1 ms 336 KB Output is correct
92 Correct 1 ms 592 KB Output is correct
93 Correct 10 ms 1104 KB Output is correct
94 Correct 22 ms 1104 KB Output is correct
95 Correct 18 ms 1104 KB Output is correct
96 Correct 20 ms 1104 KB Output is correct
97 Correct 15 ms 1104 KB Output is correct
98 Correct 1 ms 336 KB Output is correct
99 Correct 157 ms 82752 KB Output is correct
100 Correct 157 ms 82984 KB Output is correct
101 Correct 176 ms 84276 KB Output is correct
102 Correct 165 ms 82884 KB Output is correct
103 Correct 189 ms 83556 KB Output is correct
104 Correct 175 ms 84544 KB Output is correct
105 Correct 0 ms 336 KB Output is correct
106 Correct 104 ms 47992 KB Output is correct
107 Correct 160 ms 82980 KB Output is correct
108 Correct 164 ms 84492 KB Output is correct
109 Correct 168 ms 82980 KB Output is correct
110 Correct 215 ms 83544 KB Output is correct
111 Correct 159 ms 84648 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 1 ms 336 KB Output is correct
3 Correct 247 ms 67848 KB Output is correct
4 Correct 1128 ms 84628 KB Output is correct
5 Correct 807 ms 42696 KB Output is correct
6 Correct 1388 ms 84620 KB Output is correct
7 Correct 1071 ms 58696 KB Output is correct
8 Correct 1261 ms 84552 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 3 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 2 ms 336 KB Output is correct
17 Correct 1 ms 296 KB Output is correct
18 Incorrect 3 ms 336 KB Output isn't correct
19 Halted 0 ms 0 KB -