oj.uz

Submission #983465

# Submission time Handle Problem Language Result Execution time Memory
983465 2024-05-15T13:24:05 Z Nexus Rainforest Jumps (APIO21_jumps) C++17
0 / 100
 4000 ms 14552 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(vis[p.first])continue;
                vis[p.first]=true;
                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 2 ms 6488 KB Output is correct
2 Correct 1 ms 6488 KB Output is correct
3 Execution timed out 4064 ms 11364 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 6488 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 6488 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 6488 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 6488 KB Output is correct
2 Correct 1 ms 6488 KB Output is correct
3 Correct 1 ms 6740 KB Output is correct
4 Correct 233 ms 10320 KB Output is correct
5 Correct 976 ms 14440 KB Output is correct
6 Correct 618 ms 8024 KB Output is correct
7 Correct 998 ms 14552 KB Output is correct
8 Correct 555 ms 9296 KB Output is correct
9 Correct 1029 ms 14516 KB Output is correct
10 Execution timed out 4010 ms 12224 KB Time limit exceeded
11 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 1 ms 6488 KB Output is correct
3 Correct 1 ms 6740 KB Output is correct
4 Correct 233 ms 10320 KB Output is correct
5 Correct 976 ms 14440 KB Output is correct
6 Correct 618 ms 8024 KB Output is correct
7 Correct 998 ms 14552 KB Output is correct
8 Correct 555 ms 9296 KB Output is correct
9 Correct 1029 ms 14516 KB Output is correct
10 Execution timed out 4010 ms 12224 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# 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 Execution timed out 4064 ms 11364 KB Time limit exceeded
4 Halted 0 ms 0 KB -