oj.uz

Submission #497656

# Submission time Handle Problem Language Result Execution time Memory
497656 2021-12-23T13:14:34 Z Karliver Rainforest Jumps (APIO21_jumps) C++17
56 / 100
 4000 ms 47520 KB 
    
#include <bits/stdc++.h>
#include "jumps.h"
#define FIXED_FLOAT(x)  std::fixed <<std::setprecision(20) << (x)
#define all(v) (v).begin(), (v).end()
using namespace  std;
#define forn(i,n) for (int i = 0; i < (n); ++i)
#define rforn(i, n) for(int i = (n) - 1;i >= 0;--i)
#define sz(x) (int)x.size()
#define ff first
#define se second
#define mp make_pair
using ll = long long;
int mod = (ll)1e9 + 7;
const int INF = 1e9 + 1;

const double eps = 1e-7;

template <class T> using V = vector<T>;  
template <class T> using VV = V<V<T>>;  
template<class T, size_t SZ> using AR = array<T, SZ>;
template<class T> using PR = pair<T, T>;
template <typename XPAX>
bool ckma(XPAX &x, XPAX y) {
    return (x < y ? x = y, 1 : 0);
}
template <typename XPAX>
bool ckmi(XPAX &x, XPAX y) {
    return (x > y ? x = y, 1 : 0);
}

V<int> g[200001];

int dis[200001];
const int L = 19;
int pl[200001];
int pr[200001];
int F[200001][L];
int W[200001][L];
int H[200001];
bool firstcase = 1;
void init(int N, V<int> a) {
    for(auto &c : a)--c;
    forn(i, N) H[i] = a[i];
    H[N] = N;
    stack<int> st;
    forn(i, N) {
        while(sz(st) && H[st.top()] < H[i])
            st.pop();
        if(sz(st))g[i].push_back(st.top());
        pl[H[i]] = sz(st) ? H[st.top()] : N;
        st.push(i);
    }
    while(sz(st))st.pop();
    rforn(i, N) {
        while(sz(st) && H[st.top()] < H[i])
            st.pop();
        if(sz(st))g[i].push_back(st.top());
        pr[H[i]] = sz(st) ? H[st.top()] : N;
        st.push(i);
    }
    forn(i, N) {
        dis[i] = -1;
        firstcase &= (H[i] == i+1);
    }
    pl[N] = pr[N] = N;
    for(int i = 0;i <= N;++i) {
        F[i][0] = max(pl[i], pr[i]);
        W[i][0] = pr[i];
    }
    for(int j = 1;j < L;++j) {
        forn(i,N+1) {
            F[i][j] = F[F[i][j-1]][j-1];
            W[i][j] = W[W[i][j-1]][j-1];
        }
    }



}

int minimum_jumps(int A, int B, int C, int D) {
    if(firstcase)
        return C-B;
    if(A == B && C == D) {
        int ret =0 ;
        int f = H[A];
        int t = H[C];
        rforn(i, L) if(F[f][i] <= t) f = F[f][i], ret += 1 << i;
        rforn(i, L) if(W[f][i] <= t) f = W[f][i], ret += 1 << i;
        if(f != t)return -1;
        return ret;
    }

    queue<int> q;
    V<int> clr;

    auto reset = [&]() {
        for(auto x : clr)
            dis[x] = -1;
    };

    for(int a = A;a <= B;++a) {
        q.push(a);
        dis[a] = 0;
        clr.push_back(a);
    }
    while(sz(q)) {
        int v = q.front();
        q.pop();
        if(C <= v && v <= D) {

            int rr = dis[v];
            reset();
            return rr;
        }
        for(auto c : g[v]) {
            if(dis[c] == -1) {
                dis[c] = dis[v]+1;
                q.push(c);
                clr.push_back(c);
            }
        }
    }
    reset();
    return -1;
}
    /*
int main() {

    init(7, {3, 2, 1, 6, 4, 5, 7});
    cout << minimum_jumps(1, 1, 6, 6) << '\n';
}*/

Subtask #1
0 / 4.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4936 KB Output is correct
2 Correct 3 ms 4936 KB Output is correct
3 Correct 3 ms 4936 KB Output is correct
4 Correct 2 ms 4936 KB Output is correct
5 Correct 4 ms 4936 KB Output is correct
6 Correct 4 ms 5076 KB Output is correct
7 Correct 5 ms 5064 KB Output is correct
8 Correct 6 ms 5064 KB Output is correct
9 Correct 3 ms 5064 KB Output is correct
10 Correct 6 ms 5064 KB Output is correct
11 Correct 8 ms 5064 KB Output is correct
12 Correct 7 ms 5064 KB Output is correct
13 Correct 6 ms 4968 KB Output is correct
14 Correct 5 ms 5064 KB Output is correct
15 Correct 4 ms 4976 KB Output is correct
16 Correct 4 ms 5064 KB Output is correct
17 Correct 5 ms 5064 KB Output is correct
18 Correct 2 ms 4936 KB Output is correct
19 Correct 3 ms 4936 KB Output is correct
20 Correct 4 ms 5076 KB Output is correct
21 Correct 5 ms 5064 KB Output is correct
22 Correct 4 ms 5064 KB Output is correct
23 Correct 5 ms 5064 KB Output is correct
24 Correct 5 ms 5064 KB Output is correct
25 Correct 3 ms 4936 KB Output is correct
26 Correct 3 ms 4936 KB Output is correct
27 Correct 6 ms 4936 KB Output is correct
28 Correct 4 ms 5064 KB Output is correct
29 Correct 6 ms 5064 KB Output is correct
30 Correct 5 ms 5064 KB Output is correct
31 Correct 4 ms 5064 KB Output is correct
32 Correct 7 ms 5064 KB Output is correct
33 Correct 3 ms 4936 KB Output is correct
34 Correct 3 ms 5064 KB Output is correct
35 Correct 3 ms 5064 KB Output is correct
36 Correct 3 ms 5064 KB Output is correct
37 Correct 3 ms 5064 KB Output is correct
38 Correct 3 ms 5020 KB Output is correct
39 Correct 3 ms 5064 KB Output is correct
40 Correct 3 ms 4936 KB Output is correct
41 Correct 3 ms 4936 KB Output is correct
42 Correct 3 ms 4916 KB Output is correct
43 Correct 3 ms 4936 KB Output is correct
44 Correct 5 ms 4936 KB Output is correct
45 Correct 5 ms 5072 KB Output is correct
46 Correct 4 ms 4936 KB Output is correct
47 Correct 4 ms 5064 KB Output is correct
48 Correct 5 ms 5064 KB Output is correct
49 Correct 4 ms 5064 KB Output is correct
50 Correct 6 ms 5064 KB Output is correct
51 Correct 5 ms 5068 KB Output is correct
52 Correct 5 ms 5064 KB Output is correct
53 Correct 5 ms 5064 KB Output is correct
54 Correct 6 ms 5064 KB Output is correct
55 Correct 6 ms 5064 KB Output is correct
56 Correct 5 ms 5064 KB Output is correct
57 Correct 3 ms 5064 KB Output is correct
58 Correct 28 ms 5320 KB Output is correct
59 Correct 47 ms 5320 KB Output is correct
60 Correct 10 ms 5204 KB Output is correct
61 Correct 38 ms 5320 KB Output is correct
62 Correct 18 ms 5064 KB Output is correct
63 Correct 26 ms 5436 KB Output is correct
64 Correct 50 ms 5448 KB Output is correct
65 Correct 53 ms 5448 KB Output is correct
66 Correct 50 ms 5448 KB Output is correct
67 Correct 40 ms 5448 KB Output is correct
68 Correct 53 ms 5448 KB Output is correct
69 Correct 48 ms 5448 KB Output is correct
70 Correct 35 ms 5448 KB Output is correct
71 Correct 4 ms 4936 KB Output is correct
72 Correct 4 ms 4936 KB Output is correct
73 Correct 6 ms 5064 KB Output is correct
74 Correct 5 ms 5064 KB Output is correct
75 Correct 6 ms 5064 KB Output is correct
76 Correct 5 ms 5064 KB Output is correct
77 Correct 5 ms 5064 KB Output is correct
78 Correct 3 ms 4936 KB Output is correct
79 Correct 3 ms 4936 KB Output is correct
80 Correct 4 ms 4988 KB Output is correct
81 Correct 5 ms 5064 KB Output is correct
82 Correct 6 ms 5064 KB Output is correct
83 Correct 5 ms 5064 KB Output is correct
84 Correct 5 ms 5064 KB Output is correct
85 Correct 5 ms 5040 KB Output is correct
86 Correct 3 ms 4936 KB Output is correct
87 Correct 3 ms 5064 KB Output is correct
88 Correct 3 ms 5064 KB Output is correct
89 Correct 3 ms 5064 KB Output is correct
90 Correct 3 ms 4936 KB Output is correct
91 Correct 4 ms 5076 KB Output is correct
92 Correct 4 ms 5064 KB Output is correct
93 Correct 3 ms 5064 KB Output is correct
94 Correct 6 ms 5064 KB Output is correct
95 Correct 43 ms 5352 KB Output is correct
96 Correct 53 ms 5448 KB Output is correct
97 Correct 32 ms 5320 KB Output is correct
98 Correct 55 ms 5448 KB Output is correct
99 Correct 46 ms 5448 KB Output is correct
100 Correct 2 ms 5064 KB Output is correct
101 Correct 4 ms 5064 KB Output is correct
102 Correct 24 ms 5320 KB Output is correct
103 Correct 11 ms 5320 KB Output is correct
104 Correct 24 ms 5320 KB Output is correct
105 Correct 12 ms 5376 KB Output is correct
106 Correct 18 ms 5320 KB Output is correct
107 Correct 3 ms 5064 KB Output is correct
108 Correct 3 ms 5192 KB Output is correct
109 Correct 3 ms 5432 KB Output is correct
110 Correct 3 ms 5320 KB Output is correct
111 Correct 4 ms 5320 KB Output is correct
112 Correct 4 ms 5444 KB Output is correct
113 Correct 5 ms 5376 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4936 KB Output is correct
2 Correct 3 ms 4936 KB Output is correct
3 Correct 3 ms 4936 KB Output is correct
4 Correct 3 ms 4936 KB Output is correct
5 Correct 84 ms 37984 KB Output is correct
6 Correct 108 ms 45696 KB Output is correct
7 Correct 60 ms 25848 KB Output is correct
8 Correct 112 ms 46720 KB Output is correct
9 Correct 13 ms 11208 KB Output is correct
10 Correct 114 ms 45708 KB Output is correct
11 Correct 99 ms 47432 KB Output is correct
12 Correct 95 ms 46184 KB Output is correct
13 Correct 108 ms 47060 KB Output is correct
14 Correct 135 ms 45692 KB Output is correct
15 Correct 139 ms 46124 KB Output is correct
16 Correct 110 ms 46896 KB Output is correct
17 Correct 130 ms 46828 KB Output is correct
18 Correct 3 ms 4936 KB Output is correct
19 Correct 3 ms 4936 KB Output is correct
20 Correct 3 ms 5064 KB Output is correct
21 Correct 4 ms 5064 KB Output is correct
22 Correct 3 ms 5064 KB Output is correct
23 Correct 3 ms 5064 KB Output is correct
24 Correct 3 ms 5064 KB Output is correct
25 Correct 3 ms 5064 KB Output is correct
26 Correct 3 ms 5192 KB Output is correct
27 Correct 4 ms 5320 KB Output is correct
28 Correct 3 ms 5448 KB Output is correct
29 Correct 4 ms 5320 KB Output is correct
30 Correct 4 ms 5320 KB Output is correct
31 Correct 5 ms 5320 KB Output is correct
32 Correct 3 ms 4936 KB Output is correct
33 Correct 103 ms 45624 KB Output is correct
34 Correct 119 ms 45700 KB Output is correct
35 Correct 98 ms 46440 KB Output is correct
36 Correct 114 ms 45612 KB Output is correct
37 Correct 126 ms 46844 KB Output is correct
38 Correct 97 ms 47520 KB Output is correct
39 Correct 2 ms 4936 KB Output is correct
40 Correct 74 ms 28620 KB Output is correct
41 Correct 113 ms 45588 KB Output is correct
42 Correct 90 ms 46476 KB Output is correct
43 Correct 101 ms 45584 KB Output is correct
44 Correct 117 ms 46100 KB Output is correct
45 Correct 111 ms 46508 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4936 KB Output is correct
2 Correct 2 ms 4936 KB Output is correct
3 Correct 3 ms 4936 KB Output is correct
4 Correct 281 ms 23540 KB Output is correct
5 Correct 997 ms 45580 KB Output is correct
6 Correct 722 ms 11720 KB Output is correct
7 Correct 1082 ms 45580 KB Output is correct
8 Correct 544 ms 19008 KB Output is correct
9 Correct 909 ms 45580 KB Output is correct
10 Correct 966 ms 46428 KB Output is correct
11 Correct 1229 ms 45932 KB Output is correct
12 Correct 994 ms 46400 KB Output is correct
13 Correct 966 ms 45632 KB Output is correct
14 Correct 612 ms 46076 KB Output is correct
15 Correct 981 ms 46400 KB Output is correct
16 Correct 1069 ms 46448 KB Output is correct
17 Correct 3 ms 5064 KB Output is correct
18 Correct 3 ms 4936 KB Output is correct
19 Correct 4 ms 4936 KB Output is correct
20 Correct 5 ms 5064 KB Output is correct
21 Correct 6 ms 5064 KB Output is correct
22 Correct 6 ms 5064 KB Output is correct
23 Correct 5 ms 5064 KB Output is correct
24 Correct 4 ms 4992 KB Output is correct
25 Correct 3 ms 5064 KB Output is correct
26 Correct 3 ms 5064 KB Output is correct
27 Correct 21 ms 5320 KB Output is correct
28 Correct 28 ms 5320 KB Output is correct
29 Correct 29 ms 5372 KB Output is correct
30 Correct 25 ms 5320 KB Output is correct
31 Correct 18 ms 5352 KB Output is correct
32 Correct 3 ms 4936 KB Output is correct
33 Correct 62 ms 28560 KB Output is correct
34 Correct 110 ms 45684 KB Output is correct
35 Correct 91 ms 46320 KB Output is correct
36 Correct 98 ms 45556 KB Output is correct
37 Correct 113 ms 46060 KB Output is correct
38 Correct 92 ms 46512 KB Output is correct

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4936 KB Output is correct
2 Correct 2 ms 4936 KB Output is correct
3 Correct 3 ms 4936 KB Output is correct
4 Correct 281 ms 23540 KB Output is correct
5 Correct 997 ms 45580 KB Output is correct
6 Correct 722 ms 11720 KB Output is correct
7 Correct 1082 ms 45580 KB Output is correct
8 Correct 544 ms 19008 KB Output is correct
9 Correct 909 ms 45580 KB Output is correct
10 Correct 966 ms 46428 KB Output is correct
11 Correct 1229 ms 45932 KB Output is correct
12 Correct 994 ms 46400 KB Output is correct
13 Correct 966 ms 45632 KB Output is correct
14 Correct 612 ms 46076 KB Output is correct
15 Correct 981 ms 46400 KB Output is correct
16 Correct 1069 ms 46448 KB Output is correct
17 Correct 3 ms 5064 KB Output is correct
18 Correct 3 ms 4936 KB Output is correct
19 Correct 4 ms 4936 KB Output is correct
20 Correct 5 ms 5064 KB Output is correct
21 Correct 6 ms 5064 KB Output is correct
22 Correct 6 ms 5064 KB Output is correct
23 Correct 5 ms 5064 KB Output is correct
24 Correct 4 ms 4992 KB Output is correct
25 Correct 3 ms 5064 KB Output is correct
26 Correct 3 ms 5064 KB Output is correct
27 Correct 21 ms 5320 KB Output is correct
28 Correct 28 ms 5320 KB Output is correct
29 Correct 29 ms 5372 KB Output is correct
30 Correct 25 ms 5320 KB Output is correct
31 Correct 18 ms 5352 KB Output is correct
32 Correct 3 ms 4936 KB Output is correct
33 Correct 62 ms 28560 KB Output is correct
34 Correct 110 ms 45684 KB Output is correct
35 Correct 91 ms 46320 KB Output is correct
36 Correct 98 ms 45556 KB Output is correct
37 Correct 113 ms 46060 KB Output is correct
38 Correct 92 ms 46512 KB Output is correct
39 Correct 2 ms 4936 KB Output is correct
40 Correct 3 ms 4936 KB Output is correct
41 Correct 2 ms 4936 KB Output is correct
42 Correct 302 ms 23576 KB Output is correct
43 Correct 653 ms 45672 KB Output is correct
44 Correct 648 ms 11636 KB Output is correct
45 Correct 893 ms 45688 KB Output is correct
46 Correct 622 ms 18936 KB Output is correct
47 Correct 1035 ms 45688 KB Output is correct
48 Correct 1182 ms 46456 KB Output is correct
49 Correct 1016 ms 45940 KB Output is correct
50 Correct 1132 ms 46396 KB Output is correct
51 Correct 949 ms 45688 KB Output is correct
52 Correct 945 ms 46016 KB Output is correct
53 Correct 623 ms 46456 KB Output is correct
54 Correct 916 ms 46472 KB Output is correct
55 Correct 3 ms 4936 KB Output is correct
56 Execution timed out 4011 ms 47252 KB Time limit exceeded
57 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

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