oj.uz

Submission #983631

# Submission time Handle Problem Language Result Execution time Memory
983631 2024-05-15T19:35:12 Z hocln Rainforest Jumps (APIO21_jumps) C++17
0 / 100
 4000 ms 13464 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;
priority_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)
    {
        if(!vis[i])
        {
            q.push({0,i});
			vector<ll>d(n,(int)2e9);
			d[i] = 0;
            while(q.size())
            {
                p=q.top();
                q.pop();
                if(C<=p.second && p.second<=D)
                {
                  x=(x==-1?d[p.second]:min(x,d[p.second]));
                  continue;
                }
                for(auto j:v[p.first]) if(d[j] > d[p.second] + 1) d[j]=d[p.second] + 1,q.push({-d[j],j});
            }
        }
    }
    return x;
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 2 ms 6484 KB Output is correct
3 Execution timed out 4062 ms 13464 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 1 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 2 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 Incorrect 864 ms 10688 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0 / 21.0

# 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 Correct 1 ms 6488 KB Output is correct
4 Incorrect 864 ms 10688 KB Output isn't correct
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 2 ms 6484 KB Output is correct
3 Execution timed out 4062 ms 13464 KB Time limit exceeded
4 Halted 0 ms 0 KB -