oj.uz

Submission #649898

# Submission time Handle Problem Language Result Execution time Memory
649898 2022-10-11T14:57:19 Z ToroTN Rainforest Jumps (APIO21_jumps) C++14
48 / 100
 1347 ms 84740 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[high[node][i]][0]<=d&&r[high[node][i]][0]!=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 245 ms 67748 KB Output is correct
4 Correct 1188 ms 84616 KB Output is correct
5 Correct 816 ms 42764 KB Output is correct
6 Correct 1247 ms 84640 KB Output is correct
7 Correct 853 ms 58584 KB Output is correct
8 Correct 1245 ms 84740 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 1 ms 336 KB Output is correct
5 Correct 2 ms 336 KB Output is correct
6 Correct 2 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 Incorrect 2 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 1 ms 336 KB Output is correct
5 Correct 2 ms 336 KB Output is correct
6 Correct 2 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 Incorrect 2 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 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 129 ms 67244 KB Output is correct
6 Correct 163 ms 82852 KB Output is correct
7 Correct 82 ms 42552 KB Output is correct
8 Correct 159 ms 82856 KB Output is correct
9 Correct 23 ms 12848 KB Output is correct
10 Correct 164 ms 82976 KB Output is correct
11 Correct 172 ms 84520 KB Output is correct
12 Correct 162 ms 83992 KB Output is correct
13 Correct 160 ms 84148 KB Output is correct
14 Correct 154 ms 82984 KB Output is correct
15 Incorrect 199 ms 83468 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 1 ms 336 KB Output is correct
4 Correct 293 ms 38236 KB Output is correct
5 Correct 1119 ms 82888 KB Output is correct
6 Correct 724 ms 14032 KB Output is correct
7 Correct 919 ms 82984 KB Output is correct
8 Correct 664 ms 29100 KB Output is correct
9 Correct 1276 ms 82976 KB Output is correct
10 Correct 1150 ms 84528 KB Output is correct
11 Correct 1122 ms 84084 KB Output is correct
12 Correct 1069 ms 84380 KB Output is correct
13 Correct 967 ms 83016 KB Output is correct
14 Correct 1225 ms 83576 KB Output is correct
15 Correct 1248 ms 84552 KB Output is correct
16 Correct 1298 ms 84552 KB Output is correct
17 Correct 0 ms 336 KB Output is correct
18 Correct 1 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 3 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 3 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 24 ms 1104 KB Output is correct
28 Correct 16 ms 1104 KB Output is correct
29 Correct 13 ms 1104 KB Output is correct
30 Correct 16 ms 1104 KB Output is correct
31 Correct 19 ms 1104 KB Output is correct
32 Correct 0 ms 336 KB Output is correct
33 Correct 94 ms 48028 KB Output is correct
34 Correct 159 ms 82980 KB Output is correct
35 Correct 171 ms 84296 KB Output is correct
36 Correct 159 ms 82980 KB Output is correct
37 Correct 205 ms 83520 KB Output is correct
38 Correct 176 ms 84536 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 1 ms 336 KB Output is correct
4 Correct 293 ms 38236 KB Output is correct
5 Correct 1119 ms 82888 KB Output is correct
6 Correct 724 ms 14032 KB Output is correct
7 Correct 919 ms 82984 KB Output is correct
8 Correct 664 ms 29100 KB Output is correct
9 Correct 1276 ms 82976 KB Output is correct
10 Correct 1150 ms 84528 KB Output is correct
11 Correct 1122 ms 84084 KB Output is correct
12 Correct 1069 ms 84380 KB Output is correct
13 Correct 967 ms 83016 KB Output is correct
14 Correct 1225 ms 83576 KB Output is correct
15 Correct 1248 ms 84552 KB Output is correct
16 Correct 1298 ms 84552 KB Output is correct
17 Correct 0 ms 336 KB Output is correct
18 Correct 1 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 3 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 3 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 24 ms 1104 KB Output is correct
28 Correct 16 ms 1104 KB Output is correct
29 Correct 13 ms 1104 KB Output is correct
30 Correct 16 ms 1104 KB Output is correct
31 Correct 19 ms 1104 KB Output is correct
32 Correct 0 ms 336 KB Output is correct
33 Correct 94 ms 48028 KB Output is correct
34 Correct 159 ms 82980 KB Output is correct
35 Correct 171 ms 84296 KB Output is correct
36 Correct 159 ms 82980 KB Output is correct
37 Correct 205 ms 83520 KB Output is correct
38 Correct 176 ms 84536 KB Output is correct
39 Correct 1 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 283 ms 38184 KB Output is correct
43 Correct 929 ms 82856 KB Output is correct
44 Correct 684 ms 14160 KB Output is correct
45 Correct 1132 ms 82888 KB Output is correct
46 Correct 663 ms 29124 KB Output is correct
47 Correct 1181 ms 83064 KB Output is correct
48 Correct 1122 ms 84676 KB Output is correct
49 Correct 1212 ms 84080 KB Output is correct
50 Correct 1262 ms 84400 KB Output is correct
51 Correct 1120 ms 82980 KB Output is correct
52 Correct 1150 ms 83576 KB Output is correct
53 Correct 992 ms 84544 KB Output is correct
54 Correct 1148 ms 84668 KB Output is correct
55 Correct 1 ms 336 KB Output is correct
56 Correct 228 ms 82600 KB Output is correct
57 Correct 1214 ms 82856 KB Output is correct
58 Correct 485 ms 14928 KB Output is correct
59 Correct 1039 ms 82980 KB Output is correct
60 Correct 568 ms 29984 KB Output is correct
61 Correct 1131 ms 82972 KB Output is correct
62 Correct 1248 ms 84664 KB Output is correct
63 Correct 1213 ms 84060 KB Output is correct
64 Correct 1133 ms 84040 KB Output is correct
65 Correct 1165 ms 82976 KB Output is correct
66 Correct 1347 ms 83580 KB Output is correct
67 Correct 1179 ms 84624 KB Output is correct
68 Correct 943 ms 84640 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 3 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 2 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 3 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 19 ms 1104 KB Output is correct
87 Correct 20 ms 1104 KB Output is correct
88 Correct 22 ms 1104 KB Output is correct
89 Correct 19 ms 1076 KB Output is correct
90 Correct 18 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 19 ms 1104 KB Output is correct
94 Correct 19 ms 1104 KB Output is correct
95 Correct 22 ms 1104 KB Output is correct
96 Correct 20 ms 1104 KB Output is correct
97 Correct 13 ms 1104 KB Output is correct
98 Correct 0 ms 336 KB Output is correct
99 Correct 173 ms 82932 KB Output is correct
100 Correct 157 ms 82872 KB Output is correct
101 Correct 166 ms 84260 KB Output is correct
102 Correct 163 ms 82856 KB Output is correct
103 Correct 194 ms 83576 KB Output is correct
104 Correct 169 ms 84496 KB Output is correct
105 Correct 0 ms 336 KB Output is correct
106 Correct 102 ms 47944 KB Output is correct
107 Correct 164 ms 83056 KB Output is correct
108 Correct 170 ms 84376 KB Output is correct
109 Correct 173 ms 82976 KB Output is correct
110 Correct 190 ms 83556 KB Output is correct
111 Correct 157 ms 84544 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 245 ms 67748 KB Output is correct
4 Correct 1188 ms 84616 KB Output is correct
5 Correct 816 ms 42764 KB Output is correct
6 Correct 1247 ms 84640 KB Output is correct
7 Correct 853 ms 58584 KB Output is correct
8 Correct 1245 ms 84740 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 1 ms 336 KB Output is correct
13 Correct 2 ms 336 KB Output is correct
14 Correct 2 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 Incorrect 2 ms 336 KB Output isn't correct
19 Halted 0 ms 0 KB -