oj.uz

Submission #980717

# Submission time Handle Problem Language Result Execution time Memory
980717 2024-05-12T10:50:32 Z vjudge1 Rainforest Jumps (APIO21_jumps) C++17
4 / 100
 712 ms 50708 KB 
#include "jumps.h"
#include<bits/stdc++.h>
#define sz size()
#define ll int
using namespace std;
const ll INF = 1e9;
const ll NN = 200200;

ll up[NN][20], dw[NN][20];
int n, ok = 1;
vector<vector<ll>> v;
vector<ll> h;
void init(int N, vector<int> H)
{
    n = N;
    h = H;
    v.resize(n);
    vector<ll> q;
    for(ll i = 0; i < n; ++i)
        up[i][0] = -1,
                   dw[i][0] = -1;
    for(ll i = 0; i < n; ++i)
    {
        ok &= h[i] == i + 1;
        while(q.sz && h[q.back()] < h[i])
            v[q.back()].push_back(i),
            up[q.back()][0] = i,
                              q.pop_back();
        q.push_back(i);
    }
    q.clear();
    for(ll i = n - 1; i >= 0; --i)
    {
        while(q.sz && h[q.back()] < h[i])
            v[q.back()].push_back(i),
            dw[q.back()][0] = i,
                              q.pop_back();
        q.push_back(i);
    }
    for(ll i = 0; i < n; ++i)
        if(dw[i][0] > up[i][0]) swap(up[i][0], dw[i][0]);
    for(ll j = 1; j < 20; ++j)
        for(ll i = 0; i < n; ++i)
        {
            up[i][j] = up[up[i][j - 1]][j - 1];
            dw[i][j] = dw[dw[i][j - 1]][j - 1];
        }
}

int minimum_jumps(int a, int b, int c, int d)
{
    if(ok) return c - b;
    if(a == b && c == d)
    {
        ll ans = 0;
        for(ll j = 19; j >= 0; --j)
        {
            if(up[a][j] < 0) continue;
            if(h[up[a][j]] <= h[d])
                a = up[a][j], ans += (1 << j);
        }
        for(ll j = 19; j >= 0; --j)
        {
            if(dw[a][j] < 0) continue;
            if(h[dw[a][j]] <= h[d])
                a = dw[a][j], ans += (1 << j);
        }
        return a == d ? ans : -1;
    }
    vector<ll> dist(n, INF);
    queue<ll> q;
    for(ll i = a; i <= b; ++i)
    {
        dist[i] = 0;
        q.push(i);
    }
    while(q.sz)
    {
        ll s = q.front();
        q.pop();
        for(ll t : v[s])
        {
            if(dist[t] < INF) continue;
            dist[t] = dist[s] + 1;
            q.push(t);
        }
    }
    ll ans = INF;
    for(ll i = c; i <= d; ++i)
        ans = min(ans, dist[i]);
    return ans < INF ? ans : -1;
}

//signed main()
//{
//    ios_base::sync_with_stdio(0);
//    cin.tie(0), cout.tie(0);
//}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2392 KB Output is correct
3 Correct 129 ms 39004 KB Output is correct
4 Correct 592 ms 46236 KB Output is correct
5 Correct 528 ms 26216 KB Output is correct
6 Correct 655 ms 46128 KB Output is correct
7 Correct 575 ms 35404 KB Output is correct
8 Correct 712 ms 46136 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2392 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2392 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2392 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Runtime error 47 ms 50708 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 2392 KB Output is correct
2 Correct 0 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Runtime error 47 ms 50708 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 1 ms 2392 KB Output is correct
2 Correct 0 ms 2392 KB Output is correct
3 Correct 129 ms 39004 KB Output is correct
4 Correct 592 ms 46236 KB Output is correct
5 Correct 528 ms 26216 KB Output is correct
6 Correct 655 ms 46128 KB Output is correct
7 Correct 575 ms 35404 KB Output is correct
8 Correct 712 ms 46136 KB Output is correct
9 Incorrect 1 ms 2392 KB Output isn't correct
10 Halted 0 ms 0 KB -