oj.uz

Submission #458029

# Submission time Handle Problem Language Result Execution time Memory
458029 2021-08-07T18:57:04 Z wiwiho Rainforest Jumps (APIO21_jumps) C++14
48 / 100
 1502 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]){
            ans += 1 << i;
            start = large(i, start);
            assert(mn[ed] <= start && start <= mx[ed]);
        }
    }

    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 197 ms 71248 KB Output is correct
4 Correct 1317 ms 89612 KB Output is correct
5 Correct 880 ms 45236 KB Output is correct
6 Correct 1353 ms 89648 KB Output is correct
7 Correct 837 ms 61180 KB Output is correct
8 Correct 1308 ms 89608 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 0 ms 200 KB Output is correct
5 Correct 3 ms 200 KB Output is correct
6 Correct 3 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 2 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 1 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 0 ms 200 KB Output is correct
5 Correct 3 ms 200 KB Output is correct
6 Correct 3 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 2 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 67016 KB Output is correct
6 Correct 90 ms 83236 KB Output is correct
7 Correct 51 ms 42628 KB Output is correct
8 Correct 89 ms 83228 KB Output is correct
9 Correct 17 ms 12744 KB Output is correct
10 Correct 100 ms 83248 KB Output is correct
11 Correct 87 ms 89476 KB Output is correct
12 Correct 87 ms 87824 KB Output is correct
13 Correct 97 ms 87704 KB Output is correct
14 Correct 84 ms 83204 KB Output is correct
15 Incorrect 114 ms 89520 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 272 ms 38236 KB Output is correct
5 Correct 1103 ms 83332 KB Output is correct
6 Correct 416 ms 13976 KB Output is correct
7 Correct 1037 ms 83380 KB Output is correct
8 Correct 612 ms 28832 KB Output is correct
9 Correct 682 ms 83204 KB Output is correct
10 Correct 1191 ms 89584 KB Output is correct
11 Correct 1327 ms 89008 KB Output is correct
12 Correct 1334 ms 88604 KB Output is correct
13 Correct 1141 ms 83328 KB Output is correct
14 Correct 1290 ms 89644 KB Output is correct
15 Correct 1094 ms 89496 KB Output is correct
16 Correct 1042 ms 89480 KB Output is correct
17 Correct 0 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 4 ms 328 KB Output is correct
23 Correct 2 ms 328 KB Output is correct
24 Correct 4 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 17 ms 1104 KB Output is correct
28 Correct 17 ms 1188 KB Output is correct
29 Correct 22 ms 1100 KB Output is correct
30 Correct 25 ms 1096 KB Output is correct
31 Correct 16 ms 1096 KB Output is correct
32 Correct 1 ms 328 KB Output is correct
33 Correct 49 ms 48376 KB Output is correct
34 Correct 97 ms 83200 KB Output is correct
35 Correct 85 ms 88496 KB Output is correct
36 Correct 88 ms 83260 KB Output is correct
37 Correct 99 ms 89464 KB Output is correct
38 Correct 87 ms 89608 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 272 ms 38236 KB Output is correct
5 Correct 1103 ms 83332 KB Output is correct
6 Correct 416 ms 13976 KB Output is correct
7 Correct 1037 ms 83380 KB Output is correct
8 Correct 612 ms 28832 KB Output is correct
9 Correct 682 ms 83204 KB Output is correct
10 Correct 1191 ms 89584 KB Output is correct
11 Correct 1327 ms 89008 KB Output is correct
12 Correct 1334 ms 88604 KB Output is correct
13 Correct 1141 ms 83328 KB Output is correct
14 Correct 1290 ms 89644 KB Output is correct
15 Correct 1094 ms 89496 KB Output is correct
16 Correct 1042 ms 89480 KB Output is correct
17 Correct 0 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 4 ms 328 KB Output is correct
23 Correct 2 ms 328 KB Output is correct
24 Correct 4 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 17 ms 1104 KB Output is correct
28 Correct 17 ms 1188 KB Output is correct
29 Correct 22 ms 1100 KB Output is correct
30 Correct 25 ms 1096 KB Output is correct
31 Correct 16 ms 1096 KB Output is correct
32 Correct 1 ms 328 KB Output is correct
33 Correct 49 ms 48376 KB Output is correct
34 Correct 97 ms 83200 KB Output is correct
35 Correct 85 ms 88496 KB Output is correct
36 Correct 88 ms 83260 KB Output is correct
37 Correct 99 ms 89464 KB Output is correct
38 Correct 87 ms 89608 KB Output is correct
39 Correct 0 ms 200 KB Output is correct
40 Correct 0 ms 200 KB Output is correct
41 Correct 0 ms 200 KB Output is correct
42 Correct 312 ms 38264 KB Output is correct
43 Correct 1156 ms 83228 KB Output is correct
44 Correct 727 ms 13996 KB Output is correct
45 Correct 1157 ms 83220 KB Output is correct
46 Correct 535 ms 28832 KB Output is correct
47 Correct 862 ms 83204 KB Output is correct
48 Correct 1221 ms 89552 KB Output is correct
49 Correct 1502 ms 88968 KB Output is correct
50 Correct 1472 ms 88624 KB Output is correct
51 Correct 1073 ms 83348 KB Output is correct
52 Correct 1336 ms 89576 KB Output is correct
53 Correct 1296 ms 89472 KB Output is correct
54 Correct 1117 ms 89520 KB Output is correct
55 Correct 0 ms 200 KB Output is correct
56 Correct 158 ms 82980 KB Output is correct
57 Correct 1095 ms 83336 KB Output is correct
58 Correct 509 ms 14908 KB Output is correct
59 Correct 1083 ms 83204 KB Output is correct
60 Correct 325 ms 29692 KB Output is correct
61 Correct 1055 ms 83300 KB Output is correct
62 Correct 1182 ms 89632 KB Output is correct
63 Correct 1156 ms 87984 KB Output is correct
64 Correct 1359 ms 87176 KB Output is correct
65 Correct 944 ms 83348 KB Output is correct
66 Correct 1247 ms 89476 KB Output is correct
67 Correct 1182 ms 89628 KB Output is correct
68 Correct 1141 ms 89476 KB Output is correct
69 Correct 0 ms 200 KB Output is correct
70 Correct 1 ms 200 KB Output is correct
71 Correct 3 ms 328 KB Output is correct
72 Correct 3 ms 328 KB Output is correct
73 Correct 3 ms 328 KB Output is correct
74 Correct 3 ms 328 KB Output is correct
75 Correct 3 ms 328 KB Output is correct
76 Correct 1 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 3 ms 328 KB Output is correct
80 Correct 2 ms 328 KB Output is correct
81 Correct 1 ms 328 KB Output is correct
82 Correct 3 ms 328 KB Output is correct
83 Correct 3 ms 328 KB Output is correct
84 Correct 0 ms 328 KB Output is correct
85 Correct 6 ms 328 KB Output is correct
86 Correct 20 ms 1096 KB Output is correct
87 Correct 21 ms 1096 KB Output is correct
88 Correct 17 ms 1096 KB Output is correct
89 Correct 26 ms 1096 KB Output is correct
90 Correct 26 ms 1096 KB Output is correct
91 Correct 0 ms 328 KB Output is correct
92 Correct 1 ms 584 KB Output is correct
93 Correct 26 ms 1100 KB Output is correct
94 Correct 25 ms 1216 KB Output is correct
95 Correct 23 ms 1124 KB Output is correct
96 Correct 23 ms 1096 KB Output is correct
97 Correct 22 ms 1156 KB Output is correct
98 Correct 0 ms 200 KB Output is correct
99 Correct 88 ms 83116 KB Output is correct
100 Correct 87 ms 83392 KB Output is correct
101 Correct 98 ms 88064 KB Output is correct
102 Correct 82 ms 83248 KB Output is correct
103 Correct 110 ms 89584 KB Output is correct
104 Correct 87 ms 89500 KB Output is correct
105 Correct 0 ms 200 KB Output is correct
106 Correct 50 ms 48376 KB Output is correct
107 Correct 101 ms 83208 KB Output is correct
108 Correct 85 ms 88620 KB Output is correct
109 Correct 86 ms 83220 KB Output is correct
110 Correct 96 ms 89488 KB Output is correct
111 Correct 86 ms 89592 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 197 ms 71248 KB Output is correct
4 Correct 1317 ms 89612 KB Output is correct
5 Correct 880 ms 45236 KB Output is correct
6 Correct 1353 ms 89648 KB Output is correct
7 Correct 837 ms 61180 KB Output is correct
8 Correct 1308 ms 89608 KB Output is correct
9 Correct 1 ms 200 KB Output is correct
10 Correct 0 ms 200 KB Output is correct
11 Correct 1 ms 200 KB Output is correct
12 Correct 0 ms 200 KB Output is correct
13 Correct 3 ms 200 KB Output is correct
14 Correct 3 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 2 ms 328 KB Output isn't correct
19 Halted 0 ms 0 KB -