oj.uz

Submission #671775

# Submission time Handle Problem Language Result Execution time Memory
671775 2022-12-13T19:45:51 Z Vahe Rainforest Jumps (APIO21_jumps) C++17
0 / 100
 4000 ms 17708 KB 
#include "jumps.h"
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
using namespace std;
int n;
vector<int> h, pge, nge, dp;
vector<vector<int>> gp;
int a, b, c, d;
 
vector<int> PNG(vector<int> v, bool boo)
{
    if (boo) reverse(v.begin(), v.end());
    vector<int> tmp(v.size());
    stack<int> s;
    s.push(0);
    tmp[0] = -1;
    for (int i = 1; i < v.size(); i++)
    {
        while (!s.empty() && v[s.top()] < v[i]) s.pop();
        tmp[i] = (s.empty() ? -1 : s.top());
        s.push(i);
    }
    if (boo) {
        reverse(tmp.begin(), tmp.end());
        for (int& i : tmp) i = (i == -1 ? -1 : n - 1 - i);
    } 
    return tmp;
}
 
void dfs(int u)
{
    if (u >= c && u <= d) { dp[u] = 0; return; }
    if (dp[u] != 2e9) return;
 
    int x = 2e9, y = 2e9;
    if (!gp[u].empty()   ) dfs(gp[u][0]), x = dp[gp[u][0]];
    if ( gp[u].size() > 1) dfs(gp[u][1]), y = dp[gp[u][1]];
 
    dp[u] = min(int(2e9), min(x, y) + 1);
}
 
void init(int N, vector<int> H)
{
    n = N;
    h = H;
    pge = PNG(H, 0);
    nge = PNG(H, 1);
    gp = vector<vector<int>>(n);
    for (int i = 0; i < n; i++)
    {
        if (pge[i] != -1) gp[i].push_back(pge[i]);
        if (nge[i] != -1) gp[i].push_back(nge[i]);
    }
}
 
int minimum_jumps(int A, int B, int C, int D)
{
    a = A, b = B, c = C, d = D;
    dp = vector<int>(n, 2e9);
    int mn = 2e9;
    for (int i = a; i <= b; i++) dfs(i), mn = min(mn, dp[i]);
    return (mn == 2e9 ? -1 : mn);
}

Compilation message

jumps.cpp: In function 'std::vector<int> PNG(std::vector<int>, bool)':
jumps.cpp:19:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |     for (int i = 1; i < v.size(); i++)
      |                     ~~^~~~~~~~~~

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 4078 ms 17708 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 Correct 1 ms 208 KB Output is correct
6 Correct 6 ms 208 KB Output is correct
7 Correct 3 ms 208 KB Output is correct
8 Correct 6 ms 208 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 7 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 5 ms 208 KB Output is correct
14 Correct 6 ms 208 KB Output is correct
15 Execution timed out 4091 ms 208 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 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 1 ms 208 KB Output is correct
6 Correct 6 ms 208 KB Output is correct
7 Correct 3 ms 208 KB Output is correct
8 Correct 6 ms 208 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 7 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 5 ms 208 KB Output is correct
14 Correct 6 ms 208 KB Output is correct
15 Execution timed out 4091 ms 208 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 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 38 ms 12860 KB Output is correct
6 Execution timed out 4051 ms 15856 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #5
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 Execution timed out 4081 ms 7372 KB Time limit exceeded
5 Halted 0 ms 0 KB -

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 Execution timed out 4081 ms 7372 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 4078 ms 17708 KB Time limit exceeded
4 Halted 0 ms 0 KB -