oj.uz

Submission #561841

# Submission time Handle Problem Language Result Execution time Memory
561841 2022-05-13T16:04:44 Z WKYH Rainforest Jumps (APIO21_jumps) C++14
8 / 100
 4000 ms 33604 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++){   // O(n^2)
        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)  //O(nlogn)
{
    priority_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.top().first,y=q.top().second;
        q.pop();
        vis[y]=true;
        if(y>=c&&y<=d)rt abs(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 4053 ms 9376 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 3 ms 208 KB Output is correct
6 Correct 5 ms 312 KB Output is correct
7 Correct 4 ms 208 KB Output is correct
8 Correct 4 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 3 ms 208 KB Output is correct
11 Correct 3 ms 208 KB Output is correct
12 Correct 3 ms 208 KB Output is correct
13 Correct 4 ms 208 KB Output is correct
14 Correct 4 ms 208 KB Output is correct
15 Correct 4 ms 208 KB Output is correct
16 Correct 34 ms 496 KB Output is correct
17 Correct 5 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 5 ms 312 KB Output is correct
21 Correct 4 ms 208 KB Output is correct
22 Correct 4 ms 208 KB Output is correct
23 Correct 9 ms 208 KB Output is correct
24 Correct 4 ms 284 KB Output is correct
25 Correct 0 ms 208 KB Output is correct
26 Correct 1 ms 208 KB Output is correct
27 Correct 1 ms 208 KB Output is correct
28 Correct 3 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 2 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 1 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 3 ms 208 KB Output is correct
6 Correct 5 ms 312 KB Output is correct
7 Correct 4 ms 208 KB Output is correct
8 Correct 4 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 3 ms 208 KB Output is correct
11 Correct 3 ms 208 KB Output is correct
12 Correct 3 ms 208 KB Output is correct
13 Correct 4 ms 208 KB Output is correct
14 Correct 4 ms 208 KB Output is correct
15 Correct 4 ms 208 KB Output is correct
16 Correct 34 ms 496 KB Output is correct
17 Correct 5 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 5 ms 312 KB Output is correct
21 Correct 4 ms 208 KB Output is correct
22 Correct 4 ms 208 KB Output is correct
23 Correct 9 ms 208 KB Output is correct
24 Correct 4 ms 284 KB Output is correct
25 Correct 0 ms 208 KB Output is correct
26 Correct 1 ms 208 KB Output is correct
27 Correct 1 ms 208 KB Output is correct
28 Correct 3 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 2 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 1 ms 208 KB Output is correct
39 Correct 1 ms 208 KB Output is correct
40 Correct 1 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 2 ms 208 KB Output is correct
45 Correct 4 ms 208 KB Output is correct
46 Correct 2 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 4 ms 312 KB Output is correct
50 Correct 3 ms 208 KB Output is correct
51 Correct 2 ms 304 KB Output is correct
52 Correct 5 ms 208 KB Output is correct
53 Correct 4 ms 208 KB Output is correct
54 Correct 7 ms 208 KB Output is correct
55 Correct 33 ms 464 KB Output is correct
56 Correct 4 ms 208 KB Output is correct
57 Correct 0 ms 208 KB Output is correct
58 Correct 94 ms 336 KB Output is correct
59 Correct 167 ms 336 KB Output is correct
60 Correct 21 ms 336 KB Output is correct
61 Correct 165 ms 336 KB Output is correct
62 Correct 21 ms 208 KB Output is correct
63 Correct 166 ms 336 KB Output is correct
64 Correct 114 ms 336 KB Output is correct
65 Correct 116 ms 336 KB Output is correct
66 Correct 2604 ms 336 KB Output is correct
67 Correct 161 ms 336 KB Output is correct
68 Correct 266 ms 336 KB Output is correct
69 Execution timed out 4048 ms 33604 KB Time limit exceeded
70 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 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 54 ms 11292 KB Output is correct
6 Correct 80 ms 13576 KB Output is correct
7 Correct 22 ms 6692 KB Output is correct
8 Correct 75 ms 15076 KB Output is correct
9 Correct 14 ms 2408 KB Output is correct
10 Correct 66 ms 12944 KB Output is correct
11 Execution timed out 4051 ms 10776 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 5960 KB Output is correct
5 Correct 1677 ms 12744 KB Output is correct
6 Correct 902 ms 2292 KB Output is correct
7 Correct 1635 ms 12720 KB Output is correct
8 Correct 827 ms 4552 KB Output is correct
9 Correct 1401 ms 12744 KB Output is correct
10 Execution timed out 4045 ms 10896 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 5960 KB Output is correct
5 Correct 1677 ms 12744 KB Output is correct
6 Correct 902 ms 2292 KB Output is correct
7 Correct 1635 ms 12720 KB Output is correct
8 Correct 827 ms 4552 KB Output is correct
9 Correct 1401 ms 12744 KB Output is correct
10 Execution timed out 4045 ms 10896 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 4053 ms 9376 KB Time limit exceeded
4 Halted 0 ms 0 KB -