oj.uz

Submission #471916

# Submission time Handle Problem Language Result Execution time Memory
471916 2021-09-11T17:28:34 Z qwerasdfzxcl Rainforest Jumps (APIO21_jumps) C++14
48 / 100
 2280 ms 170124 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 query(int A, int C){
    int cur = A, ans = 0;
    if (A>C){
        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);
        if (cur!=C) return 1e9;
        return ans;
    }
    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;
}

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;

    /*int val1 = tree.query2(cur+1, C);
    if (val1<a[cur]) return 1;
    if (val1>mx) return -1;
    ans = query(cur, INV[val1])+1;

    cur2 = cur, cur3 = -1;
    for (int j=19;j>=0;j--) if (cur2-(1<<j)+1>=0 && max(sp1[cur2][j], cur3)<val1){
        cur3 = max(sp1[cur2][j], cur3);
        cur2 -= (1<<j);
    }
    if (cur2!=-1) ans = min(ans, query(cur, cur2)+1);
    return ans;*/
    return query(cur, C);
}

Compilation message

jumps.cpp: In function 'int minimum_jumps(int, int, int, int)':
jumps.cpp:124:25: warning: unused variable 'ans' [-Wunused-variable]
  124 |     int cur = INV[tmp], ans = 0;
      |                         ^~~

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 28408 KB Output is correct
3 Correct 610 ms 140812 KB Output is correct
4 Correct 2029 ms 170068 KB Output is correct
5 Correct 1506 ms 99252 KB Output is correct
6 Correct 2259 ms 169920 KB Output is correct
7 Correct 1515 ms 124736 KB Output is correct
8 Correct 2209 ms 169920 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 16 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 16 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 16 ms 28512 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 16 ms 28488 KB Output is correct
2 Correct 19 ms 28488 KB Output is correct
3 Correct 16 ms 28416 KB Output is correct
4 Correct 601 ms 92660 KB Output is correct
5 Correct 1660 ms 169956 KB Output is correct
6 Correct 940 ms 51448 KB Output is correct
7 Correct 1471 ms 169952 KB Output is correct
8 Correct 730 ms 76784 KB Output is correct
9 Correct 1600 ms 169972 KB Output is correct
10 Correct 1855 ms 169896 KB Output is correct
11 Correct 1845 ms 170024 KB Output is correct
12 Correct 1724 ms 169948 KB Output is correct
13 Correct 1619 ms 169920 KB Output is correct
14 Correct 1893 ms 169960 KB Output is correct
15 Correct 1745 ms 169936 KB Output is correct
16 Correct 1651 ms 169920 KB Output is correct
17 Correct 16 ms 28488 KB Output is correct
18 Correct 16 ms 28488 KB Output is correct
19 Correct 17 ms 28488 KB Output is correct
20 Correct 19 ms 28616 KB Output is correct
21 Correct 19 ms 28624 KB Output is correct
22 Correct 17 ms 28616 KB Output is correct
23 Correct 19 ms 28600 KB Output is correct
24 Correct 19 ms 28616 KB Output is correct
25 Correct 16 ms 28644 KB Output is correct
26 Correct 17 ms 29000 KB Output is correct
27 Correct 43 ms 29796 KB Output is correct
28 Correct 44 ms 29728 KB Output is correct
29 Correct 45 ms 29800 KB Output is correct
30 Correct 45 ms 29768 KB Output is correct
31 Correct 45 ms 29768 KB Output is correct
32 Correct 16 ms 28488 KB Output is correct
33 Correct 331 ms 110028 KB Output is correct
34 Correct 584 ms 169868 KB Output is correct
35 Correct 555 ms 169972 KB Output is correct
36 Correct 569 ms 169892 KB Output is correct
37 Correct 634 ms 170016 KB Output is correct
38 Correct 578 ms 169968 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 28488 KB Output is correct
2 Correct 19 ms 28488 KB Output is correct
3 Correct 16 ms 28416 KB Output is correct
4 Correct 601 ms 92660 KB Output is correct
5 Correct 1660 ms 169956 KB Output is correct
6 Correct 940 ms 51448 KB Output is correct
7 Correct 1471 ms 169952 KB Output is correct
8 Correct 730 ms 76784 KB Output is correct
9 Correct 1600 ms 169972 KB Output is correct
10 Correct 1855 ms 169896 KB Output is correct
11 Correct 1845 ms 170024 KB Output is correct
12 Correct 1724 ms 169948 KB Output is correct
13 Correct 1619 ms 169920 KB Output is correct
14 Correct 1893 ms 169960 KB Output is correct
15 Correct 1745 ms 169936 KB Output is correct
16 Correct 1651 ms 169920 KB Output is correct
17 Correct 16 ms 28488 KB Output is correct
18 Correct 16 ms 28488 KB Output is correct
19 Correct 17 ms 28488 KB Output is correct
20 Correct 19 ms 28616 KB Output is correct
21 Correct 19 ms 28624 KB Output is correct
22 Correct 17 ms 28616 KB Output is correct
23 Correct 19 ms 28600 KB Output is correct
24 Correct 19 ms 28616 KB Output is correct
25 Correct 16 ms 28644 KB Output is correct
26 Correct 17 ms 29000 KB Output is correct
27 Correct 43 ms 29796 KB Output is correct
28 Correct 44 ms 29728 KB Output is correct
29 Correct 45 ms 29800 KB Output is correct
30 Correct 45 ms 29768 KB Output is correct
31 Correct 45 ms 29768 KB Output is correct
32 Correct 16 ms 28488 KB Output is correct
33 Correct 331 ms 110028 KB Output is correct
34 Correct 584 ms 169868 KB Output is correct
35 Correct 555 ms 169972 KB Output is correct
36 Correct 569 ms 169892 KB Output is correct
37 Correct 634 ms 170016 KB Output is correct
38 Correct 578 ms 169968 KB Output is correct
39 Correct 16 ms 28452 KB Output is correct
40 Correct 15 ms 28432 KB Output is correct
41 Correct 16 ms 28488 KB Output is correct
42 Correct 550 ms 92688 KB Output is correct
43 Correct 1606 ms 170048 KB Output is correct
44 Correct 901 ms 51444 KB Output is correct
45 Correct 1812 ms 169948 KB Output is correct
46 Correct 849 ms 76732 KB Output is correct
47 Correct 1685 ms 169980 KB Output is correct
48 Correct 1866 ms 169920 KB Output is correct
49 Correct 1911 ms 169892 KB Output is correct
50 Correct 1737 ms 169900 KB Output is correct
51 Correct 1617 ms 169932 KB Output is correct
52 Correct 1997 ms 170000 KB Output is correct
53 Correct 1707 ms 169944 KB Output is correct
54 Correct 1581 ms 169900 KB Output is correct
55 Correct 16 ms 28448 KB Output is correct
56 Correct 644 ms 169392 KB Output is correct
57 Correct 1674 ms 169932 KB Output is correct
58 Correct 548 ms 52988 KB Output is correct
59 Correct 1514 ms 170100 KB Output is correct
60 Correct 737 ms 78324 KB Output is correct
61 Correct 1627 ms 169920 KB Output is correct
62 Correct 2207 ms 169920 KB Output is correct
63 Correct 2071 ms 170004 KB Output is correct
64 Correct 2280 ms 169940 KB Output is correct
65 Correct 1789 ms 169932 KB Output is correct
66 Correct 2149 ms 170124 KB Output is correct
67 Correct 1749 ms 169908 KB Output is correct
68 Correct 1545 ms 169888 KB Output is correct
69 Correct 21 ms 28488 KB Output is correct
70 Correct 19 ms 28488 KB Output is correct
71 Correct 20 ms 28584 KB Output is correct
72 Correct 22 ms 28616 KB Output is correct
73 Correct 20 ms 28764 KB Output is correct
74 Correct 19 ms 28616 KB Output is correct
75 Correct 19 ms 28616 KB Output is correct
76 Correct 19 ms 28500 KB Output is correct
77 Correct 22 ms 28488 KB Output is correct
78 Correct 18 ms 28500 KB Output is correct
79 Correct 21 ms 28688 KB Output is correct
80 Correct 18 ms 28644 KB Output is correct
81 Correct 19 ms 28652 KB Output is correct
82 Correct 21 ms 28616 KB Output is correct
83 Correct 20 ms 28700 KB Output is correct
84 Correct 18 ms 28636 KB Output is correct
85 Correct 29 ms 28580 KB Output is correct
86 Correct 54 ms 29768 KB Output is correct
87 Correct 61 ms 29788 KB Output is correct
88 Correct 47 ms 29768 KB Output is correct
89 Correct 39 ms 29768 KB Output is correct
90 Correct 43 ms 29768 KB Output is correct
91 Correct 18 ms 28712 KB Output is correct
92 Correct 18 ms 29000 KB Output is correct
93 Correct 44 ms 29856 KB Output is correct
94 Correct 50 ms 29840 KB Output is correct
95 Correct 52 ms 29768 KB Output is correct
96 Correct 48 ms 29852 KB Output is correct
97 Correct 36 ms 29744 KB Output is correct
98 Correct 16 ms 28388 KB Output is correct
99 Correct 669 ms 169664 KB Output is correct
100 Correct 583 ms 169872 KB Output is correct
101 Correct 565 ms 170048 KB Output is correct
102 Correct 631 ms 170084 KB Output is correct
103 Correct 692 ms 169868 KB Output is correct
104 Correct 615 ms 169920 KB Output is correct
105 Correct 19 ms 28388 KB Output is correct
106 Correct 412 ms 109992 KB Output is correct
107 Correct 616 ms 169932 KB Output is correct
108 Correct 590 ms 169956 KB Output is correct
109 Correct 592 ms 169960 KB Output is correct
110 Correct 689 ms 169864 KB Output is correct
111 Correct 627 ms 169932 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 28488 KB Output is correct
2 Correct 16 ms 28408 KB Output is correct
3 Correct 610 ms 140812 KB Output is correct
4 Correct 2029 ms 170068 KB Output is correct
5 Correct 1506 ms 99252 KB Output is correct
6 Correct 2259 ms 169920 KB Output is correct
7 Correct 1515 ms 124736 KB Output is correct
8 Correct 2209 ms 169920 KB Output is correct
9 Incorrect 16 ms 28488 KB Output isn't correct
10 Halted 0 ms 0 KB -