oj.uz

Submission #561308

# Submission time Handle Problem Language Result Execution time Memory
561308 2022-05-12T15:38:02 Z InternetPerson10 Rainforest Jumps (APIO21_jumps) C++17
27 / 100
 1365 ms 75916 KB 
#include "jumps.h"
#include <bits/stdc++.h>

using namespace std;

int subtask = 1;

int n;
vector<int> nums, l, r;
vector<vector<int>> liftBig, liftRight, liftLeft;

bool invalid(int k) {
    if(k == -1 || k == n) return true;
    return false;
}

int bigger(int a, int b) {
    if(invalid(a) && invalid(b)) return -1;
    if(invalid(a)) return b;
    if(invalid(b)) return a;
    if(nums[a] > nums[b]) return a;
    return b;
}

void init(int N, std::vector<int> H) {
    bool subtask1 = true;
    for(int i = 0; i < N; i++) {
        if(H[i] != i+1) subtask1 = false;
        H[i]--;
    }
    if(subtask1) subtask = 1;
    else subtask = 2;
    n = N;
    nums = H;
    l.resize(n, -1);
    r.resize(n, n);
    liftBig.resize(n, vector<int>(20));
    liftRight.resize(n, vector<int>(20));
    liftLeft.resize(n, vector<int>(20));
    vector<int> v;
    v.push_back(0);
    for(int i = 1; i < n; i++) {
        while(v.size()) {
            if(nums[v.back()] < nums[i]) {
                r[v.back()] = i;
                v.pop_back();
            }
            else break;
        }
        v.push_back(i);
    }
    v.clear();
    v.push_back(n-1);
    for(int i = n-2; i >= 0; i--) {
        while(v.size()) {
            if(nums[v.back()] < nums[i]) {
                l[v.back()] = i;
                v.pop_back();
            }
            else break;
        }
        v.push_back(i);
    }
    for(int j = 0; j < N; j++) {
        liftBig[j][0] = bigger(l[j], r[j]);
        liftLeft[j][0] = l[j];
        if(r[j] == n) liftRight[j][0] = -1;
        else liftRight[j][0] = r[j];
    }
    for(int i = 1; i < 20; i++) {
        for(int j = 0; j < N; j++) {
            if(liftBig[j][i-1] == -1) liftBig[j][i] = -1;
            else liftBig[j][i] = liftBig[liftBig[j][i-1]][i-1];
            if(liftRight[j][i-1] == -1) liftRight[j][i] = -1;
            else liftRight[j][i] = liftRight[liftRight[j][i-1]][i-1];
            if(liftLeft[j][i-1] == -1) liftLeft[j][i] = -1;
            else liftLeft[j][i] = liftLeft[liftLeft[j][i-1]][i-1];
        }
    }
}

int BIG = 1e9 + 7;

int reachable(int x, int C, int D) {
    if(C <= x && x <= D) return 0;
    if(x > D) return -1;
    int ans2 = BIG, tot = 0;
    for(int i = 19; i >= 0; i--) {
        if(liftRight[x][i] == -1) continue;
        if(liftRight[x][i] > D) continue;
        if(liftRight[x][i] >= C) ans2 = min(ans2, tot + (1 << i));
        else {
            x = liftRight[x][i];
            tot += (1 << i);
        }
    }
    if(ans2 == BIG) return -1;
    return ans2;
}

int single_min_jumps(int x, int C, int D) {
    int r = reachable(x, C, D);
    if(r == -1) return BIG;
    int ans = r;
    int tot = 0;
    for(int i = 19; i >= 0; i--) {
        if(liftBig[x][i] == -1) continue;
        int r = reachable(liftBig[x][i], C, D);
        if(r == -1) continue;
        ans = min(ans, tot + (1 << i) + r);
        if(r != 0) {
            x = liftBig[x][i];
            tot += (1 << i);
        }
    }
    return ans;
}

int minimum_jumps(int A, int B, int C, int D) {
    if(subtask == 1) {
        return C - B;
    }
    for(int i = 19; i >= 0; i--) {
        if(liftLeft[B][i] == -1) continue;
        if(liftLeft[B][i] < A) continue;
        B = liftLeft[B][i];
    }
    int ans = single_min_jumps(B, C, D);
    if(ans == BIG) return -1;
    return ans;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 240 ms 60564 KB Output is correct
4 Correct 1014 ms 75812 KB Output is correct
5 Correct 842 ms 38348 KB Output is correct
6 Correct 960 ms 75724 KB Output is correct
7 Correct 719 ms 52140 KB Output is correct
8 Correct 864 ms 75796 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Incorrect 2 ms 208 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Incorrect 2 ms 208 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 156 ms 60120 KB Output is correct
6 Correct 186 ms 74604 KB Output is correct
7 Correct 103 ms 38296 KB Output is correct
8 Correct 173 ms 74656 KB Output is correct
9 Correct 29 ms 11472 KB Output is correct
10 Correct 176 ms 74660 KB Output is correct
11 Correct 177 ms 75712 KB Output is correct
12 Incorrect 171 ms 75916 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 312 ms 34296 KB Output is correct
5 Correct 1102 ms 74664 KB Output is correct
6 Correct 534 ms 12496 KB Output is correct
7 Correct 1100 ms 74636 KB Output is correct
8 Correct 587 ms 25844 KB Output is correct
9 Correct 922 ms 74668 KB Output is correct
10 Correct 942 ms 75796 KB Output is correct
11 Correct 1119 ms 75744 KB Output is correct
12 Correct 1298 ms 75712 KB Output is correct
13 Correct 1006 ms 74824 KB Output is correct
14 Correct 1347 ms 75320 KB Output is correct
15 Correct 939 ms 75712 KB Output is correct
16 Correct 1065 ms 75824 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 2 ms 208 KB Output is correct
20 Correct 2 ms 336 KB Output is correct
21 Correct 3 ms 336 KB Output is correct
22 Correct 2 ms 336 KB Output is correct
23 Correct 3 ms 336 KB Output is correct
24 Correct 2 ms 336 KB Output is correct
25 Correct 0 ms 336 KB Output is correct
26 Correct 1 ms 464 KB Output is correct
27 Correct 25 ms 976 KB Output is correct
28 Correct 20 ms 976 KB Output is correct
29 Correct 18 ms 976 KB Output is correct
30 Correct 21 ms 976 KB Output is correct
31 Correct 17 ms 976 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 93 ms 43292 KB Output is correct
34 Correct 167 ms 74668 KB Output is correct
35 Correct 164 ms 75704 KB Output is correct
36 Correct 174 ms 74568 KB Output is correct
37 Correct 213 ms 75412 KB Output is correct
38 Correct 186 ms 75812 KB Output is correct

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 312 ms 34296 KB Output is correct
5 Correct 1102 ms 74664 KB Output is correct
6 Correct 534 ms 12496 KB Output is correct
7 Correct 1100 ms 74636 KB Output is correct
8 Correct 587 ms 25844 KB Output is correct
9 Correct 922 ms 74668 KB Output is correct
10 Correct 942 ms 75796 KB Output is correct
11 Correct 1119 ms 75744 KB Output is correct
12 Correct 1298 ms 75712 KB Output is correct
13 Correct 1006 ms 74824 KB Output is correct
14 Correct 1347 ms 75320 KB Output is correct
15 Correct 939 ms 75712 KB Output is correct
16 Correct 1065 ms 75824 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 2 ms 208 KB Output is correct
20 Correct 2 ms 336 KB Output is correct
21 Correct 3 ms 336 KB Output is correct
22 Correct 2 ms 336 KB Output is correct
23 Correct 3 ms 336 KB Output is correct
24 Correct 2 ms 336 KB Output is correct
25 Correct 0 ms 336 KB Output is correct
26 Correct 1 ms 464 KB Output is correct
27 Correct 25 ms 976 KB Output is correct
28 Correct 20 ms 976 KB Output is correct
29 Correct 18 ms 976 KB Output is correct
30 Correct 21 ms 976 KB Output is correct
31 Correct 17 ms 976 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 93 ms 43292 KB Output is correct
34 Correct 167 ms 74668 KB Output is correct
35 Correct 164 ms 75704 KB Output is correct
36 Correct 174 ms 74568 KB Output is correct
37 Correct 213 ms 75412 KB Output is correct
38 Correct 186 ms 75812 KB Output is correct
39 Correct 0 ms 208 KB Output is correct
40 Correct 1 ms 208 KB Output is correct
41 Correct 0 ms 208 KB Output is correct
42 Correct 223 ms 34296 KB Output is correct
43 Correct 989 ms 74696 KB Output is correct
44 Correct 633 ms 12572 KB Output is correct
45 Correct 899 ms 74568 KB Output is correct
46 Correct 605 ms 25812 KB Output is correct
47 Correct 1036 ms 74568 KB Output is correct
48 Correct 972 ms 75776 KB Output is correct
49 Correct 1194 ms 75784 KB Output is correct
50 Correct 1365 ms 75712 KB Output is correct
51 Correct 930 ms 74568 KB Output is correct
52 Correct 1142 ms 75276 KB Output is correct
53 Correct 1012 ms 75792 KB Output is correct
54 Correct 955 ms 75792 KB Output is correct
55 Correct 0 ms 208 KB Output is correct
56 Incorrect 221 ms 74276 KB Output isn't correct
57 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 240 ms 60564 KB Output is correct
4 Correct 1014 ms 75812 KB Output is correct
5 Correct 842 ms 38348 KB Output is correct
6 Correct 960 ms 75724 KB Output is correct
7 Correct 719 ms 52140 KB Output is correct
8 Correct 864 ms 75796 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 0 ms 208 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Incorrect 2 ms 208 KB Output isn't correct
14 Halted 0 ms 0 KB -