oj.uz

Submission #563202

# Submission time Handle Problem Language Result Execution time Memory
563202 2022-05-16T13:39:36 Z WKYH Rainforest Jumps (APIO21_jumps) C++14
0 / 100
 4000 ms 13736 KB 
#include<bits/stdc++.h>
#define qc ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define rt return
#define fi first
#define se second
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
typedef long long int ll;
typedef long double ld;
const long long mod=1e9+7;
const long long inf=INT_MAX;
using namespace std;
ll gcd(ll a,ll b){if(b==0)rt a;rt gcd(b,a%b);}

int n;
vector<vector<int>>gph;
void init(int N,vector<int>h)
{
    n=N;
    gph.resize(n,vector<int>(2,-1));
    for(int i=0;i<n;i++){
        if(gph[i][0]==-1){
            bool tkn=0;
            for(int j=i-1;j>=0;j--){
                if(h[j]>h[i]){
                    gph[i][0]=j;
                    break;
                }
                else{
                    if(tkn)continue;
                    gph[j][1]=i;
                    tkn=1;
                }
            }
        }
        if(gph[i][1]==-1){
            bool tkn=0;
            for(int j=i+1;j<n;j++){
                if(h[j]>h[i]){
                    gph[i][0]=j;
                    break;
                }
                else{
                    if(tkn)continue;
                    gph[j][1]=i;
                    tkn=1;
                }
            }
        }
    }
    rt;
}
int minimum_jumps(int a,int b,int c,int d)
{
    queue<pair<int,int>>q; // num,ind
    vector<bool>vis(n,false);
    for(int i=a;i<=b;i++)q.push({0,i});
    while(!q.empty()){
        int x=q.front().first, y=q.front().second;
        q.pop();
        vis[y]=true;
        if(y>=c&&y<=d)rt x;
        for(auto c:gph[y]){
            if(c==-1)continue;
            if(!vis[c])q.push({x+1,c});
        }
    }
    rt -1;
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Execution timed out 4062 ms 10140 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Incorrect 2 ms 208 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Incorrect 2 ms 208 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 46 ms 10504 KB Output is correct
6 Correct 50 ms 12684 KB Output is correct
7 Correct 26 ms 6600 KB Output is correct
8 Correct 52 ms 13736 KB Output is correct
9 Correct 7 ms 2256 KB Output is correct
10 Correct 48 ms 12832 KB Output is correct
11 Execution timed out 4019 ms 12724 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Incorrect 248 ms 5928 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Incorrect 248 ms 5928 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 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Execution timed out 4062 ms 10140 KB Time limit exceeded
4 Halted 0 ms 0 KB -