oj.uz

Submission #471904

# Submission time Handle Problem Language Result Execution time Memory
471904 2021-09-11T15:43:05 Z qwerasdfzxcl Rainforest Jumps (APIO21_jumps) C++14
27 / 100
 2016 ms 170188 KB 
#include "jumps.h"
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
vector<int> sp1[200200], sp2[200200], sp3[200200], sp4[200200], a;
int n, l[200200], r[200200], INV[200200];
struct MST{
    vector<int> tree[400400];
    int sz;
    void init(int n){
        sz = n;
        for (int i=sz;i<sz*2;i++) tree[i].push_back(a[i-sz]);
        for (int i=sz-1;i;i--){
            tree[i].resize(tree[i<<1].size()+tree[i<<1|1].size());
            merge(tree[i<<1].begin(), tree[i<<1].end(), tree[i<<1|1].begin(), tree[i<<1|1].end(), tree[i].begin());
        }
    }
    int query(int l, int r, int x){
        int ret = -1;
        for (l+=sz, r+=sz;l<r;l>>=1, r>>=1){
            if (l&1){
                auto iter = lower_bound(tree[l].begin(), tree[l].end(), x);
                if (iter!=tree[l].begin()) ret = max(ret, *(--iter));
                l++;
            }
            if (r&1){
                --r;
                auto iter = lower_bound(tree[r].begin(), tree[r].end(), x);
                if (iter!=tree[r].begin()) ret = max(ret, *(--iter));
            }
        }
        return ret;
    }
}tree;

int geth(int x){
    if (x<0) return -1e9;
    if (x>=n) return -1e9;
    return a[x];
}

void init(int N, std::vector<int> H) {
    n = N, a = H;
    for (int i=0;i<n;i++){
        INV[H[i]] = i;
        sp1[i].push_back(H[i]);
        sp2[i].push_back(H[i]);
    }
    for (int j=1;j<20;j++){
        for (int i=0;i<n;i++){
            if (i-(1<<j)+1<0) sp1[i].push_back(-1);
            else sp1[i].push_back(max(sp1[i][j-1], sp1[i-(1<<(j-1))][j-1]));
            if (i+(1<<j)-1>=n) sp2[i].push_back(-1);
            else sp2[i].push_back(max(sp2[i][j-1], sp2[i+(1<<(j-1))][j-1]));
        }
    }
    for (int i=0;i<n;i++){
        int cur = i-1, cur2 = -1e9;
        for (int j=19;j>=0;j--) if (cur!=-1 && sp1[cur][j]!=-1 && max(cur2, sp1[cur][j])<H[i]){
            cur2 = max(cur2, sp1[cur][j]);
            cur -= (1<<j);
        }
        l[i] = cur; cur = i+1, cur2 = -1e9;
        for (int j=19;j>=0;j--) if (cur!=n && sp2[cur][j]!=-1 && sp2[cur][j]<H[i]){
            cur2 = max(cur2, sp1[cur][j]);
            cur += (1<<j);
        }
        r[i] = cur;
        if (geth(l[i])>=geth(r[i])) sp3[i].push_back(l[i]);
        else sp3[i].push_back(r[i]);
        sp4[i].push_back(r[i]);
        //printf("%d %d\n", l[i], r[i]);
    }
    for (int j=1;j<20;j++){
        for (int i=0;i<n;i++){
            if (sp3[i][j-1]==-1) sp3[i].push_back(-1);
            else sp3[i].push_back(sp3[sp3[i][j-1]][j-1]);
            if (sp4[i][j-1]==n) sp4[i].push_back(n);
            else sp4[i].push_back(sp4[sp4[i][j-1]][j-1]);
        }
    }
    tree.init(n);
}

int minimum_jumps(int A, int B, int C, int D) {
    int tmp = tree.query(A, B+1, a[C]);
    if (tmp==-1) return -1;
    int cur = INV[tmp], ans = 0;
    for (int j=19;j>=0;j--) if (sp3[cur][j]!=-1 && a[sp3[cur][j]]<a[C]) cur = sp3[cur][j], ans += (1<<j);
    for (int j=19;j>=0;j--) if (sp4[cur][j]!=n && a[sp4[cur][j]]<=a[C]) cur = sp4[cur][j], ans += (1<<j);
    if (cur!=C) return -1;
    return ans;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 28488 KB Output is correct
2 Correct 16 ms 28488 KB Output is correct
3 Correct 556 ms 140856 KB Output is correct
4 Correct 2016 ms 169876 KB Output is correct
5 Correct 1405 ms 99220 KB Output is correct
6 Correct 1789 ms 169964 KB Output is correct
7 Correct 1532 ms 124736 KB Output is correct
8 Correct 1976 ms 169968 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 17 ms 28488 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 17 ms 28488 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 17 ms 28432 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 28488 KB Output is correct
2 Correct 18 ms 28488 KB Output is correct
3 Correct 18 ms 28492 KB Output is correct
4 Correct 559 ms 92744 KB Output is correct
5 Correct 1865 ms 169920 KB Output is correct
6 Correct 916 ms 51456 KB Output is correct
7 Correct 1763 ms 169976 KB Output is correct
8 Correct 872 ms 76864 KB Output is correct
9 Correct 1797 ms 169920 KB Output is correct
10 Correct 1861 ms 169920 KB Output is correct
11 Correct 1783 ms 170076 KB Output is correct
12 Correct 1862 ms 169920 KB Output is correct
13 Correct 1752 ms 169920 KB Output is correct
14 Correct 1990 ms 170012 KB Output is correct
15 Correct 1490 ms 169964 KB Output is correct
16 Correct 1644 ms 169960 KB Output is correct
17 Correct 18 ms 28488 KB Output is correct
18 Correct 17 ms 28488 KB Output is correct
19 Correct 20 ms 28420 KB Output is correct
20 Correct 19 ms 28616 KB Output is correct
21 Correct 21 ms 28632 KB Output is correct
22 Correct 20 ms 28648 KB Output is correct
23 Correct 22 ms 28616 KB Output is correct
24 Correct 21 ms 28616 KB Output is correct
25 Correct 18 ms 28616 KB Output is correct
26 Correct 20 ms 29000 KB Output is correct
27 Correct 39 ms 29768 KB Output is correct
28 Correct 48 ms 29816 KB Output is correct
29 Correct 44 ms 29876 KB Output is correct
30 Correct 43 ms 29776 KB Output is correct
31 Correct 45 ms 29804 KB Output is correct
32 Correct 17 ms 28488 KB Output is correct
33 Correct 351 ms 109976 KB Output is correct
34 Correct 588 ms 170048 KB Output is correct
35 Correct 578 ms 169952 KB Output is correct
36 Correct 571 ms 169900 KB Output is correct
37 Correct 649 ms 169956 KB Output is correct
38 Correct 583 ms 170108 KB Output is correct

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 28488 KB Output is correct
2 Correct 18 ms 28488 KB Output is correct
3 Correct 18 ms 28492 KB Output is correct
4 Correct 559 ms 92744 KB Output is correct
5 Correct 1865 ms 169920 KB Output is correct
6 Correct 916 ms 51456 KB Output is correct
7 Correct 1763 ms 169976 KB Output is correct
8 Correct 872 ms 76864 KB Output is correct
9 Correct 1797 ms 169920 KB Output is correct
10 Correct 1861 ms 169920 KB Output is correct
11 Correct 1783 ms 170076 KB Output is correct
12 Correct 1862 ms 169920 KB Output is correct
13 Correct 1752 ms 169920 KB Output is correct
14 Correct 1990 ms 170012 KB Output is correct
15 Correct 1490 ms 169964 KB Output is correct
16 Correct 1644 ms 169960 KB Output is correct
17 Correct 18 ms 28488 KB Output is correct
18 Correct 17 ms 28488 KB Output is correct
19 Correct 20 ms 28420 KB Output is correct
20 Correct 19 ms 28616 KB Output is correct
21 Correct 21 ms 28632 KB Output is correct
22 Correct 20 ms 28648 KB Output is correct
23 Correct 22 ms 28616 KB Output is correct
24 Correct 21 ms 28616 KB Output is correct
25 Correct 18 ms 28616 KB Output is correct
26 Correct 20 ms 29000 KB Output is correct
27 Correct 39 ms 29768 KB Output is correct
28 Correct 48 ms 29816 KB Output is correct
29 Correct 44 ms 29876 KB Output is correct
30 Correct 43 ms 29776 KB Output is correct
31 Correct 45 ms 29804 KB Output is correct
32 Correct 17 ms 28488 KB Output is correct
33 Correct 351 ms 109976 KB Output is correct
34 Correct 588 ms 170048 KB Output is correct
35 Correct 578 ms 169952 KB Output is correct
36 Correct 571 ms 169900 KB Output is correct
37 Correct 649 ms 169956 KB Output is correct
38 Correct 583 ms 170108 KB Output is correct
39 Correct 17 ms 28488 KB Output is correct
40 Correct 17 ms 28488 KB Output is correct
41 Correct 19 ms 28404 KB Output is correct
42 Correct 496 ms 92712 KB Output is correct
43 Correct 1707 ms 169980 KB Output is correct
44 Correct 888 ms 51424 KB Output is correct
45 Correct 1701 ms 169920 KB Output is correct
46 Correct 865 ms 76724 KB Output is correct
47 Correct 1903 ms 170048 KB Output is correct
48 Correct 1811 ms 169892 KB Output is correct
49 Correct 1706 ms 169956 KB Output is correct
50 Correct 1663 ms 169912 KB Output is correct
51 Correct 1591 ms 169884 KB Output is correct
52 Correct 1901 ms 170188 KB Output is correct
53 Correct 1582 ms 169916 KB Output is correct
54 Correct 1558 ms 169864 KB Output is correct
55 Correct 18 ms 28488 KB Output is correct
56 Incorrect 630 ms 169500 KB Output isn't correct
57 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 28488 KB Output is correct
2 Correct 16 ms 28488 KB Output is correct
3 Correct 556 ms 140856 KB Output is correct
4 Correct 2016 ms 169876 KB Output is correct
5 Correct 1405 ms 99220 KB Output is correct
6 Correct 1789 ms 169964 KB Output is correct
7 Correct 1532 ms 124736 KB Output is correct
8 Correct 1976 ms 169968 KB Output is correct
9 Incorrect 17 ms 28488 KB Output isn't correct
10 Halted 0 ms 0 KB -