Submission #983613

# Submission time Handle Problem Language Result Execution time Memory
983613 2024-05-15T19:03:49 Z Nexus Rainforest Jumps (APIO21_jumps) C++17
0 / 100
4000 ms 27260 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 dfs(ll nd,ll dep,ll A,ll B,ll C,ll D)
{
    if(vis[nd])return;
    vis[nd]=1;
    if(A<=nd && nd<=B)dep=0;
    if(C<=nd && nd<=D)
    {
        if(x==-1)x=dep;
        x=min(x,dep);
        vis[nd]=0;
        return;
    }
    ++dep;
    for(auto i:v[nd])
    {
        //cout<<nd<<' '<<i<<'\n';
        dfs(i,dep,A,B,C,D);
    }
    vis[nd]=0;
}

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;
    for(ll i=A;i<=B;++i)
    {
        dfs(i,0,A,B,C,D);
    }
    return x;
}
# Verdict Execution time Memory Grader output
1 Correct 2 ms 6488 KB Output is correct
2 Correct 2 ms 6488 KB Output is correct
3 Execution timed out 4067 ms 27260 KB Time limit exceeded
4 Halted 0 ms 0 KB -
# 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 2 ms 6488 KB Output is correct
4 Correct 2 ms 6488 KB Output is correct
5 Correct 3 ms 6488 KB Output is correct
6 Correct 5 ms 6488 KB Output is correct
7 Correct 3 ms 6580 KB Output is correct
8 Correct 5 ms 6488 KB Output is correct
9 Correct 2 ms 6488 KB Output is correct
10 Correct 7 ms 6488 KB Output is correct
11 Correct 6 ms 6488 KB Output is correct
12 Correct 8 ms 6488 KB Output is correct
13 Correct 23 ms 6488 KB Output is correct
14 Correct 5 ms 6484 KB Output is correct
15 Execution timed out 4054 ms 6744 KB Time limit exceeded
16 Halted 0 ms 0 KB -
# 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 2 ms 6488 KB Output is correct
4 Correct 2 ms 6488 KB Output is correct
5 Correct 3 ms 6488 KB Output is correct
6 Correct 5 ms 6488 KB Output is correct
7 Correct 3 ms 6580 KB Output is correct
8 Correct 5 ms 6488 KB Output is correct
9 Correct 2 ms 6488 KB Output is correct
10 Correct 7 ms 6488 KB Output is correct
11 Correct 6 ms 6488 KB Output is correct
12 Correct 8 ms 6488 KB Output is correct
13 Correct 23 ms 6488 KB Output is correct
14 Correct 5 ms 6484 KB Output is correct
15 Execution timed out 4054 ms 6744 KB Time limit exceeded
16 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 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 Execution timed out 4062 ms 12852 KB Time limit exceeded
6 Halted 0 ms 0 KB -
# 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 3605 ms 10296 KB Output is correct
5 Execution timed out 4073 ms 14560 KB Time limit exceeded
6 Halted 0 ms 0 KB -
# 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 3605 ms 10296 KB Output is correct
5 Execution timed out 4073 ms 14560 KB Time limit exceeded
6 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 6488 KB Output is correct
2 Correct 2 ms 6488 KB Output is correct
3 Execution timed out 4067 ms 27260 KB Time limit exceeded
4 Halted 0 ms 0 KB -