oj.uz

Submission #561298

# Submission time Handle Problem Language Result Execution time Memory
561298 2022-05-12T15:28:32 Z InternetPerson10 Rainforest Jumps (APIO21_jumps) C++17
27 / 100
 4000 ms 52388 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;

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));
    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]);
        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];
        }
    }
}

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 ans = BIG;
    int tot = 0;
    int r = reachable(x, C, D);
    if(r != -1) ans = min(ans, r);
    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;
    }
    int ans = BIG;
    for(int i = A; i <= B; i++) {
        ans = min(ans, single_min_jumps(i, 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 0 ms 208 KB Output is correct
3 Correct 170 ms 41840 KB Output is correct
4 Correct 918 ms 52260 KB Output is correct
5 Correct 775 ms 26560 KB Output is correct
6 Correct 810 ms 52264 KB Output is correct
7 Correct 733 ms 36136 KB Output is correct
8 Correct 826 ms 52388 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 Correct 2 ms 208 KB Output is correct
6 Correct 4 ms 336 KB Output is correct
7 Correct 3 ms 336 KB Output is correct
8 Correct 4 ms 336 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 6 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 7 ms 256 KB Output is correct
13 Correct 5 ms 336 KB Output is correct
14 Correct 3 ms 336 KB Output is correct
15 Incorrect 7 ms 336 KB Output isn't correct
16 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 Correct 2 ms 208 KB Output is correct
6 Correct 4 ms 336 KB Output is correct
7 Correct 3 ms 336 KB Output is correct
8 Correct 4 ms 336 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 6 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 7 ms 256 KB Output is correct
13 Correct 5 ms 336 KB Output is correct
14 Correct 3 ms 336 KB Output is correct
15 Incorrect 7 ms 336 KB Output isn't correct
16 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 0 ms 208 KB Output is correct
5 Correct 123 ms 41232 KB Output is correct
6 Correct 163 ms 51120 KB Output is correct
7 Correct 66 ms 26336 KB Output is correct
8 Correct 158 ms 51076 KB Output is correct
9 Correct 21 ms 7976 KB Output is correct
10 Correct 159 ms 51180 KB Output is correct
11 Correct 127 ms 52264 KB Output is correct
12 Correct 229 ms 52244 KB Output is correct
13 Correct 207 ms 52260 KB Output is correct
14 Correct 150 ms 51180 KB Output is correct
15 Incorrect 406 ms 51704 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 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 299 ms 23556 KB Output is correct
5 Correct 1050 ms 51104 KB Output is correct
6 Correct 680 ms 8620 KB Output is correct
7 Correct 1006 ms 51144 KB Output is correct
8 Correct 699 ms 17696 KB Output is correct
9 Correct 935 ms 51172 KB Output is correct
10 Correct 915 ms 52244 KB Output is correct
11 Correct 1113 ms 52244 KB Output is correct
12 Correct 1222 ms 52328 KB Output is correct
13 Correct 1141 ms 51216 KB Output is correct
14 Correct 1248 ms 51780 KB Output is correct
15 Correct 1116 ms 52340 KB Output is correct
16 Correct 1156 ms 52240 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 2 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 20 ms 720 KB Output is correct
28 Correct 22 ms 720 KB Output is correct
29 Correct 17 ms 720 KB Output is correct
30 Correct 20 ms 720 KB Output is correct
31 Correct 18 ms 720 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 76 ms 29756 KB Output is correct
34 Correct 135 ms 51184 KB Output is correct
35 Correct 133 ms 52288 KB Output is correct
36 Correct 119 ms 51184 KB Output is correct
37 Correct 151 ms 51760 KB Output is correct
38 Correct 124 ms 52280 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 299 ms 23556 KB Output is correct
5 Correct 1050 ms 51104 KB Output is correct
6 Correct 680 ms 8620 KB Output is correct
7 Correct 1006 ms 51144 KB Output is correct
8 Correct 699 ms 17696 KB Output is correct
9 Correct 935 ms 51172 KB Output is correct
10 Correct 915 ms 52244 KB Output is correct
11 Correct 1113 ms 52244 KB Output is correct
12 Correct 1222 ms 52328 KB Output is correct
13 Correct 1141 ms 51216 KB Output is correct
14 Correct 1248 ms 51780 KB Output is correct
15 Correct 1116 ms 52340 KB Output is correct
16 Correct 1156 ms 52240 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 2 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 20 ms 720 KB Output is correct
28 Correct 22 ms 720 KB Output is correct
29 Correct 17 ms 720 KB Output is correct
30 Correct 20 ms 720 KB Output is correct
31 Correct 18 ms 720 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 76 ms 29756 KB Output is correct
34 Correct 135 ms 51184 KB Output is correct
35 Correct 133 ms 52288 KB Output is correct
36 Correct 119 ms 51184 KB Output is correct
37 Correct 151 ms 51760 KB Output is correct
38 Correct 124 ms 52280 KB Output is correct
39 Correct 0 ms 208 KB Output is correct
40 Correct 0 ms 208 KB Output is correct
41 Correct 0 ms 208 KB Output is correct
42 Correct 259 ms 23444 KB Output is correct
43 Correct 858 ms 51084 KB Output is correct
44 Correct 723 ms 8656 KB Output is correct
45 Correct 1055 ms 51100 KB Output is correct
46 Correct 446 ms 17736 KB Output is correct
47 Correct 1114 ms 51184 KB Output is correct
48 Correct 840 ms 52256 KB Output is correct
49 Correct 1162 ms 52240 KB Output is correct
50 Correct 1492 ms 52228 KB Output is correct
51 Correct 976 ms 51176 KB Output is correct
52 Correct 1244 ms 51760 KB Output is correct
53 Correct 1115 ms 52240 KB Output is correct
54 Correct 1239 ms 52260 KB Output is correct
55 Correct 0 ms 208 KB Output is correct
56 Execution timed out 4011 ms 50888 KB Time limit exceeded
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 0 ms 208 KB Output is correct
3 Correct 170 ms 41840 KB Output is correct
4 Correct 918 ms 52260 KB Output is correct
5 Correct 775 ms 26560 KB Output is correct
6 Correct 810 ms 52264 KB Output is correct
7 Correct 733 ms 36136 KB Output is correct
8 Correct 826 ms 52388 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 Correct 2 ms 208 KB Output is correct
14 Correct 4 ms 336 KB Output is correct
15 Correct 3 ms 336 KB Output is correct
16 Correct 4 ms 336 KB Output is correct
17 Correct 1 ms 208 KB Output is correct
18 Correct 6 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 7 ms 256 KB Output is correct
21 Correct 5 ms 336 KB Output is correct
22 Correct 3 ms 336 KB Output is correct
23 Incorrect 7 ms 336 KB Output isn't correct
24 Halted 0 ms 0 KB -