oj.uz

Submission #563443

# Submission time Handle Problem Language Result Execution time Memory
563443 2022-05-17T08:21:39 Z WKYH Rainforest Jumps (APIO21_jumps) C++14
8 / 100
 4000 ms 164664 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);
    for(int i=0;i<n;i++){
        for(int j=i-1;j>=0;j--){
            if(h[j]>h[i]){
                gph[i].push_back(j);
                break;
            }
        }
        for(int j=i+1;j<n;j++){
            if(h[j]>h[i]){
                gph[i].push_back(j);
                break;
            }
        }
    }
    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});
        vis[i]=true;
    }
    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(!vis[c])q.push({x+1,c});
        }
    }
    rt -1;
}

Subtask #1
0 / 4.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 Execution timed out 4074 ms 9480 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #2
8.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 Correct 2 ms 208 KB Output is correct
6 Correct 3 ms 208 KB Output is correct
7 Correct 2 ms 296 KB Output is correct
8 Correct 3 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 4 ms 208 KB Output is correct
11 Correct 3 ms 208 KB Output is correct
12 Correct 4 ms 208 KB Output is correct
13 Correct 3 ms 208 KB Output is correct
14 Correct 3 ms 208 KB Output is correct
15 Correct 4 ms 208 KB Output is correct
16 Correct 11 ms 336 KB Output is correct
17 Correct 2 ms 208 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 2 ms 208 KB Output is correct
21 Correct 4 ms 208 KB Output is correct
22 Correct 4 ms 208 KB Output is correct
23 Correct 4 ms 208 KB Output is correct
24 Correct 3 ms 208 KB Output is correct
25 Correct 0 ms 208 KB Output is correct
26 Correct 0 ms 208 KB Output is correct
27 Correct 2 ms 208 KB Output is correct
28 Correct 2 ms 208 KB Output is correct
29 Correct 2 ms 208 KB Output is correct
30 Correct 2 ms 208 KB Output is correct
31 Correct 4 ms 208 KB Output is correct
32 Correct 3 ms 208 KB Output is correct
33 Correct 0 ms 208 KB Output is correct
34 Correct 0 ms 208 KB Output is correct
35 Correct 1 ms 208 KB Output is correct
36 Correct 1 ms 208 KB Output is correct
37 Correct 1 ms 208 KB Output is correct
38 Correct 2 ms 208 KB Output is correct
39 Correct 1 ms 208 KB Output is correct

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 Correct 2 ms 208 KB Output is correct
6 Correct 3 ms 208 KB Output is correct
7 Correct 2 ms 296 KB Output is correct
8 Correct 3 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 4 ms 208 KB Output is correct
11 Correct 3 ms 208 KB Output is correct
12 Correct 4 ms 208 KB Output is correct
13 Correct 3 ms 208 KB Output is correct
14 Correct 3 ms 208 KB Output is correct
15 Correct 4 ms 208 KB Output is correct
16 Correct 11 ms 336 KB Output is correct
17 Correct 2 ms 208 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 2 ms 208 KB Output is correct
21 Correct 4 ms 208 KB Output is correct
22 Correct 4 ms 208 KB Output is correct
23 Correct 4 ms 208 KB Output is correct
24 Correct 3 ms 208 KB Output is correct
25 Correct 0 ms 208 KB Output is correct
26 Correct 0 ms 208 KB Output is correct
27 Correct 2 ms 208 KB Output is correct
28 Correct 2 ms 208 KB Output is correct
29 Correct 2 ms 208 KB Output is correct
30 Correct 2 ms 208 KB Output is correct
31 Correct 4 ms 208 KB Output is correct
32 Correct 3 ms 208 KB Output is correct
33 Correct 0 ms 208 KB Output is correct
34 Correct 0 ms 208 KB Output is correct
35 Correct 1 ms 208 KB Output is correct
36 Correct 1 ms 208 KB Output is correct
37 Correct 1 ms 208 KB Output is correct
38 Correct 2 ms 208 KB Output is correct
39 Correct 1 ms 208 KB Output is correct
40 Correct 0 ms 292 KB Output is correct
41 Correct 0 ms 208 KB Output is correct
42 Correct 0 ms 208 KB Output is correct
43 Correct 0 ms 208 KB Output is correct
44 Correct 2 ms 208 KB Output is correct
45 Correct 3 ms 208 KB Output is correct
46 Correct 1 ms 208 KB Output is correct
47 Correct 2 ms 312 KB Output is correct
48 Correct 1 ms 208 KB Output is correct
49 Correct 2 ms 208 KB Output is correct
50 Correct 4 ms 208 KB Output is correct
51 Correct 3 ms 208 KB Output is correct
52 Correct 3 ms 208 KB Output is correct
53 Correct 3 ms 208 KB Output is correct
54 Correct 3 ms 208 KB Output is correct
55 Correct 9 ms 388 KB Output is correct
56 Correct 3 ms 208 KB Output is correct
57 Correct 0 ms 208 KB Output is correct
58 Correct 27 ms 336 KB Output is correct
59 Correct 37 ms 336 KB Output is correct
60 Correct 10 ms 336 KB Output is correct
61 Correct 36 ms 420 KB Output is correct
62 Correct 16 ms 208 KB Output is correct
63 Correct 34 ms 336 KB Output is correct
64 Correct 56 ms 420 KB Output is correct
65 Correct 52 ms 336 KB Output is correct
66 Correct 703 ms 336 KB Output is correct
67 Correct 39 ms 440 KB Output is correct
68 Correct 715 ms 336 KB Output is correct
69 Execution timed out 4090 ms 164664 KB Time limit exceeded
70 Halted 0 ms 0 KB -

Subtask #4
0 / 12.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 1 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 38 ms 10384 KB Output is correct
6 Correct 50 ms 12704 KB Output is correct
7 Correct 22 ms 6580 KB Output is correct
8 Correct 51 ms 13584 KB Output is correct
9 Correct 7 ms 2128 KB Output is correct
10 Correct 47 ms 12688 KB Output is correct
11 Execution timed out 4054 ms 10836 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 Correct 252 ms 5916 KB Output is correct
5 Correct 999 ms 12696 KB Output is correct
6 Correct 678 ms 2256 KB Output is correct
7 Correct 1225 ms 12700 KB Output is correct
8 Correct 598 ms 4532 KB Output is correct
9 Correct 1181 ms 12852 KB Output is correct
10 Execution timed out 4037 ms 10920 KB Time limit exceeded
11 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 Correct 252 ms 5916 KB Output is correct
5 Correct 999 ms 12696 KB Output is correct
6 Correct 678 ms 2256 KB Output is correct
7 Correct 1225 ms 12700 KB Output is correct
8 Correct 598 ms 4532 KB Output is correct
9 Correct 1181 ms 12852 KB Output is correct
10 Execution timed out 4037 ms 10920 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #7
0 / 19.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 Execution timed out 4074 ms 9480 KB Time limit exceeded
4 Halted 0 ms 0 KB -