oj.uz

Submission #458032

# Submission time Handle Problem Language Result Execution time Memory
458032 2021-08-07T19:36:50 Z wiwiho Rainforest Jumps (APIO21_jumps) C++14
48 / 100
 1512 ms 89648 KB 
#include "jumps.h"

#include <bits/stdc++.h>
#include <bits/extc++.h>

#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define iter(a) a.begin(), a.end()
#define riter(a) a.rbegin(), a.rend()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(riter(a))
#define pb(a) push_back(a)
#define eb(a) emplace_back(a)
#define pf(a) push_front(a)
#define ef(a) emplace_front(a)
#define pob pop_back()
#define pof pop_front()
#define mp(a, b) make_pair(a, b)
#define F first
#define S second
#define mt make_tuple
#define gt(t, i) get<i>(t)
#define tomax(a, b) ((a) = max((a), (b)))
#define tomin(a, b) ((a) = min((a), (b)))
#define topos(a) ((a) = (((a) % MOD + MOD) % MOD))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define printv(a, b) {bool pvaspace=false; \
for(auto pva : a){ \
    if(pvaspace) b << " "; pvaspace=true;\
    b << pva;\
}\
b << "\n";}

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;
using tiii = tuple<int, int, int>;

const ll MOD = 1000000007;
const ll MAX = 2147483647;

template<typename A, typename B>
ostream& operator<<(ostream& o, pair<A, B> p){
    return o << '(' << p.F << ',' << p.S << ')';
}

ll ifloor(ll a, ll b){
    if(b < 0) a *= -1, b *= -1;
    if(a < 0) return (a - b + 1) / b;
    else return a / b;
}

ll iceil(ll a, ll b){
    if(b < 0) a *= -1, b *= -1;
    if(a > 0) return (a + b - 1) / b;
    else return a / b;
}

int SZ = 20;
int n;
struct Doubling{
    vector<vector<int>> a, mx;
    void resize(){
        a.resize(SZ, vector<int>(n));
        mx.resize(SZ, vector<int>(n));
    }
    void init(){
        for(int i = 0; i < n; i++) mx[0][i] = a[0][i];
        for(int i = 1; i < SZ; i++){
            for(int j = 0; j < n; j++){
                if(a[i - 1][j] == -1){
                    a[i][j] = -1;
                    continue;
                }
                a[i][j] = a[i - 1][a[i - 1][j]];
                mx[i][j] = max(mx[i - 1][j], mx[i - 1][a[i - 1][j]]);
            }
        }
    }
    int& operator()(int i, int j){
        return a[i][j];
    }
};

struct SparseTable{
    vector<vector<int>> st;
    vector<int> a;
    int maxarg(int p, int q){
        return a[p] > a[q] ? p : q;
    }
    void init(vector<int>& _a){
        a = _a;
        st.resize(SZ, vector<int>(n));
        for(int i = 0; i < n; i++) st[0][i] = i;
        for(int i = 1; i < SZ; i++){
            for(int j = 0; j + (1 << i) - 1 < n; j++){
                st[i][j] = maxarg(st[i - 1][j], st[i - 1][j + (1 << (i - 1))]);
            }
        }
    }
    int query(int l, int r){
        int lg = __lg(r - l + 1);
        return maxarg(st[lg][l], st[lg][r - (1 << lg) + 1]);
    }
};

Doubling small, large;
SparseTable st;
vector<int> mn, mx;

int dfs(int l, int r, int lp, int rp, int p){
    if(l > r) return p;
    int pos = st.query(l, r);
    mn[pos] = l;
    mx[pos] = r;
    small(0, pos) = p;
    large(0, pos) = p ^ lp ^ rp;
    dfs(l, pos - 1, lp, pos, pos);
    dfs(pos + 1, r, pos, rp, pos);
    return pos;
}

void init(int N, vector<int> H){
    n = N;
    mn.resize(n);
    mx.resize(n);
    st.init(H);
    small.resize();
    large.resize();
    dfs(0, n - 1, -1, -1, -1);
    small.init();
    large.init();
//    printv(small.a[0], cerr);
//    printv(large.a[0], cerr);
}

int minimum_jumps(int A, int B, int C, int D){

    int ed = st.query(C, D);
    A = max(A, mn[ed]);
    if(A > B) return -1;

    int start = st.query(A, B);
    if(mx[start] >= C){
        int tmp = st.query(C, mx[start]);
        if(mn[tmp] <= B){
            assert(C <= small(0, start) || C <= large(0, start));
            return 1;
        }
    }
//    cerr << "start " << start << "\n";
    if(C <= small(0, start)) return 1;

    int ans = 0;
    for(int i = SZ - 1; i >= 0; i--){
        if(large(i, start) != -1 && mn[ed] <= large(i, start) && large(i, start) <= mx[ed] && large.mx[i][start] < C){
            ans += 1 << i;
            start = large(i, start);
            assert(mn[ed] <= start && start <= mx[ed]);
        }
    }

    if(large(0, start) != -1 && mn[ed] <= large(0, start) && large(0, start) <= mx[ed]){
        ans++;
        start = large(0, start);
    }
    if(start >= C) return ans;

    for(int i = SZ - 1; i >= 0; i--){
        if(small(i, start) != -1 && small.mx[i][start] < C){
            ans += 1 << i;
            start = small(i, start);
        }
    }
    start = small(0, start);
    assert(C <= start && start <= D);
//    cerr << "end " << small(0, start) << "\n";

    return ans + 1;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 231 ms 71240 KB Output is correct
4 Correct 1193 ms 89496 KB Output is correct
5 Correct 1209 ms 45340 KB Output is correct
6 Correct 1215 ms 89544 KB Output is correct
7 Correct 801 ms 61224 KB Output is correct
8 Correct 1318 ms 89520 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 1 ms 220 KB Output is correct
4 Correct 0 ms 200 KB Output is correct
5 Correct 2 ms 200 KB Output is correct
6 Correct 2 ms 328 KB Output is correct
7 Correct 2 ms 328 KB Output is correct
8 Correct 3 ms 328 KB Output is correct
9 Correct 1 ms 328 KB Output is correct
10 Incorrect 3 ms 328 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 1 ms 220 KB Output is correct
4 Correct 0 ms 200 KB Output is correct
5 Correct 2 ms 200 KB Output is correct
6 Correct 2 ms 328 KB Output is correct
7 Correct 2 ms 328 KB Output is correct
8 Correct 3 ms 328 KB Output is correct
9 Correct 1 ms 328 KB Output is correct
10 Incorrect 3 ms 328 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 0 ms 200 KB Output is correct
4 Correct 0 ms 200 KB Output is correct
5 Correct 70 ms 67108 KB Output is correct
6 Correct 86 ms 83248 KB Output is correct
7 Correct 42 ms 42672 KB Output is correct
8 Correct 85 ms 83248 KB Output is correct
9 Correct 13 ms 12696 KB Output is correct
10 Correct 84 ms 83248 KB Output is correct
11 Correct 102 ms 89492 KB Output is correct
12 Correct 84 ms 87880 KB Output is correct
13 Correct 84 ms 87680 KB Output is correct
14 Correct 84 ms 83216 KB Output is correct
15 Incorrect 97 ms 89496 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 0 ms 200 KB Output is correct
4 Correct 252 ms 38180 KB Output is correct
5 Correct 945 ms 83256 KB Output is correct
6 Correct 753 ms 13980 KB Output is correct
7 Correct 1060 ms 83248 KB Output is correct
8 Correct 634 ms 28848 KB Output is correct
9 Correct 1022 ms 83324 KB Output is correct
10 Correct 1028 ms 89520 KB Output is correct
11 Correct 1432 ms 88980 KB Output is correct
12 Correct 1322 ms 88704 KB Output is correct
13 Correct 962 ms 83248 KB Output is correct
14 Correct 1352 ms 89476 KB Output is correct
15 Correct 830 ms 89648 KB Output is correct
16 Correct 1063 ms 89480 KB Output is correct
17 Correct 1 ms 200 KB Output is correct
18 Correct 0 ms 200 KB Output is correct
19 Correct 2 ms 200 KB Output is correct
20 Correct 3 ms 328 KB Output is correct
21 Correct 3 ms 328 KB Output is correct
22 Correct 3 ms 328 KB Output is correct
23 Correct 3 ms 328 KB Output is correct
24 Correct 3 ms 328 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 1 ms 584 KB Output is correct
27 Correct 18 ms 1096 KB Output is correct
28 Correct 16 ms 1096 KB Output is correct
29 Correct 20 ms 1096 KB Output is correct
30 Correct 28 ms 1164 KB Output is correct
31 Correct 22 ms 1096 KB Output is correct
32 Correct 0 ms 200 KB Output is correct
33 Correct 47 ms 48292 KB Output is correct
34 Correct 84 ms 83288 KB Output is correct
35 Correct 88 ms 88516 KB Output is correct
36 Correct 82 ms 83332 KB Output is correct
37 Correct 106 ms 89500 KB Output is correct
38 Correct 102 ms 89472 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 0 ms 200 KB Output is correct
4 Correct 252 ms 38180 KB Output is correct
5 Correct 945 ms 83256 KB Output is correct
6 Correct 753 ms 13980 KB Output is correct
7 Correct 1060 ms 83248 KB Output is correct
8 Correct 634 ms 28848 KB Output is correct
9 Correct 1022 ms 83324 KB Output is correct
10 Correct 1028 ms 89520 KB Output is correct
11 Correct 1432 ms 88980 KB Output is correct
12 Correct 1322 ms 88704 KB Output is correct
13 Correct 962 ms 83248 KB Output is correct
14 Correct 1352 ms 89476 KB Output is correct
15 Correct 830 ms 89648 KB Output is correct
16 Correct 1063 ms 89480 KB Output is correct
17 Correct 1 ms 200 KB Output is correct
18 Correct 0 ms 200 KB Output is correct
19 Correct 2 ms 200 KB Output is correct
20 Correct 3 ms 328 KB Output is correct
21 Correct 3 ms 328 KB Output is correct
22 Correct 3 ms 328 KB Output is correct
23 Correct 3 ms 328 KB Output is correct
24 Correct 3 ms 328 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 1 ms 584 KB Output is correct
27 Correct 18 ms 1096 KB Output is correct
28 Correct 16 ms 1096 KB Output is correct
29 Correct 20 ms 1096 KB Output is correct
30 Correct 28 ms 1164 KB Output is correct
31 Correct 22 ms 1096 KB Output is correct
32 Correct 0 ms 200 KB Output is correct
33 Correct 47 ms 48292 KB Output is correct
34 Correct 84 ms 83288 KB Output is correct
35 Correct 88 ms 88516 KB Output is correct
36 Correct 82 ms 83332 KB Output is correct
37 Correct 106 ms 89500 KB Output is correct
38 Correct 102 ms 89472 KB Output is correct
39 Correct 0 ms 200 KB Output is correct
40 Correct 1 ms 200 KB Output is correct
41 Correct 1 ms 200 KB Output is correct
42 Correct 302 ms 38232 KB Output is correct
43 Correct 1004 ms 83324 KB Output is correct
44 Correct 717 ms 14048 KB Output is correct
45 Correct 1008 ms 83220 KB Output is correct
46 Correct 528 ms 28848 KB Output is correct
47 Correct 1101 ms 83220 KB Output is correct
48 Correct 1366 ms 89504 KB Output is correct
49 Correct 1291 ms 89008 KB Output is correct
50 Correct 1500 ms 88832 KB Output is correct
51 Correct 1079 ms 83248 KB Output is correct
52 Correct 1496 ms 89584 KB Output is correct
53 Correct 1326 ms 89504 KB Output is correct
54 Correct 1241 ms 89524 KB Output is correct
55 Correct 0 ms 200 KB Output is correct
56 Correct 153 ms 82956 KB Output is correct
57 Correct 1053 ms 83296 KB Output is correct
58 Correct 443 ms 14908 KB Output is correct
59 Correct 1159 ms 83248 KB Output is correct
60 Correct 467 ms 29732 KB Output is correct
61 Correct 920 ms 83248 KB Output is correct
62 Correct 1512 ms 89520 KB Output is correct
63 Correct 1010 ms 87900 KB Output is correct
64 Correct 1437 ms 87192 KB Output is correct
65 Correct 1051 ms 83204 KB Output is correct
66 Correct 1183 ms 89492 KB Output is correct
67 Correct 1237 ms 89480 KB Output is correct
68 Correct 1004 ms 89488 KB Output is correct
69 Correct 0 ms 200 KB Output is correct
70 Correct 1 ms 200 KB Output is correct
71 Correct 2 ms 328 KB Output is correct
72 Correct 2 ms 328 KB Output is correct
73 Correct 3 ms 328 KB Output is correct
74 Correct 5 ms 328 KB Output is correct
75 Correct 3 ms 328 KB Output is correct
76 Correct 0 ms 200 KB Output is correct
77 Correct 0 ms 200 KB Output is correct
78 Correct 2 ms 200 KB Output is correct
79 Correct 2 ms 328 KB Output is correct
80 Correct 3 ms 328 KB Output is correct
81 Correct 3 ms 328 KB Output is correct
82 Correct 2 ms 328 KB Output is correct
83 Correct 2 ms 328 KB Output is correct
84 Correct 0 ms 328 KB Output is correct
85 Correct 5 ms 328 KB Output is correct
86 Correct 18 ms 1216 KB Output is correct
87 Correct 25 ms 1096 KB Output is correct
88 Correct 27 ms 1096 KB Output is correct
89 Correct 26 ms 1160 KB Output is correct
90 Correct 19 ms 1096 KB Output is correct
91 Correct 1 ms 328 KB Output is correct
92 Correct 1 ms 584 KB Output is correct
93 Correct 18 ms 1096 KB Output is correct
94 Correct 17 ms 1152 KB Output is correct
95 Correct 25 ms 1100 KB Output is correct
96 Correct 11 ms 1096 KB Output is correct
97 Correct 24 ms 1096 KB Output is correct
98 Correct 1 ms 200 KB Output is correct
99 Correct 84 ms 83096 KB Output is correct
100 Correct 84 ms 83248 KB Output is correct
101 Correct 83 ms 88112 KB Output is correct
102 Correct 84 ms 83316 KB Output is correct
103 Correct 91 ms 89520 KB Output is correct
104 Correct 84 ms 89476 KB Output is correct
105 Correct 0 ms 200 KB Output is correct
106 Correct 47 ms 48332 KB Output is correct
107 Correct 85 ms 83280 KB Output is correct
108 Correct 83 ms 88580 KB Output is correct
109 Correct 84 ms 83248 KB Output is correct
110 Correct 94 ms 89520 KB Output is correct
111 Correct 84 ms 89520 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 231 ms 71240 KB Output is correct
4 Correct 1193 ms 89496 KB Output is correct
5 Correct 1209 ms 45340 KB Output is correct
6 Correct 1215 ms 89544 KB Output is correct
7 Correct 801 ms 61224 KB Output is correct
8 Correct 1318 ms 89520 KB Output is correct
9 Correct 0 ms 200 KB Output is correct
10 Correct 0 ms 200 KB Output is correct
11 Correct 1 ms 220 KB Output is correct
12 Correct 0 ms 200 KB Output is correct
13 Correct 2 ms 200 KB Output is correct
14 Correct 2 ms 328 KB Output is correct
15 Correct 2 ms 328 KB Output is correct
16 Correct 3 ms 328 KB Output is correct
17 Correct 1 ms 328 KB Output is correct
18 Incorrect 3 ms 328 KB Output isn't correct
19 Halted 0 ms 0 KB -