oj.uz

Submission #561315

# Submission time Handle Problem Language Result Execution time Memory
561315 2022-05-12T15:44:14 Z InternetPerson10 Rainforest Jumps (APIO21_jumps) C++17
27 / 100
 1522 ms 75900 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 if(N <= 200) subtask = 2;
    else subtask = 3;
    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;
    if(subtask == 2) {
        while(liftBig[x][0] != -1) {
            x = liftBig[x][0];
            tot++;
            r = reachable(x, C, D);
            if(r != -1) ans = min(ans, r + tot);
        }
        return ans;
    }
    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 260 ms 60624 KB Output is correct
4 Correct 990 ms 75816 KB Output is correct
5 Correct 966 ms 38344 KB Output is correct
6 Correct 1154 ms 75800 KB Output is correct
7 Correct 777 ms 52200 KB Output is correct
8 Correct 898 ms 75796 KB Output is correct

Subtask #2
0 / 8.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 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 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 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 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 173 ms 60048 KB Output is correct
6 Correct 233 ms 74664 KB Output is correct
7 Correct 94 ms 38316 KB Output is correct
8 Correct 201 ms 74548 KB Output is correct
9 Correct 37 ms 11488 KB Output is correct
10 Correct 173 ms 74580 KB Output is correct
11 Correct 178 ms 75736 KB Output is correct
12 Incorrect 193 ms 75840 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 314 ms 34296 KB Output is correct
5 Correct 1121 ms 74664 KB Output is correct
6 Correct 752 ms 12556 KB Output is correct
7 Correct 1181 ms 74732 KB Output is correct
8 Correct 652 ms 25968 KB Output is correct
9 Correct 1072 ms 74660 KB Output is correct
10 Correct 977 ms 75900 KB Output is correct
11 Correct 1314 ms 75792 KB Output is correct
12 Correct 1371 ms 75816 KB Output is correct
13 Correct 932 ms 74668 KB Output is correct
14 Correct 1522 ms 75204 KB Output is correct
15 Correct 823 ms 75800 KB Output is correct
16 Correct 882 ms 75732 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 3 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 27 ms 976 KB Output is correct
28 Correct 13 ms 976 KB Output is correct
29 Correct 23 ms 976 KB Output is correct
30 Correct 19 ms 976 KB Output is correct
31 Correct 19 ms 976 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 93 ms 43288 KB Output is correct
34 Correct 172 ms 74656 KB Output is correct
35 Correct 187 ms 75884 KB Output is correct
36 Correct 167 ms 74780 KB Output is correct
37 Correct 185 ms 75316 KB Output is correct
38 Correct 172 ms 75808 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 314 ms 34296 KB Output is correct
5 Correct 1121 ms 74664 KB Output is correct
6 Correct 752 ms 12556 KB Output is correct
7 Correct 1181 ms 74732 KB Output is correct
8 Correct 652 ms 25968 KB Output is correct
9 Correct 1072 ms 74660 KB Output is correct
10 Correct 977 ms 75900 KB Output is correct
11 Correct 1314 ms 75792 KB Output is correct
12 Correct 1371 ms 75816 KB Output is correct
13 Correct 932 ms 74668 KB Output is correct
14 Correct 1522 ms 75204 KB Output is correct
15 Correct 823 ms 75800 KB Output is correct
16 Correct 882 ms 75732 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 3 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 27 ms 976 KB Output is correct
28 Correct 13 ms 976 KB Output is correct
29 Correct 23 ms 976 KB Output is correct
30 Correct 19 ms 976 KB Output is correct
31 Correct 19 ms 976 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 93 ms 43288 KB Output is correct
34 Correct 172 ms 74656 KB Output is correct
35 Correct 187 ms 75884 KB Output is correct
36 Correct 167 ms 74780 KB Output is correct
37 Correct 185 ms 75316 KB Output is correct
38 Correct 172 ms 75808 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 299 ms 34208 KB Output is correct
43 Correct 1110 ms 74544 KB Output is correct
44 Correct 630 ms 12532 KB Output is correct
45 Correct 1059 ms 74672 KB Output is correct
46 Correct 499 ms 25900 KB Output is correct
47 Correct 986 ms 74668 KB Output is correct
48 Correct 1055 ms 75800 KB Output is correct
49 Correct 1217 ms 75824 KB Output is correct
50 Correct 1376 ms 75724 KB Output is correct
51 Correct 906 ms 74660 KB Output is correct
52 Correct 1408 ms 75204 KB Output is correct
53 Correct 861 ms 75820 KB Output is correct
54 Correct 891 ms 75808 KB Output is correct
55 Correct 0 ms 208 KB Output is correct
56 Incorrect 210 ms 74372 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 260 ms 60624 KB Output is correct
4 Correct 990 ms 75816 KB Output is correct
5 Correct 966 ms 38344 KB Output is correct
6 Correct 1154 ms 75800 KB Output is correct
7 Correct 777 ms 52200 KB Output is correct
8 Correct 898 ms 75796 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 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 -