Submission #983582

#	Time	Username	Problem	Language	Result	Execution time	Memory
983582		Nexus	Rainforest Jumps (APIO21_jumps)	C++17	0 / 100	4083 ms	35416 KiB

jumps

#include <bits/stdc++.h>
#define ll long long

using namespace std;

const ll N=1e6+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(A<=nd && nd<=B)dep=0;
    if(C<=nd && nd<=D)
    {
        if(x==-1)x=dep;
        x=min(x,dep);
        return;
    }
    ++dep;
    for(auto i:v[nd])dfs(i,dep,A,B,C,D);
}

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)
    {
        if(!vis[i])dfs(i,0,A,B,C,D);
    }
    return x;
}

• Subtask 1: 0 / 4
• Subtask 2: 0 / 8
• Subtask 3: 0 / 13
• Subtask 4: 0 / 12
• Subtask 5: 0 / 23
• Subtask 6: 0 / 21
• Subtask 7: 0 / 19