oj.uz

Submission #617893

# Submission time Handle Problem Language Result Execution time Memory
617893 2022-08-01T16:29:19 Z MohamedAliSaidane Rainforest Jumps (APIO21_jumps) C++14
33 / 100
 4000 ms 46516 KB 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include "jumps.h"
        using namespace __gnu_pbds;
        using namespace std;

        typedef tree<int,null_type,less<int>,rb_tree_tag,
        tree_order_statistics_node_update> indexed_set;

        typedef long long ll;
        typedef long double ld;

        //#define int ll

        typedef pair<int,int> pii;
        typedef pair<ll,ll> pll;
        typedef pair<ld,ld> pld;

        typedef vector<int> vi;
        typedef vector<ll> vll;
        typedef vector<pii> vpi;
        typedef vector<pll> vpl;

        #define pb push_back
        #define popb pop_back
        #define pp pop_back
        #define pf push_front
        #define popf pop_front
        #define all(x) (x).begin(),(x).end()
        #define ff first
        #define ss second



        int nx[4] = {0,0,1,-1}, ny[4] = {1,-1,0,0};
        ll gcd(ll a , ll b) {return b ? gcd(b , a % b) : a ;}
        ll lcm(ll a , ll b) {return (a * b) / gcd(a , b);}


        const ll MOD =   998244353;

        int n;
        vll A;
        const int nax = 2e5 + 4;
        ll sp[nax][20];
        int LG[nax];
        int L[nax], R[nax];
        void build()
        {
            for(int i = 0; i < n; i++)
                sp[i][0] = A[i];
            for(int j = 1; j < 20; j++)
                for(int i=  0; i + (1 << j) <= n; i ++)
                    sp[i][j] = max(sp[i][j-1],sp[i + (1 << (j-1))][j - 1]);
        }
        int rmq(int l, int r)
        {
            int j = LG[r - l + 1];
            return max(sp[l][j], sp[r - (1 << j) + 1][j]);
        }
        void init(int N, vi H)
        {
            n = N;
            for(int i = 0 ; i < n;i ++)
                A.pb(H[i]);
            LG[1] = 0;
            for(int i =2; i < nax;i ++)
                LG[i] = LG[i/2] + 1;
            build();
            memset(L, -1, sizeof(L));
            memset(R, -1, sizeof(R));
            for(int i = 0 ;i  < n; i++)
            {
                int debut = 0;
                int fin =i -1;
                int rep = -1;
                while(debut <= fin)
                {
                    int mid = (debut + fin)/2;
                    if(rmq(mid, i) > A[i])
                    {
                        rep = mid;
                        debut = mid + 1;
                    }
                    else
                        fin =mid - 1;
                }
                L[i] = rep;
                debut =i + 1;
                fin = n- 1;
                rep = -1;
                while(debut <= fin)
                {
                    int mid = ( debut + fin  )/2;
                    if(rmq(i, mid) > A[i])
                    {
                        rep = mid ;
                        fin = mid - 1;
                    }
                    else
                        debut = mid + 1;
                }
                R[i] = rep;
            }
        }
        int minimum_jumps(int a, int b, int c, int d)
        {
            set<pii> pq;
            for(int i = a; i <= b;i ++)
                pq.insert({0, i});
            int sp[n];
            for(int i=  0 ; i < n; i++)
                sp[i] = MOD;
            while(!pq.empty())
            {
                pii u = *(pq.begin());
                pq.erase(pq.begin());
                int dis = u.ff;
                int node =u.ss;
                if(node >= c && node <= d)
                    return dis;
                if(dis > sp[node])
                    continue;
                if(L[node] != -1 && sp[L[node]] > dis + 1)
                {
                    sp[L[node]] = dis + 1;
                    pq.insert({dis + 1, L[node]});
                }
                if(R[node] != -1 && sp[R[node]] > dis + 1)
                {
                    sp[R[node]] = dis + 1;
                    pq.insert({dis + 1, R[node]});
                }
            }
            return -1;
        }

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2640 KB Output is correct
2 Correct 2 ms 2640 KB Output is correct
3 Execution timed out 4086 ms 36884 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2640 KB Output is correct
2 Correct 2 ms 2640 KB Output is correct
3 Correct 1 ms 2640 KB Output is correct
4 Correct 2 ms 2640 KB Output is correct
5 Correct 4 ms 2688 KB Output is correct
6 Correct 5 ms 2700 KB Output is correct
7 Correct 5 ms 2640 KB Output is correct
8 Correct 7 ms 2620 KB Output is correct
9 Correct 2 ms 2692 KB Output is correct
10 Correct 5 ms 2640 KB Output is correct
11 Correct 6 ms 2640 KB Output is correct
12 Correct 6 ms 2708 KB Output is correct
13 Correct 7 ms 2704 KB Output is correct
14 Correct 6 ms 2708 KB Output is correct
15 Correct 7 ms 2640 KB Output is correct
16 Correct 5 ms 2640 KB Output is correct
17 Correct 5 ms 2640 KB Output is correct
18 Correct 2 ms 2640 KB Output is correct
19 Correct 2 ms 2640 KB Output is correct
20 Correct 6 ms 2640 KB Output is correct
21 Correct 6 ms 2640 KB Output is correct
22 Correct 5 ms 2704 KB Output is correct
23 Correct 8 ms 2640 KB Output is correct
24 Correct 5 ms 2640 KB Output is correct
25 Correct 1 ms 2640 KB Output is correct
26 Correct 2 ms 2640 KB Output is correct
27 Correct 3 ms 2640 KB Output is correct
28 Correct 3 ms 2640 KB Output is correct
29 Correct 5 ms 2640 KB Output is correct
30 Correct 4 ms 2640 KB Output is correct
31 Correct 3 ms 2640 KB Output is correct
32 Correct 4 ms 2640 KB Output is correct
33 Correct 1 ms 2640 KB Output is correct
34 Correct 1 ms 2640 KB Output is correct
35 Correct 2 ms 2640 KB Output is correct
36 Correct 2 ms 2640 KB Output is correct
37 Correct 2 ms 2700 KB Output is correct
38 Correct 3 ms 2640 KB Output is correct
39 Correct 2 ms 2640 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2640 KB Output is correct
2 Correct 2 ms 2640 KB Output is correct
3 Correct 1 ms 2640 KB Output is correct
4 Correct 2 ms 2640 KB Output is correct
5 Correct 4 ms 2688 KB Output is correct
6 Correct 5 ms 2700 KB Output is correct
7 Correct 5 ms 2640 KB Output is correct
8 Correct 7 ms 2620 KB Output is correct
9 Correct 2 ms 2692 KB Output is correct
10 Correct 5 ms 2640 KB Output is correct
11 Correct 6 ms 2640 KB Output is correct
12 Correct 6 ms 2708 KB Output is correct
13 Correct 7 ms 2704 KB Output is correct
14 Correct 6 ms 2708 KB Output is correct
15 Correct 7 ms 2640 KB Output is correct
16 Correct 5 ms 2640 KB Output is correct
17 Correct 5 ms 2640 KB Output is correct
18 Correct 2 ms 2640 KB Output is correct
19 Correct 2 ms 2640 KB Output is correct
20 Correct 6 ms 2640 KB Output is correct
21 Correct 6 ms 2640 KB Output is correct
22 Correct 5 ms 2704 KB Output is correct
23 Correct 8 ms 2640 KB Output is correct
24 Correct 5 ms 2640 KB Output is correct
25 Correct 1 ms 2640 KB Output is correct
26 Correct 2 ms 2640 KB Output is correct
27 Correct 3 ms 2640 KB Output is correct
28 Correct 3 ms 2640 KB Output is correct
29 Correct 5 ms 2640 KB Output is correct
30 Correct 4 ms 2640 KB Output is correct
31 Correct 3 ms 2640 KB Output is correct
32 Correct 4 ms 2640 KB Output is correct
33 Correct 1 ms 2640 KB Output is correct
34 Correct 1 ms 2640 KB Output is correct
35 Correct 2 ms 2640 KB Output is correct
36 Correct 2 ms 2640 KB Output is correct
37 Correct 2 ms 2700 KB Output is correct
38 Correct 3 ms 2640 KB Output is correct
39 Correct 2 ms 2640 KB Output is correct
40 Correct 2 ms 2640 KB Output is correct
41 Correct 1 ms 2640 KB Output is correct
42 Correct 2 ms 2640 KB Output is correct
43 Correct 1 ms 2640 KB Output is correct
44 Correct 3 ms 2640 KB Output is correct
45 Correct 6 ms 2712 KB Output is correct
46 Correct 4 ms 2640 KB Output is correct
47 Correct 5 ms 2640 KB Output is correct
48 Correct 3 ms 2640 KB Output is correct
49 Correct 6 ms 2696 KB Output is correct
50 Correct 6 ms 2640 KB Output is correct
51 Correct 7 ms 2640 KB Output is correct
52 Correct 6 ms 2640 KB Output is correct
53 Correct 7 ms 2640 KB Output is correct
54 Correct 6 ms 2640 KB Output is correct
55 Correct 5 ms 2640 KB Output is correct
56 Correct 6 ms 2640 KB Output is correct
57 Correct 1 ms 2640 KB Output is correct
58 Correct 159 ms 3024 KB Output is correct
59 Correct 226 ms 3048 KB Output is correct
60 Correct 28 ms 2832 KB Output is correct
61 Correct 231 ms 3060 KB Output is correct
62 Correct 28 ms 2640 KB Output is correct
63 Correct 232 ms 3040 KB Output is correct
64 Correct 247 ms 3144 KB Output is correct
65 Correct 278 ms 3024 KB Output is correct
66 Correct 263 ms 3024 KB Output is correct
67 Correct 208 ms 3068 KB Output is correct
68 Correct 337 ms 3084 KB Output is correct
69 Correct 295 ms 3024 KB Output is correct
70 Correct 118 ms 2896 KB Output is correct
71 Correct 2 ms 2640 KB Output is correct
72 Correct 2 ms 2640 KB Output is correct
73 Correct 6 ms 2640 KB Output is correct
74 Correct 7 ms 2640 KB Output is correct
75 Correct 5 ms 2700 KB Output is correct
76 Correct 7 ms 2640 KB Output is correct
77 Correct 5 ms 2640 KB Output is correct
78 Correct 1 ms 2640 KB Output is correct
79 Correct 1 ms 2640 KB Output is correct
80 Correct 3 ms 2640 KB Output is correct
81 Correct 3 ms 2640 KB Output is correct
82 Correct 3 ms 2640 KB Output is correct
83 Correct 4 ms 2640 KB Output is correct
84 Correct 5 ms 2640 KB Output is correct
85 Correct 4 ms 2640 KB Output is correct
86 Correct 1 ms 2640 KB Output is correct
87 Correct 2 ms 2640 KB Output is correct
88 Correct 1 ms 2640 KB Output is correct
89 Correct 2 ms 2640 KB Output is correct
90 Correct 2 ms 2640 KB Output is correct
91 Correct 2 ms 2696 KB Output is correct
92 Correct 2 ms 2708 KB Output is correct
93 Correct 2 ms 2624 KB Output is correct
94 Correct 8 ms 2640 KB Output is correct
95 Correct 227 ms 3068 KB Output is correct
96 Correct 250 ms 3152 KB Output is correct
97 Correct 218 ms 3024 KB Output is correct
98 Correct 344 ms 3092 KB Output is correct
99 Correct 251 ms 3024 KB Output is correct
100 Correct 1 ms 2640 KB Output is correct
101 Correct 4 ms 2768 KB Output is correct
102 Correct 24 ms 2896 KB Output is correct
103 Correct 69 ms 2896 KB Output is correct
104 Correct 22 ms 2896 KB Output is correct
105 Correct 90 ms 3024 KB Output is correct
106 Correct 74 ms 2896 KB Output is correct
107 Correct 1 ms 2640 KB Output is correct
108 Correct 2 ms 2768 KB Output is correct
109 Correct 3 ms 3020 KB Output is correct
110 Correct 3 ms 3024 KB Output is correct
111 Correct 3 ms 3024 KB Output is correct
112 Correct 3 ms 3024 KB Output is correct
113 Correct 3 ms 3024 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2588 KB Output is correct
2 Correct 1 ms 2640 KB Output is correct
3 Correct 2 ms 2640 KB Output is correct
4 Correct 1 ms 2640 KB Output is correct
5 Correct 125 ms 34116 KB Output is correct
6 Correct 161 ms 40376 KB Output is correct
7 Correct 57 ms 20404 KB Output is correct
8 Correct 184 ms 45904 KB Output is correct
9 Correct 18 ms 8612 KB Output is correct
10 Correct 151 ms 39628 KB Output is correct
11 Correct 227 ms 43288 KB Output is correct
12 Correct 196 ms 42228 KB Output is correct
13 Correct 152 ms 40652 KB Output is correct
14 Correct 140 ms 39300 KB Output is correct
15 Correct 195 ms 42484 KB Output is correct
16 Correct 237 ms 46516 KB Output is correct
17 Correct 297 ms 46324 KB Output is correct
18 Correct 2 ms 2640 KB Output is correct
19 Correct 1 ms 2640 KB Output is correct
20 Correct 2 ms 2640 KB Output is correct
21 Correct 2 ms 2640 KB Output is correct
22 Correct 1 ms 2640 KB Output is correct
23 Correct 1 ms 2640 KB Output is correct
24 Correct 2 ms 2640 KB Output is correct
25 Correct 2 ms 2640 KB Output is correct
26 Correct 2 ms 2768 KB Output is correct
27 Correct 3 ms 3024 KB Output is correct
28 Correct 3 ms 3024 KB Output is correct
29 Correct 3 ms 3024 KB Output is correct
30 Correct 3 ms 3024 KB Output is correct
31 Correct 3 ms 3024 KB Output is correct
32 Correct 2 ms 2640 KB Output is correct
33 Correct 122 ms 37136 KB Output is correct
34 Correct 135 ms 40580 KB Output is correct
35 Correct 166 ms 42200 KB Output is correct
36 Correct 129 ms 38428 KB Output is correct
37 Correct 157 ms 40984 KB Output is correct
38 Correct 215 ms 46376 KB Output is correct
39 Correct 1 ms 2640 KB Output is correct
40 Correct 65 ms 22712 KB Output is correct
41 Correct 106 ms 37220 KB Output is correct
42 Correct 109 ms 37192 KB Output is correct
43 Correct 121 ms 37192 KB Output is correct
44 Correct 162 ms 37164 KB Output is correct
45 Correct 105 ms 37144 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2640 KB Output is correct
2 Correct 1 ms 2640 KB Output is correct
3 Correct 2 ms 2640 KB Output is correct
4 Correct 1030 ms 18472 KB Output is correct
5 Execution timed out 4054 ms 37224 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2640 KB Output is correct
2 Correct 1 ms 2640 KB Output is correct
3 Correct 2 ms 2640 KB Output is correct
4 Correct 1030 ms 18472 KB Output is correct
5 Execution timed out 4054 ms 37224 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2640 KB Output is correct
2 Correct 2 ms 2640 KB Output is correct
3 Execution timed out 4086 ms 36884 KB Time limit exceeded
4 Halted 0 ms 0 KB -