oj.uz

Submission #983463

# Submission time Handle Problem Language Result Execution time Memory
983463 2024-05-15T13:21:54 Z Nexus Rainforest Jumps (APIO21_jumps) C++17
0 / 100
 4000 ms 1048576 KB 
#include <bits/stdc++.h>
#define ll long long

using namespace std;

const ll N=2e5+9,M=2e18+9,mod=1e9+7;

bool vis[N];
pair<ll,ll>p;
vector<ll>v[N];
ll a[N],n,x,y,z;
queue<pair<ll,ll>>q;

void init(int m,vector<int>h)
{
    n=m;
    for(ll i=0;i<n;++i)a[i]=h[i];
    for(ll i=0;i<n;++i)
    {
        for(ll j=i-1;j>=0;--j)
        {
            if(a[j]>a[i])
            {
                v[i].push_back(j);
                break;
            }
        }
        for(ll j=i+1;j<n;++j)
        {
            if(a[j]>a[i])
            {
                v[i].push_back(j);
                break;
            }
        }

    }
}

int minimum_jumps(int A, int B, int C, int D)
{
    x=-1;
    memset(vis,false,sizeof vis);
    for(ll i=A;i<=B;++i)
    {
        if(!vis[i])
        {
            q.push({i,0});
            while(q.size())
            {
                p=q.front();
                q.pop();
                if(C<=p.first && p.first<=D)
                x=(x==-1?p.second:min(x,p.second));
                ++p.second;
                for(auto j:v[p.first])q.push({j,p.second});
            }
        }
    }
    return x;
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6488 KB Output is correct
3 Execution timed out 4027 ms 11548 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 6488 KB Output is correct
2 Correct 1 ms 6488 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 6488 KB Output is correct
5 Correct 3 ms 6488 KB Output is correct
6 Correct 10 ms 6488 KB Output is correct
7 Correct 5 ms 6488 KB Output is correct
8 Correct 9 ms 6488 KB Output is correct
9 Correct 4 ms 6488 KB Output is correct
10 Correct 14 ms 6488 KB Output is correct
11 Correct 16 ms 6488 KB Output is correct
12 Correct 19 ms 6488 KB Output is correct
13 Correct 71 ms 6692 KB Output is correct
14 Correct 10 ms 6488 KB Output is correct
15 Runtime error 1647 ms 1048576 KB Execution killed with signal 9
16 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6488 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 6488 KB Output is correct
5 Correct 3 ms 6488 KB Output is correct
6 Correct 10 ms 6488 KB Output is correct
7 Correct 5 ms 6488 KB Output is correct
8 Correct 9 ms 6488 KB Output is correct
9 Correct 4 ms 6488 KB Output is correct
10 Correct 14 ms 6488 KB Output is correct
11 Correct 16 ms 6488 KB Output is correct
12 Correct 19 ms 6488 KB Output is correct
13 Correct 71 ms 6692 KB Output is correct
14 Correct 10 ms 6488 KB Output is correct
15 Runtime error 1647 ms 1048576 KB Execution killed with signal 9
16 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 2 ms 6488 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 6488 KB Output is correct
5 Execution timed out 4070 ms 52076 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 2 ms 6488 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Execution timed out 4065 ms 44840 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 6488 KB Output is correct
2 Correct 2 ms 6488 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Execution timed out 4065 ms 44840 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6488 KB Output is correct
3 Execution timed out 4027 ms 11548 KB Time limit exceeded
4 Halted 0 ms 0 KB -