Submission #983655

#	Time	Username	Problem	Language	Result	Execution time	Memory
983655		Nexus	Rainforest Jumps (APIO21_jumps)	C++17	8 / 100	4091 ms	14556 KiB

jumps

#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;
    for(ll i=A;i<=B;++i)
    {
        q.push({i,0});
    memset(vis,false,sizeof vis);
        while(q.size())
        {
            p=q.front();
          q.pop();
          if(vis[p.first])continue;
          vis[p.first]=1;
            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
• Subtask 2: 8 / 8
• Subtask 3: 0 / 13
• Subtask 4: 0 / 12
• Subtask 5: 0 / 23
• Subtask 6: 0 / 21
• Subtask 7: 0 / 19