oj.uz

Submission #563568

# Submission time Handle Problem Language Result Execution time Memory
563568 2022-05-17T14:22:06 Z WKYH Rainforest Jumps (APIO21_jumps) C++14
21 / 100
 4000 ms 13600 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();
        if(y>=c&&y<=d)rt x;
        for(auto c:gph[y]){
            if(!vis[c]){
                q.push({x+1,c});
                vis[c]=1;
            }
        }
    }
    rt -1;
}

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

Subtask #2
8.0 / 8.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 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 208 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 1 ms 248 KB Output is correct
10 Correct 3 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 2 ms 208 KB Output is correct
14 Correct 3 ms 208 KB Output is correct
15 Correct 3 ms 208 KB Output is correct
16 Correct 3 ms 208 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 3 ms 208 KB Output is correct
21 Correct 3 ms 208 KB Output is correct
22 Correct 2 ms 208 KB Output is correct
23 Correct 3 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 1 ms 208 KB Output is correct
28 Correct 2 ms 208 KB Output is correct
29 Correct 3 ms 208 KB Output is correct
30 Correct 2 ms 208 KB Output is correct
31 Correct 3 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 252 KB Output is correct
35 Correct 0 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 1 ms 208 KB Output is correct
39 Correct 1 ms 208 KB Output is correct

Subtask #3
13.0 / 13.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 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 208 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 1 ms 248 KB Output is correct
10 Correct 3 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 2 ms 208 KB Output is correct
14 Correct 3 ms 208 KB Output is correct
15 Correct 3 ms 208 KB Output is correct
16 Correct 3 ms 208 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 3 ms 208 KB Output is correct
21 Correct 3 ms 208 KB Output is correct
22 Correct 2 ms 208 KB Output is correct
23 Correct 3 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 1 ms 208 KB Output is correct
28 Correct 2 ms 208 KB Output is correct
29 Correct 3 ms 208 KB Output is correct
30 Correct 2 ms 208 KB Output is correct
31 Correct 3 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 252 KB Output is correct
35 Correct 0 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 1 ms 208 KB Output is correct
39 Correct 1 ms 208 KB Output is correct
40 Correct 0 ms 208 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 3 ms 208 KB Output is correct
45 Correct 2 ms 208 KB Output is correct
46 Correct 1 ms 208 KB Output is correct
47 Correct 2 ms 208 KB Output is correct
48 Correct 1 ms 208 KB Output is correct
49 Correct 2 ms 208 KB Output is correct
50 Correct 3 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 2 ms 208 KB Output is correct
54 Correct 3 ms 208 KB Output is correct
55 Correct 2 ms 208 KB Output is correct
56 Correct 2 ms 208 KB Output is correct
57 Correct 0 ms 208 KB Output is correct
58 Correct 24 ms 336 KB Output is correct
59 Correct 35 ms 336 KB Output is correct
60 Correct 6 ms 336 KB Output is correct
61 Correct 39 ms 424 KB Output is correct
62 Correct 16 ms 208 KB Output is correct
63 Correct 28 ms 336 KB Output is correct
64 Correct 53 ms 336 KB Output is correct
65 Correct 51 ms 336 KB Output is correct
66 Correct 45 ms 428 KB Output is correct
67 Correct 33 ms 428 KB Output is correct
68 Correct 38 ms 336 KB Output is correct
69 Correct 39 ms 424 KB Output is correct
70 Correct 30 ms 336 KB Output is correct
71 Correct 0 ms 208 KB Output is correct
72 Correct 1 ms 208 KB Output is correct
73 Correct 3 ms 208 KB Output is correct
74 Correct 2 ms 208 KB Output is correct
75 Correct 2 ms 208 KB Output is correct
76 Correct 2 ms 208 KB Output is correct
77 Correct 3 ms 208 KB Output is correct
78 Correct 1 ms 208 KB Output is correct
79 Correct 0 ms 208 KB Output is correct
80 Correct 2 ms 208 KB Output is correct
81 Correct 3 ms 208 KB Output is correct
82 Correct 3 ms 208 KB Output is correct
83 Correct 2 ms 208 KB Output is correct
84 Correct 2 ms 208 KB Output is correct
85 Correct 2 ms 208 KB Output is correct
86 Correct 0 ms 208 KB Output is correct
87 Correct 0 ms 208 KB Output is correct
88 Correct 1 ms 208 KB Output is correct
89 Correct 1 ms 208 KB Output is correct
90 Correct 1 ms 208 KB Output is correct
91 Correct 1 ms 208 KB Output is correct
92 Correct 1 ms 208 KB Output is correct
93 Correct 0 ms 208 KB Output is correct
94 Correct 5 ms 208 KB Output is correct
95 Correct 36 ms 336 KB Output is correct
96 Correct 38 ms 552 KB Output is correct
97 Correct 36 ms 336 KB Output is correct
98 Correct 47 ms 336 KB Output is correct
99 Correct 41 ms 336 KB Output is correct
100 Correct 0 ms 208 KB Output is correct
101 Correct 1 ms 336 KB Output is correct
102 Correct 19 ms 336 KB Output is correct
103 Correct 40 ms 336 KB Output is correct
104 Correct 19 ms 336 KB Output is correct
105 Correct 31 ms 336 KB Output is correct
106 Correct 34 ms 336 KB Output is correct
107 Correct 0 ms 208 KB Output is correct
108 Correct 1 ms 336 KB Output is correct
109 Correct 1 ms 336 KB Output is correct
110 Correct 2 ms 336 KB Output is correct
111 Correct 1 ms 336 KB Output is correct
112 Correct 2 ms 336 KB Output is correct
113 Correct 2 ms 336 KB Output is correct

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 46 ms 10364 KB Output is correct
6 Correct 50 ms 12800 KB Output is correct
7 Correct 30 ms 6672 KB Output is correct
8 Correct 52 ms 13600 KB Output is correct
9 Correct 8 ms 2128 KB Output is correct
10 Correct 48 ms 12724 KB Output is correct
11 Execution timed out 4053 ms 11012 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 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 262 ms 5920 KB Output is correct
5 Correct 1041 ms 12776 KB Output is correct
6 Correct 600 ms 2256 KB Output is correct
7 Correct 1040 ms 12700 KB Output is correct
8 Correct 520 ms 4516 KB Output is correct
9 Correct 1056 ms 12712 KB Output is correct
10 Execution timed out 4014 ms 10972 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 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 262 ms 5920 KB Output is correct
5 Correct 1041 ms 12776 KB Output is correct
6 Correct 600 ms 2256 KB Output is correct
7 Correct 1040 ms 12700 KB Output is correct
8 Correct 520 ms 4516 KB Output is correct
9 Correct 1056 ms 12712 KB Output is correct
10 Execution timed out 4014 ms 10972 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 0 ms 208 KB Output is correct
3 Execution timed out 4070 ms 9716 KB Time limit exceeded
4 Halted 0 ms 0 KB -