oj.uz

Submission #649884

# Submission time Handle Problem Language Result Execution time Memory
649884 2022-10-11T14:09:02 Z ToroTN Rainforest Jumps (APIO21_jumps) C++14
48 / 100
 1357 ms 84732 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;
    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 0 ms 336 KB Output is correct
3 Correct 248 ms 67728 KB Output is correct
4 Correct 1333 ms 84552 KB Output is correct
5 Correct 871 ms 42680 KB Output is correct
6 Correct 1219 ms 84548 KB Output is correct
7 Correct 882 ms 58468 KB Output is correct
8 Correct 1206 ms 84524 KB Output is correct

Subtask #2
0 / 8.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 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 2 ms 336 KB Output is correct
6 Incorrect 3 ms 336 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 13.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 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 2 ms 336 KB Output is correct
6 Incorrect 3 ms 336 KB Output isn't correct
7 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 1 ms 336 KB Output is correct
5 Correct 138 ms 67228 KB Output is correct
6 Correct 160 ms 82904 KB Output is correct
7 Correct 87 ms 42584 KB Output is correct
8 Correct 157 ms 82856 KB Output is correct
9 Correct 26 ms 12688 KB Output is correct
10 Correct 153 ms 82972 KB Output is correct
11 Correct 171 ms 84624 KB Output is correct
12 Correct 171 ms 84028 KB Output is correct
13 Correct 165 ms 84056 KB Output is correct
14 Correct 161 ms 82984 KB Output is correct
15 Incorrect 210 ms 83540 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 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 239 ms 38212 KB Output is correct
5 Correct 1357 ms 82980 KB Output is correct
6 Correct 812 ms 14100 KB Output is correct
7 Correct 944 ms 82980 KB Output is correct
8 Correct 677 ms 29136 KB Output is correct
9 Correct 1186 ms 82976 KB Output is correct
10 Correct 1194 ms 84524 KB Output is correct
11 Correct 1210 ms 84152 KB Output is correct
12 Correct 1234 ms 84424 KB Output is correct
13 Correct 1221 ms 82984 KB Output is correct
14 Correct 1285 ms 83556 KB Output is correct
15 Correct 1126 ms 84608 KB Output is correct
16 Correct 1207 ms 84552 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 2 ms 336 KB Output is correct
21 Correct 4 ms 336 KB Output is correct
22 Correct 3 ms 336 KB Output is correct
23 Correct 3 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 2 ms 592 KB Output is correct
27 Correct 22 ms 1104 KB Output is correct
28 Correct 23 ms 1104 KB Output is correct
29 Correct 23 ms 1104 KB Output is correct
30 Correct 18 ms 1104 KB Output is correct
31 Correct 22 ms 1104 KB Output is correct
32 Correct 0 ms 336 KB Output is correct
33 Correct 94 ms 48040 KB Output is correct
34 Correct 164 ms 82976 KB Output is correct
35 Correct 158 ms 84376 KB Output is correct
36 Correct 170 ms 82876 KB Output is correct
37 Correct 183 ms 83556 KB Output is correct
38 Correct 161 ms 84612 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 239 ms 38212 KB Output is correct
5 Correct 1357 ms 82980 KB Output is correct
6 Correct 812 ms 14100 KB Output is correct
7 Correct 944 ms 82980 KB Output is correct
8 Correct 677 ms 29136 KB Output is correct
9 Correct 1186 ms 82976 KB Output is correct
10 Correct 1194 ms 84524 KB Output is correct
11 Correct 1210 ms 84152 KB Output is correct
12 Correct 1234 ms 84424 KB Output is correct
13 Correct 1221 ms 82984 KB Output is correct
14 Correct 1285 ms 83556 KB Output is correct
15 Correct 1126 ms 84608 KB Output is correct
16 Correct 1207 ms 84552 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 2 ms 336 KB Output is correct
21 Correct 4 ms 336 KB Output is correct
22 Correct 3 ms 336 KB Output is correct
23 Correct 3 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 2 ms 592 KB Output is correct
27 Correct 22 ms 1104 KB Output is correct
28 Correct 23 ms 1104 KB Output is correct
29 Correct 23 ms 1104 KB Output is correct
30 Correct 18 ms 1104 KB Output is correct
31 Correct 22 ms 1104 KB Output is correct
32 Correct 0 ms 336 KB Output is correct
33 Correct 94 ms 48040 KB Output is correct
34 Correct 164 ms 82976 KB Output is correct
35 Correct 158 ms 84376 KB Output is correct
36 Correct 170 ms 82876 KB Output is correct
37 Correct 183 ms 83556 KB Output is correct
38 Correct 161 ms 84612 KB Output is correct
39 Correct 0 ms 336 KB Output is correct
40 Correct 0 ms 336 KB Output is correct
41 Correct 1 ms 336 KB Output is correct
42 Correct 292 ms 38220 KB Output is correct
43 Correct 1196 ms 82900 KB Output is correct
44 Correct 757 ms 14128 KB Output is correct
45 Correct 1207 ms 82852 KB Output is correct
46 Correct 678 ms 29136 KB Output is correct
47 Correct 1077 ms 82888 KB Output is correct
48 Correct 1111 ms 84552 KB Output is correct
49 Correct 1157 ms 84212 KB Output is correct
50 Correct 1070 ms 84408 KB Output is correct
51 Correct 933 ms 82976 KB Output is correct
52 Correct 1163 ms 83584 KB Output is correct
53 Correct 1222 ms 84680 KB Output is correct
54 Correct 1260 ms 84512 KB Output is correct
55 Correct 1 ms 336 KB Output is correct
56 Correct 328 ms 82664 KB Output is correct
57 Correct 763 ms 82856 KB Output is correct
58 Correct 533 ms 15048 KB Output is correct
59 Correct 1154 ms 82976 KB Output is correct
60 Correct 484 ms 29892 KB Output is correct
61 Correct 1187 ms 82852 KB Output is correct
62 Correct 1340 ms 84664 KB Output is correct
63 Correct 1222 ms 84036 KB Output is correct
64 Correct 1054 ms 84132 KB Output is correct
65 Correct 1037 ms 82872 KB Output is correct
66 Correct 1223 ms 83556 KB Output is correct
67 Correct 1125 ms 84540 KB Output is correct
68 Correct 1156 ms 84508 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 3 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 2 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 3 ms 336 KB Output is correct
83 Correct 3 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 22 ms 1104 KB Output is correct
87 Correct 22 ms 1104 KB Output is correct
88 Correct 23 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 348 KB Output is correct
92 Correct 1 ms 592 KB Output is correct
93 Correct 19 ms 1104 KB Output is correct
94 Correct 20 ms 1104 KB Output is correct
95 Correct 17 ms 1104 KB Output is correct
96 Correct 19 ms 1104 KB Output is correct
97 Correct 17 ms 1104 KB Output is correct
98 Correct 0 ms 336 KB Output is correct
99 Correct 157 ms 82712 KB Output is correct
100 Correct 162 ms 82884 KB Output is correct
101 Correct 176 ms 84168 KB Output is correct
102 Correct 158 ms 82876 KB Output is correct
103 Correct 186 ms 83576 KB Output is correct
104 Correct 174 ms 84552 KB Output is correct
105 Correct 1 ms 336 KB Output is correct
106 Correct 91 ms 48032 KB Output is correct
107 Correct 173 ms 82872 KB Output is correct
108 Correct 212 ms 84268 KB Output is correct
109 Correct 156 ms 82972 KB Output is correct
110 Correct 185 ms 83572 KB Output is correct
111 Correct 163 ms 84732 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 248 ms 67728 KB Output is correct
4 Correct 1333 ms 84552 KB Output is correct
5 Correct 871 ms 42680 KB Output is correct
6 Correct 1219 ms 84548 KB Output is correct
7 Correct 882 ms 58468 KB Output is correct
8 Correct 1206 ms 84524 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 0 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 2 ms 336 KB Output is correct
14 Incorrect 3 ms 336 KB Output isn't correct
15 Halted 0 ms 0 KB -