oj.uz

Submission #553539

# Submission time Handle Problem Language Result Execution time Memory
553539 2022-04-26T07:58:50 Z Jarif_Rahman Rainforest Jumps (APIO21_jumps) C++17
0 / 100
 4000 ms 4168 KB 
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;

int n;
vector<int> h;
vector<int> jump[2];

void init(int N, vector<int> H){
    n = N, h = H;
    fill(jump, jump+2, vector<int>(n, -1));

    stack<int> st;
    for(int i = n-1; i >= 0; i--){
        while(!st.empty() && h[i] > h[st.top()]){
            jump[0][st.top()] = i;
            st.pop();
        }
        st.push(i);
    }
    while(!st.empty()) st.pop();

    for(int i = 0; i < n; i++){
        while(!st.empty() && h[i] > h[st.top()]){
            jump[1][st.top()] = i;
            st.pop();
        }
        st.push(i);
    }
    while(!st.empty()) st.pop();
}

int minimum_jumps(int A, int B, int C, int D){
    vector<int> dis(n, n+1);
    vector<bool> bl(n, 0);
    queue<int> Q;

    for(int i = A; i <= B; i++){
        dis[i] = 0;
        bl[i] = 1;
        Q.push(i);
    }

    while(!Q.empty()){
        auto nd = Q.front();
        Q.pop();
        if(jump[0][nd] != -1 && !bl[jump[0][nd]]){
            bl[jump[0][nd]];
            dis[jump[0][nd]] = dis[nd]+1;
            Q.push(jump[0][nd]);
        }
    }

    int ans = *min_element(dis.begin()+C, dis.begin()+D+1);

    fill(dis.begin(), dis.end(), n+1);
    fill(bl.begin(), bl.end(), 0);

    for(int i = A; i <= B; i++){
        dis[i] = 0;
        bl[i] = 1;
        Q.push(i);
    }

    while(!Q.empty()){
        auto nd = Q.front();
        Q.pop();
        if(jump[1][nd] != -1 && !bl[jump[1][nd]]){
            bl[jump[1][nd]];
            dis[jump[1][nd]] = dis[nd]+1;
            Q.push(jump[1][nd]);
        }
    }

    ans = min(ans, *min_element(dis.begin()+C, dis.begin()+D+1));

    if(ans > n) ans = -1;
    return ans;
}

Subtask #1
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 Execution timed out 4035 ms 4168 KB Time limit exceeded
4 Halted 0 ms 0 KB -

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 Incorrect 29 ms 4008 KB Output isn't correct
6 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 0 ms 208 KB Output is correct
4 Execution timed out 4040 ms 2328 KB Time limit exceeded
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 0 ms 208 KB Output is correct
4 Execution timed out 4040 ms 2328 KB Time limit exceeded
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 0 ms 208 KB Output is correct
3 Execution timed out 4035 ms 4168 KB Time limit exceeded
4 Halted 0 ms 0 KB -