oj.uz

Submission #565550

# Submission time Handle Problem Language Result Execution time Memory
565550 2022-05-21T05:53:00 Z MurotY Rainforest Jumps (APIO21_jumps) C++14
0 / 100
 4000 ms 4308 KB 
#include "jumps.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N=2*1e3+7;
vector <int> a;
vector <int> g[N];
bool u[N], u1[N];
int dp[N][N];

void dfs(int i, int v, int res=0){
    u[v]=u1[v]=1;
    dp[i][v]=min(dp[i][v], res);
    for (auto l:g[v]){
        if (!u[l]) dfs(i, l, res+1);
    }
    u[v]=0;
}
void init(int N, std::vector<int> H) {
    int n=N;
    a=H;
    vector <int> v;
    for (int i=n-1;i>=0;i--){
        while (!v.empty() && a[i] > a[v.back()]) v.pop_back();
        if (!v.empty()) g[i].push_back(v.back());
        v.push_back(i);
    }
    v.clear();
    for (int i=0;i<n;i++){
        while (!v.empty() && a[i] > a[v.back()]) v.pop_back();
        if (!v.empty()) g[i].push_back(v.back());
        v.push_back(i);
    }
    for (int i=0;i<n;i++){
        for (int j=0;j<n;j++) dp[i][j]=1e9;
        fill(u1, u1+n+10, 0);
        for (int j=0;j<n;j++){
            if (!u1[i]){
                dfs(i, i, 0);
            }
        }

    }
/*    for (int i=0;i<n;i++){
        for (int j=0;j<n;j++) cout << dp[i][j] <<" ";
        cout <<"\n";
    }*/

}

int minimum_jumps(int A, int B, int C, int D) {
    int ans=1e9;
    for (int i=A;i<=B;i++){
        for (int j=C;j<=D;j++){
            ans=min(ans, dp[i][j]);
        }
    }
    if (ans == 1e9) ans=-1;
    return ans;
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Runtime error 16 ms 4296 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 2 ms 420 KB Output is correct
6 Correct 3 ms 1232 KB Output is correct
7 Correct 3 ms 1104 KB Output is correct
8 Correct 3 ms 1232 KB Output is correct
9 Correct 2 ms 976 KB Output is correct
10 Correct 4 ms 1232 KB Output is correct
11 Correct 3 ms 1232 KB Output is correct
12 Correct 3 ms 1232 KB Output is correct
13 Correct 4 ms 1232 KB Output is correct
14 Correct 3 ms 1232 KB Output is correct
15 Execution timed out 4067 ms 556 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 2 ms 420 KB Output is correct
6 Correct 3 ms 1232 KB Output is correct
7 Correct 3 ms 1104 KB Output is correct
8 Correct 3 ms 1232 KB Output is correct
9 Correct 2 ms 976 KB Output is correct
10 Correct 4 ms 1232 KB Output is correct
11 Correct 3 ms 1232 KB Output is correct
12 Correct 3 ms 1232 KB Output is correct
13 Correct 4 ms 1232 KB Output is correct
14 Correct 3 ms 1232 KB Output is correct
15 Execution timed out 4067 ms 556 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Runtime error 19 ms 4308 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 260 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Runtime error 17 ms 2640 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 260 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Runtime error 17 ms 2640 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Runtime error 16 ms 4296 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -