oj.uz

Submission #501387

# Submission time Handle Problem Language Result Execution time Memory
501387 2022-01-03T03:07:56 Z irmuun Rainforest Jumps (APIO21_jumps) C++17
0 / 100
 4000 ms 3480 KB 
//#include "jumps.h"
#include<bits/stdc++.h>
using namespace std;
vector<int>v,h;
int n,k;
void init(int N, vector<int> H) {
    for(int i=0;i<N;i++){
        k=0;
        for(int j=i+1;j<N;j++){
            if(H[i]<H[j]){
                v.push_back(j);
                k=1;
                break;
            }
        }
        if(k==0){
            v.push_back(N+1);
        }
    }
    n=N;
    h=H;
}
int minimum_jumps(int A, int B, int C, int D) {
    int cur=B;
    int ans=0;
    while(cur<n){
        if(C<=cur&&cur<=D){
            return ans;
        }
        cur=v[cur];
        ans++;
    }
    return -1;
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 972 ms 2828 KB Output is correct
4 Execution timed out 4030 ms 3480 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 0 ms 200 KB Output is correct
5 Incorrect 2 ms 200 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 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 0 ms 200 KB Output is correct
5 Incorrect 2 ms 200 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 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 1 ms 272 KB Output is correct
4 Correct 0 ms 200 KB Output is correct
5 Incorrect 18 ms 2868 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

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

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 0 ms 200 KB Output is correct
4 Incorrect 232 ms 1820 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 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 972 ms 2828 KB Output is correct
4 Execution timed out 4030 ms 3480 KB Time limit exceeded
5 Halted 0 ms 0 KB -