oj.uz

Submission #497667

# Submission time Handle Problem Language Result Execution time Memory
497667 2021-12-23T13:57:55 Z Karliver Rainforest Jumps (APIO21_jumps) C++17
39 / 100
 1197 ms 92492 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;

int n;
V<int> S[200001 * 4];

void build(V<int> &a, int v, int tl, int tr) {
    if (tl == tr) {
        S[v] = {a[tl]};
    } else { 
        int tm = (tl + tr) / 2;
        build(a, v*2, tl, tm);
        build(a, v*2+1, tm+1, tr);
        merge(S[v*2].begin(), S[v*2].end(), S[v*2+1].begin(), S[v*2+1].end(),
              back_inserter(S[v]));
    }
}

int query(int v, int tl, int tr, int l, int r, int x) {
    if (l > r)
        return -1;
    if (l == tl && r == tr) {
        vector<int>::iterator pos = lower_bound(S[v].begin(), S[v].end(), x);
        if(pos != S[v].begin()) {
            pos--;
            return *pos;
        }
        return -1;
    }
    int tm = (tl + tr) / 2;
    return max(query(v*2, tl, tm, l, min(r, tm), x), 
               query(v*2+1, tm+1, tr, max(l, tm+1), r, x));
}

void init(int N, V<int> a) {
    for(auto &c : a)--c;
    forn(i, N) H[i] = a[i];
    n = N;
    build(a, 1, 0, N-1);
    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);
    }
    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;
    }
    if(C == D) {
        int t = H[C];
        int f = query(1, 0, n-1, A, B, t);
        if(f == -1)return -1;
        int ret = 0;
        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(3, 4, 6, 6) << '\n';
}
*/

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23752 KB Output is correct
2 Correct 12 ms 23804 KB Output is correct
3 Correct 232 ms 79808 KB Output is correct
4 Correct 1095 ms 91988 KB Output is correct
5 Correct 815 ms 57664 KB Output is correct
6 Correct 948 ms 91980 KB Output is correct
7 Correct 827 ms 72136 KB Output is correct
8 Correct 1022 ms 91972 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 23752 KB Output is correct
2 Correct 12 ms 23728 KB Output is correct
3 Correct 11 ms 23692 KB Output is correct
4 Correct 12 ms 23768 KB Output is correct
5 Incorrect 13 ms 23752 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 23752 KB Output is correct
2 Correct 12 ms 23728 KB Output is correct
3 Correct 11 ms 23692 KB Output is correct
4 Correct 12 ms 23768 KB Output is correct
5 Incorrect 13 ms 23752 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23752 KB Output is correct
2 Correct 12 ms 23752 KB Output is correct
3 Correct 13 ms 23752 KB Output is correct
4 Correct 15 ms 23752 KB Output is correct
5 Correct 162 ms 79820 KB Output is correct
6 Correct 191 ms 91204 KB Output is correct
7 Correct 113 ms 57632 KB Output is correct
8 Correct 213 ms 92196 KB Output is correct
9 Correct 32 ms 33472 KB Output is correct
10 Correct 200 ms 91172 KB Output is correct
11 Correct 188 ms 91996 KB Output is correct
12 Correct 183 ms 91580 KB Output is correct
13 Correct 183 ms 92492 KB Output is correct
14 Correct 189 ms 91316 KB Output is correct
15 Correct 187 ms 91616 KB Output is correct
16 Correct 182 ms 92452 KB Output is correct
17 Correct 186 ms 92368 KB Output is correct
18 Correct 12 ms 23752 KB Output is correct
19 Correct 14 ms 23752 KB Output is correct
20 Correct 13 ms 23800 KB Output is correct
21 Correct 13 ms 23764 KB Output is correct
22 Correct 14 ms 23840 KB Output is correct
23 Correct 13 ms 23752 KB Output is correct
24 Correct 13 ms 23752 KB Output is correct
25 Correct 12 ms 23752 KB Output is correct
26 Correct 13 ms 24020 KB Output is correct
27 Correct 13 ms 24392 KB Output is correct
28 Correct 14 ms 24308 KB Output is correct
29 Correct 13 ms 24392 KB Output is correct
30 Correct 13 ms 24312 KB Output is correct
31 Correct 13 ms 24392 KB Output is correct
32 Correct 12 ms 23756 KB Output is correct
33 Correct 206 ms 91056 KB Output is correct
34 Correct 198 ms 91060 KB Output is correct
35 Correct 163 ms 91744 KB Output is correct
36 Correct 198 ms 91100 KB Output is correct
37 Correct 184 ms 91508 KB Output is correct
38 Correct 158 ms 91884 KB Output is correct
39 Correct 12 ms 23796 KB Output is correct
40 Correct 111 ms 61604 KB Output is correct
41 Correct 185 ms 91108 KB Output is correct
42 Correct 177 ms 91744 KB Output is correct
43 Correct 181 ms 91060 KB Output is correct
44 Correct 188 ms 91616 KB Output is correct
45 Correct 158 ms 91936 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23752 KB Output is correct
2 Correct 12 ms 23752 KB Output is correct
3 Correct 12 ms 23716 KB Output is correct
4 Correct 297 ms 54584 KB Output is correct
5 Correct 1064 ms 91172 KB Output is correct
6 Correct 686 ms 34756 KB Output is correct
7 Correct 948 ms 91168 KB Output is correct
8 Correct 576 ms 47660 KB Output is correct
9 Correct 1058 ms 91108 KB Output is correct
10 Correct 850 ms 91972 KB Output is correct
11 Correct 1030 ms 91408 KB Output is correct
12 Correct 1100 ms 91852 KB Output is correct
13 Correct 897 ms 91212 KB Output is correct
14 Correct 1146 ms 91488 KB Output is correct
15 Correct 1057 ms 92104 KB Output is correct
16 Correct 1079 ms 91956 KB Output is correct
17 Correct 12 ms 23752 KB Output is correct
18 Correct 12 ms 23752 KB Output is correct
19 Correct 13 ms 23720 KB Output is correct
20 Correct 15 ms 23752 KB Output is correct
21 Correct 16 ms 23796 KB Output is correct
22 Correct 16 ms 23752 KB Output is correct
23 Correct 15 ms 23752 KB Output is correct
24 Correct 14 ms 23752 KB Output is correct
25 Correct 13 ms 23752 KB Output is correct
26 Correct 14 ms 24008 KB Output is correct
27 Correct 31 ms 24368 KB Output is correct
28 Correct 29 ms 24384 KB Output is correct
29 Correct 21 ms 24396 KB Output is correct
30 Correct 28 ms 24392 KB Output is correct
31 Correct 30 ms 24392 KB Output is correct
32 Correct 12 ms 23752 KB Output is correct
33 Correct 111 ms 61592 KB Output is correct
34 Correct 185 ms 91104 KB Output is correct
35 Correct 158 ms 91848 KB Output is correct
36 Correct 183 ms 91060 KB Output is correct
37 Correct 201 ms 91488 KB Output is correct
38 Correct 164 ms 91996 KB Output is correct

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23752 KB Output is correct
2 Correct 12 ms 23752 KB Output is correct
3 Correct 12 ms 23716 KB Output is correct
4 Correct 297 ms 54584 KB Output is correct
5 Correct 1064 ms 91172 KB Output is correct
6 Correct 686 ms 34756 KB Output is correct
7 Correct 948 ms 91168 KB Output is correct
8 Correct 576 ms 47660 KB Output is correct
9 Correct 1058 ms 91108 KB Output is correct
10 Correct 850 ms 91972 KB Output is correct
11 Correct 1030 ms 91408 KB Output is correct
12 Correct 1100 ms 91852 KB Output is correct
13 Correct 897 ms 91212 KB Output is correct
14 Correct 1146 ms 91488 KB Output is correct
15 Correct 1057 ms 92104 KB Output is correct
16 Correct 1079 ms 91956 KB Output is correct
17 Correct 12 ms 23752 KB Output is correct
18 Correct 12 ms 23752 KB Output is correct
19 Correct 13 ms 23720 KB Output is correct
20 Correct 15 ms 23752 KB Output is correct
21 Correct 16 ms 23796 KB Output is correct
22 Correct 16 ms 23752 KB Output is correct
23 Correct 15 ms 23752 KB Output is correct
24 Correct 14 ms 23752 KB Output is correct
25 Correct 13 ms 23752 KB Output is correct
26 Correct 14 ms 24008 KB Output is correct
27 Correct 31 ms 24368 KB Output is correct
28 Correct 29 ms 24384 KB Output is correct
29 Correct 21 ms 24396 KB Output is correct
30 Correct 28 ms 24392 KB Output is correct
31 Correct 30 ms 24392 KB Output is correct
32 Correct 12 ms 23752 KB Output is correct
33 Correct 111 ms 61592 KB Output is correct
34 Correct 185 ms 91104 KB Output is correct
35 Correct 158 ms 91848 KB Output is correct
36 Correct 183 ms 91060 KB Output is correct
37 Correct 201 ms 91488 KB Output is correct
38 Correct 164 ms 91996 KB Output is correct
39 Correct 12 ms 23736 KB Output is correct
40 Correct 13 ms 23880 KB Output is correct
41 Correct 12 ms 23756 KB Output is correct
42 Correct 309 ms 54588 KB Output is correct
43 Correct 1164 ms 91188 KB Output is correct
44 Correct 549 ms 34748 KB Output is correct
45 Correct 987 ms 91172 KB Output is correct
46 Correct 590 ms 47668 KB Output is correct
47 Correct 1029 ms 91188 KB Output is correct
48 Correct 1022 ms 91976 KB Output is correct
49 Correct 1197 ms 91336 KB Output is correct
50 Correct 1156 ms 92024 KB Output is correct
51 Correct 1088 ms 91052 KB Output is correct
52 Correct 1127 ms 91596 KB Output is correct
53 Correct 1040 ms 91996 KB Output is correct
54 Correct 932 ms 91976 KB Output is correct
55 Correct 12 ms 23752 KB Output is correct
56 Incorrect 259 ms 90856 KB Output isn't correct
57 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23752 KB Output is correct
2 Correct 12 ms 23804 KB Output is correct
3 Correct 232 ms 79808 KB Output is correct
4 Correct 1095 ms 91988 KB Output is correct
5 Correct 815 ms 57664 KB Output is correct
6 Correct 948 ms 91980 KB Output is correct
7 Correct 827 ms 72136 KB Output is correct
8 Correct 1022 ms 91972 KB Output is correct
9 Correct 11 ms 23752 KB Output is correct
10 Correct 12 ms 23728 KB Output is correct
11 Correct 11 ms 23692 KB Output is correct
12 Correct 12 ms 23768 KB Output is correct
13 Incorrect 13 ms 23752 KB Output isn't correct
14 Halted 0 ms 0 KB -