oj.uz

Submission #561279

# Submission time Handle Problem Language Result Execution time Memory
561279 2022-05-12T14:59:40 Z InternetPerson10 Rainforest Jumps (APIO21_jumps) C++17
4 / 100
 868 ms 52288 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 reachable(int x, int C, int D) {
    if(C <= x && x <= D) return 0;
    int ans = 1;
    for(int i = 19; i >= 0; i--) {
        if(liftRight[x][i] == -1) continue;
        if(liftRight[x][i] > D) continue;
        if(liftRight[x][i] >= C) return ans;
        x = liftRight[x][i];
        ans++;
    }
    return -1;
}

int BIG = 1e9 + 7;

int single_min_jumps(int x, int C, int D) {
    int ans = BIG;
    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;
        tot += (1 << i);
        ans = min(ans, tot + r);
    }
    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 1 ms 208 KB Output is correct
3 Correct 176 ms 41876 KB Output is correct
4 Correct 772 ms 52264 KB Output is correct
5 Correct 788 ms 26520 KB Output is correct
6 Correct 794 ms 52288 KB Output is correct
7 Correct 663 ms 36152 KB Output is correct
8 Correct 868 ms 52288 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 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 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 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 118 ms 41288 KB Output is correct
6 Correct 153 ms 51096 KB Output is correct
7 Correct 62 ms 26312 KB Output is correct
8 Correct 157 ms 51120 KB Output is correct
9 Correct 20 ms 7956 KB Output is correct
10 Incorrect 132 ms 51100 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #5
0 / 23.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 1 ms 208 KB Output is correct
4 Incorrect 265 ms 23504 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0 / 21.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 1 ms 208 KB Output is correct
4 Incorrect 265 ms 23504 KB Output isn't correct
5 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 176 ms 41876 KB Output is correct
4 Correct 772 ms 52264 KB Output is correct
5 Correct 788 ms 26520 KB Output is correct
6 Correct 794 ms 52288 KB Output is correct
7 Correct 663 ms 36152 KB Output is correct
8 Correct 868 ms 52288 KB Output is correct
9 Correct 1 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 -