oj.uz

Submission #471911

# Submission time Handle Problem Language Result Execution time Memory
471911 2021-09-11T16:34:12 Z qwerasdfzxcl Rainforest Jumps (APIO21_jumps) C++14
44 / 100
 2193 ms 170164 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;
    }
    int query2(int l, int r){
        int ret = -1;
        for (l+=sz, r+=sz;l<r;l>>=1, r>>=1){
            if (l&1){
                ret = max(ret, tree[l].back());
                l++;
            }
            if (r&1){
                --r;
                ret = max(ret, tree[r].back());
            }
        }
        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 mx = tree.query2(C, D+1);
    int cur2 = B, cur3 = -1;
    for (int j=19;j>=0;j--) if (cur2-(1<<j)+1>=A && max(sp1[cur2][j], cur3)<mx){
        cur3 = max(sp1[cur2][j], cur3);
        cur2 -= (1<<j);
    }
    A = cur2+1;
    int tmp = tree.query(A, B+1, mx);
    if (tmp==-1) return -1;

    int cur = INV[tmp], ans = 0;
    /*cur2 = C, cur3 = -1;
    for (int j=19;j>=0;j--) if (cur2+(1<<j)-1<=D && max(sp2[cur2][j], cur3)<a[cur]){
        cur3 = max(sp2[cur2][j], cur3);
        cur2 += (1<<j);
    }
    C = cur2;*/

    for (int j=19;j>=0;j--) if (sp3[cur][j]!=-1 && a[sp3[cur][j]]<mx) cur = sp3[cur][j], ans += (1<<j);
    for (int j=19;j>=0;j--) if (sp4[cur][j]!=n && a[sp4[cur][j]]<=mx) cur = sp4[cur][j], ans += (1<<j);
    if (cur<C || cur>D) return -1;
    return ans;
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 28488 KB Output is correct
2 Correct 15 ms 28488 KB Output is correct
3 Incorrect 625 ms 140792 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 28436 KB Output is correct
2 Correct 15 ms 28488 KB Output is correct
3 Correct 16 ms 28488 KB Output is correct
4 Correct 16 ms 28476 KB Output is correct
5 Incorrect 18 ms 28500 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 28436 KB Output is correct
2 Correct 15 ms 28488 KB Output is correct
3 Correct 16 ms 28488 KB Output is correct
4 Correct 16 ms 28476 KB Output is correct
5 Incorrect 18 ms 28500 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 28488 KB Output is correct
2 Correct 16 ms 28504 KB Output is correct
3 Correct 15 ms 28408 KB Output is correct
4 Correct 18 ms 28488 KB Output is correct
5 Correct 474 ms 142056 KB Output is correct
6 Correct 641 ms 169864 KB Output is correct
7 Correct 300 ms 100520 KB Output is correct
8 Correct 585 ms 169872 KB Output is correct
9 Correct 89 ms 49380 KB Output is correct
10 Correct 588 ms 169948 KB Output is correct
11 Incorrect 594 ms 169896 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 28488 KB Output is correct
2 Correct 16 ms 28488 KB Output is correct
3 Correct 16 ms 28488 KB Output is correct
4 Correct 565 ms 92720 KB Output is correct
5 Correct 1717 ms 169980 KB Output is correct
6 Correct 715 ms 51468 KB Output is correct
7 Correct 1812 ms 169948 KB Output is correct
8 Correct 932 ms 76764 KB Output is correct
9 Correct 1760 ms 169920 KB Output is correct
10 Correct 1901 ms 169980 KB Output is correct
11 Correct 2039 ms 169924 KB Output is correct
12 Correct 1735 ms 169944 KB Output is correct
13 Correct 1797 ms 169948 KB Output is correct
14 Correct 2033 ms 169876 KB Output is correct
15 Correct 1758 ms 169980 KB Output is correct
16 Correct 1282 ms 169984 KB Output is correct
17 Correct 16 ms 28488 KB Output is correct
18 Correct 17 ms 28400 KB Output is correct
19 Correct 18 ms 28408 KB Output is correct
20 Correct 19 ms 28616 KB Output is correct
21 Correct 20 ms 28616 KB Output is correct
22 Correct 20 ms 28624 KB Output is correct
23 Correct 18 ms 28616 KB Output is correct
24 Correct 17 ms 28616 KB Output is correct
25 Correct 16 ms 28616 KB Output is correct
26 Correct 18 ms 29000 KB Output is correct
27 Correct 41 ms 29768 KB Output is correct
28 Correct 38 ms 29836 KB Output is correct
29 Correct 38 ms 29768 KB Output is correct
30 Correct 37 ms 29768 KB Output is correct
31 Correct 46 ms 29768 KB Output is correct
32 Correct 16 ms 28488 KB Output is correct
33 Correct 342 ms 109964 KB Output is correct
34 Correct 624 ms 169876 KB Output is correct
35 Correct 604 ms 169936 KB Output is correct
36 Correct 613 ms 169880 KB Output is correct
37 Correct 650 ms 169952 KB Output is correct
38 Correct 588 ms 169980 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 28488 KB Output is correct
2 Correct 16 ms 28488 KB Output is correct
3 Correct 16 ms 28488 KB Output is correct
4 Correct 565 ms 92720 KB Output is correct
5 Correct 1717 ms 169980 KB Output is correct
6 Correct 715 ms 51468 KB Output is correct
7 Correct 1812 ms 169948 KB Output is correct
8 Correct 932 ms 76764 KB Output is correct
9 Correct 1760 ms 169920 KB Output is correct
10 Correct 1901 ms 169980 KB Output is correct
11 Correct 2039 ms 169924 KB Output is correct
12 Correct 1735 ms 169944 KB Output is correct
13 Correct 1797 ms 169948 KB Output is correct
14 Correct 2033 ms 169876 KB Output is correct
15 Correct 1758 ms 169980 KB Output is correct
16 Correct 1282 ms 169984 KB Output is correct
17 Correct 16 ms 28488 KB Output is correct
18 Correct 17 ms 28400 KB Output is correct
19 Correct 18 ms 28408 KB Output is correct
20 Correct 19 ms 28616 KB Output is correct
21 Correct 20 ms 28616 KB Output is correct
22 Correct 20 ms 28624 KB Output is correct
23 Correct 18 ms 28616 KB Output is correct
24 Correct 17 ms 28616 KB Output is correct
25 Correct 16 ms 28616 KB Output is correct
26 Correct 18 ms 29000 KB Output is correct
27 Correct 41 ms 29768 KB Output is correct
28 Correct 38 ms 29836 KB Output is correct
29 Correct 38 ms 29768 KB Output is correct
30 Correct 37 ms 29768 KB Output is correct
31 Correct 46 ms 29768 KB Output is correct
32 Correct 16 ms 28488 KB Output is correct
33 Correct 342 ms 109964 KB Output is correct
34 Correct 624 ms 169876 KB Output is correct
35 Correct 604 ms 169936 KB Output is correct
36 Correct 613 ms 169880 KB Output is correct
37 Correct 650 ms 169952 KB Output is correct
38 Correct 588 ms 169980 KB Output is correct
39 Correct 16 ms 28420 KB Output is correct
40 Correct 16 ms 28488 KB Output is correct
41 Correct 17 ms 28488 KB Output is correct
42 Correct 547 ms 92772 KB Output is correct
43 Correct 1601 ms 170004 KB Output is correct
44 Correct 683 ms 51392 KB Output is correct
45 Correct 1648 ms 169984 KB Output is correct
46 Correct 1032 ms 76748 KB Output is correct
47 Correct 1611 ms 169968 KB Output is correct
48 Correct 2048 ms 170096 KB Output is correct
49 Correct 1760 ms 169900 KB Output is correct
50 Correct 1819 ms 169888 KB Output is correct
51 Correct 1554 ms 169876 KB Output is correct
52 Correct 1817 ms 169968 KB Output is correct
53 Correct 1582 ms 169916 KB Output is correct
54 Correct 1647 ms 169888 KB Output is correct
55 Correct 16 ms 28488 KB Output is correct
56 Correct 665 ms 169388 KB Output is correct
57 Correct 1531 ms 169936 KB Output is correct
58 Correct 712 ms 52932 KB Output is correct
59 Correct 1453 ms 169924 KB Output is correct
60 Correct 682 ms 78264 KB Output is correct
61 Correct 1848 ms 169920 KB Output is correct
62 Correct 1817 ms 169928 KB Output is correct
63 Correct 2169 ms 169920 KB Output is correct
64 Correct 1983 ms 169964 KB Output is correct
65 Correct 1842 ms 169948 KB Output is correct
66 Correct 2193 ms 169984 KB Output is correct
67 Correct 1814 ms 169984 KB Output is correct
68 Correct 1716 ms 169924 KB Output is correct
69 Correct 16 ms 28488 KB Output is correct
70 Correct 16 ms 28488 KB Output is correct
71 Correct 18 ms 28568 KB Output is correct
72 Correct 17 ms 28588 KB Output is correct
73 Correct 22 ms 28616 KB Output is correct
74 Correct 18 ms 28616 KB Output is correct
75 Correct 18 ms 28616 KB Output is correct
76 Correct 16 ms 28488 KB Output is correct
77 Correct 15 ms 28440 KB Output is correct
78 Correct 18 ms 28544 KB Output is correct
79 Correct 19 ms 28616 KB Output is correct
80 Correct 18 ms 28616 KB Output is correct
81 Correct 19 ms 28640 KB Output is correct
82 Correct 19 ms 28616 KB Output is correct
83 Correct 19 ms 28652 KB Output is correct
84 Correct 17 ms 28576 KB Output is correct
85 Correct 20 ms 28624 KB Output is correct
86 Correct 45 ms 29768 KB Output is correct
87 Correct 42 ms 29808 KB Output is correct
88 Correct 40 ms 29768 KB Output is correct
89 Correct 46 ms 29768 KB Output is correct
90 Correct 44 ms 29768 KB Output is correct
91 Correct 17 ms 28584 KB Output is correct
92 Correct 18 ms 29000 KB Output is correct
93 Correct 38 ms 29792 KB Output is correct
94 Correct 38 ms 29768 KB Output is correct
95 Correct 45 ms 29768 KB Output is correct
96 Correct 34 ms 29768 KB Output is correct
97 Correct 36 ms 29768 KB Output is correct
98 Correct 16 ms 28488 KB Output is correct
99 Correct 573 ms 169820 KB Output is correct
100 Correct 574 ms 169944 KB Output is correct
101 Correct 556 ms 170164 KB Output is correct
102 Correct 594 ms 170024 KB Output is correct
103 Correct 661 ms 169876 KB Output is correct
104 Correct 584 ms 169904 KB Output is correct
105 Correct 16 ms 28488 KB Output is correct
106 Correct 343 ms 110012 KB Output is correct
107 Correct 577 ms 169864 KB Output is correct
108 Correct 569 ms 169912 KB Output is correct
109 Correct 590 ms 169892 KB Output is correct
110 Correct 636 ms 170032 KB Output is correct
111 Correct 577 ms 169952 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 28488 KB Output is correct
2 Correct 15 ms 28488 KB Output is correct
3 Incorrect 625 ms 140792 KB Output isn't correct
4 Halted 0 ms 0 KB -