oj.uz

Submission #417414

# Submission time Handle Problem Language Result Execution time Memory
417414 2021-06-03T17:02:53 Z CSQ31 Rainforest Jumps (APIO21_jumps) C++14
60 / 100
 1219 ms 51248 KB 
#include "jumps.h"
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
typedef long long int ll;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
const int MAXN = 2e5+5;
int l[20][MAXN],r[20][MAXN],high[20][MAXN];
vector<int>H;
void init(int n, vector<int>h){
	H = h;
	H.insert(H.begin(),1e9);
	H.pb(1e9);
	stack<pii>stk;
	for(int i=0;i<=n+1;i++){
		while(!stk.empty() && stk.top().fi < H[i])stk.pop();
		if(!stk.empty())l[0][i] = stk.top().se;
		else l[0][i] = i;
		stk.push({H[i],i});
	}
	while(!stk.empty())stk.pop();
	for(int i=n+1;i>=0;i--){
	    while(!stk.empty() && stk.top().fi < H[i])stk.pop();
		if(!stk.empty())r[0][i] = stk.top().se;
		else r[0][i] = i;
		stk.push({H[i],i});
	}
	for(int i=0;i<=n+1;i++){
		high[0][i] = (H[r[0][i]] > H[l[0][i]])?r[0][i]:l[0][i];
	}
	//cout<<high[0][1]<<'\n';
	for(int j=1;j<20;j++){
		for(int i=0;i<=n+1;i++){
			l[j][i] = l[j-1][l[j-1][i]];
			r[j][i] = r[j-1][r[j-1][i]];
			high[j][i] = high[j-1][high[j-1][i]];
		}
	}
	
}
//
int minimum_jumps(int a,int b,int c,int d){
	a++;
	b++;
	c++;
	d++;
	if(c-1 == b){
		return r[0][b] <=d?1:-1;
	}
	int mid = b+1; //mid just means bigger element in (b,c),cuz we have to cross mid regardless
	for(int i=19;i>=0;i--)if(r[i][mid] < c)mid = r[i][mid];
	if(r[0][mid] > d || r[0][b] > d)return -1;
	int cur = b;
	for(int i=19;i>=0;i--)if(l[i][cur] >= a && H[l[i][cur]] < H[mid])cur = l[i][cur]; //cur is where we should start from
	int ans= 0;
	//if(a == 1)cout<<l[0][cur]<<'\n';
	if(l[0][cur] >= a){
		if(r[0][l[0][cur]] <= d)return 1; //if this case fails it just means we can never ever again go left
	}else{
		for(int i=19;i>=0;i--){
			if(H[high[i][cur]] <= H[mid]){
				cur = high[i][cur];
				ans+=(1<<i);
			}
		}
		//if(a == 1)cout<<cur<<" "<<ans<<'\n';
		if(cur == mid)return r[0][mid] <=d?ans+1:-1;
		else if(high[0][cur] != 0 && r[0][high[0][cur]] <= d)return ans+2; 
	}
	for(int i=19;i>=0;i--){
		if(r[i][cur] < c){
			cur = r[i][cur];
			ans+=(1<<i);
		}
	}
	cur = r[0][cur];
	if(c<=cur && cur<=d)return ans+1;
	else return -1; 
	
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 584 KB Output is correct
2 Correct 1 ms 584 KB Output is correct
3 Correct 154 ms 41040 KB Output is correct
4 Correct 1020 ms 51216 KB Output is correct
5 Correct 1046 ms 26168 KB Output is correct
6 Correct 1097 ms 51168 KB Output is correct
7 Correct 895 ms 35244 KB Output is correct
8 Correct 1219 ms 51224 KB Output is correct

Subtask #2
0 / 8.0

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

Subtask #3
0 / 13.0

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

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 584 KB Output is correct
2 Correct 1 ms 584 KB Output is correct
3 Correct 0 ms 584 KB Output is correct
4 Correct 1 ms 584 KB Output is correct
5 Correct 56 ms 40176 KB Output is correct
6 Correct 62 ms 49556 KB Output is correct
7 Correct 41 ms 25728 KB Output is correct
8 Correct 76 ms 49496 KB Output is correct
9 Correct 10 ms 8044 KB Output is correct
10 Correct 60 ms 49544 KB Output is correct
11 Correct 56 ms 51212 KB Output is correct
12 Correct 55 ms 50704 KB Output is correct
13 Correct 73 ms 50720 KB Output is correct
14 Correct 61 ms 49556 KB Output is correct
15 Correct 57 ms 50312 KB Output is correct
16 Correct 59 ms 51208 KB Output is correct
17 Correct 62 ms 50992 KB Output is correct
18 Correct 1 ms 584 KB Output is correct
19 Correct 1 ms 584 KB Output is correct
20 Correct 1 ms 584 KB Output is correct
21 Correct 1 ms 584 KB Output is correct
22 Correct 1 ms 584 KB Output is correct
23 Correct 1 ms 584 KB Output is correct
24 Correct 1 ms 584 KB Output is correct
25 Correct 1 ms 584 KB Output is correct
26 Correct 1 ms 840 KB Output is correct
27 Correct 1 ms 1096 KB Output is correct
28 Correct 1 ms 1096 KB Output is correct
29 Correct 1 ms 1096 KB Output is correct
30 Correct 1 ms 1096 KB Output is correct
31 Correct 1 ms 1096 KB Output is correct
32 Correct 1 ms 584 KB Output is correct
33 Correct 62 ms 49552 KB Output is correct
34 Correct 76 ms 49584 KB Output is correct
35 Correct 56 ms 50736 KB Output is correct
36 Correct 59 ms 49552 KB Output is correct
37 Correct 58 ms 50420 KB Output is correct
38 Correct 58 ms 51236 KB Output is correct
39 Correct 1 ms 584 KB Output is correct
40 Correct 34 ms 29048 KB Output is correct
41 Correct 60 ms 49588 KB Output is correct
42 Correct 62 ms 50976 KB Output is correct
43 Correct 74 ms 49564 KB Output is correct
44 Correct 56 ms 50352 KB Output is correct
45 Correct 56 ms 51212 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 584 KB Output is correct
2 Correct 1 ms 584 KB Output is correct
3 Correct 1 ms 584 KB Output is correct
4 Correct 259 ms 23000 KB Output is correct
5 Correct 848 ms 49480 KB Output is correct
6 Correct 635 ms 8644 KB Output is correct
7 Correct 892 ms 49584 KB Output is correct
8 Correct 523 ms 17552 KB Output is correct
9 Correct 975 ms 49492 KB Output is correct
10 Correct 1097 ms 51248 KB Output is correct
11 Correct 1181 ms 51100 KB Output is correct
12 Correct 1102 ms 50992 KB Output is correct
13 Correct 880 ms 49584 KB Output is correct
14 Correct 1195 ms 50328 KB Output is correct
15 Correct 938 ms 51120 KB Output is correct
16 Correct 888 ms 51208 KB Output is correct
17 Correct 1 ms 584 KB Output is correct
18 Correct 1 ms 584 KB Output is correct
19 Correct 2 ms 584 KB Output is correct
20 Correct 2 ms 584 KB Output is correct
21 Correct 2 ms 584 KB Output is correct
22 Correct 2 ms 584 KB Output is correct
23 Correct 2 ms 584 KB Output is correct
24 Correct 2 ms 584 KB Output is correct
25 Correct 1 ms 584 KB Output is correct
26 Correct 2 ms 712 KB Output is correct
27 Correct 19 ms 1096 KB Output is correct
28 Correct 19 ms 1096 KB Output is correct
29 Correct 19 ms 1096 KB Output is correct
30 Correct 20 ms 1096 KB Output is correct
31 Correct 20 ms 1096 KB Output is correct
32 Correct 1 ms 584 KB Output is correct
33 Correct 35 ms 29096 KB Output is correct
34 Correct 61 ms 49548 KB Output is correct
35 Correct 69 ms 50908 KB Output is correct
36 Correct 59 ms 49588 KB Output is correct
37 Correct 56 ms 50352 KB Output is correct
38 Correct 56 ms 51248 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 584 KB Output is correct
2 Correct 1 ms 584 KB Output is correct
3 Correct 1 ms 584 KB Output is correct
4 Correct 259 ms 23000 KB Output is correct
5 Correct 848 ms 49480 KB Output is correct
6 Correct 635 ms 8644 KB Output is correct
7 Correct 892 ms 49584 KB Output is correct
8 Correct 523 ms 17552 KB Output is correct
9 Correct 975 ms 49492 KB Output is correct
10 Correct 1097 ms 51248 KB Output is correct
11 Correct 1181 ms 51100 KB Output is correct
12 Correct 1102 ms 50992 KB Output is correct
13 Correct 880 ms 49584 KB Output is correct
14 Correct 1195 ms 50328 KB Output is correct
15 Correct 938 ms 51120 KB Output is correct
16 Correct 888 ms 51208 KB Output is correct
17 Correct 1 ms 584 KB Output is correct
18 Correct 1 ms 584 KB Output is correct
19 Correct 2 ms 584 KB Output is correct
20 Correct 2 ms 584 KB Output is correct
21 Correct 2 ms 584 KB Output is correct
22 Correct 2 ms 584 KB Output is correct
23 Correct 2 ms 584 KB Output is correct
24 Correct 2 ms 584 KB Output is correct
25 Correct 1 ms 584 KB Output is correct
26 Correct 2 ms 712 KB Output is correct
27 Correct 19 ms 1096 KB Output is correct
28 Correct 19 ms 1096 KB Output is correct
29 Correct 19 ms 1096 KB Output is correct
30 Correct 20 ms 1096 KB Output is correct
31 Correct 20 ms 1096 KB Output is correct
32 Correct 1 ms 584 KB Output is correct
33 Correct 35 ms 29096 KB Output is correct
34 Correct 61 ms 49548 KB Output is correct
35 Correct 69 ms 50908 KB Output is correct
36 Correct 59 ms 49588 KB Output is correct
37 Correct 56 ms 50352 KB Output is correct
38 Correct 56 ms 51248 KB Output is correct
39 Correct 1 ms 584 KB Output is correct
40 Correct 1 ms 584 KB Output is correct
41 Correct 1 ms 584 KB Output is correct
42 Correct 229 ms 23080 KB Output is correct
43 Correct 946 ms 49588 KB Output is correct
44 Correct 465 ms 8644 KB Output is correct
45 Correct 825 ms 49548 KB Output is correct
46 Correct 579 ms 17444 KB Output is correct
47 Correct 901 ms 49672 KB Output is correct
48 Correct 1074 ms 51120 KB Output is correct
49 Correct 1084 ms 51092 KB Output is correct
50 Correct 1032 ms 50992 KB Output is correct
51 Correct 764 ms 49568 KB Output is correct
52 Correct 1046 ms 50352 KB Output is correct
53 Correct 922 ms 51244 KB Output is correct
54 Correct 841 ms 51196 KB Output is correct
55 Correct 1 ms 584 KB Output is correct
56 Correct 138 ms 49472 KB Output is correct
57 Correct 899 ms 49532 KB Output is correct
58 Correct 436 ms 9276 KB Output is correct
59 Correct 844 ms 49548 KB Output is correct
60 Correct 394 ms 18048 KB Output is correct
61 Correct 925 ms 49544 KB Output is correct
62 Correct 984 ms 51248 KB Output is correct
63 Correct 961 ms 50736 KB Output is correct
64 Correct 954 ms 50600 KB Output is correct
65 Correct 909 ms 49584 KB Output is correct
66 Correct 1186 ms 50312 KB Output is correct
67 Correct 945 ms 51200 KB Output is correct
68 Correct 805 ms 51248 KB Output is correct
69 Correct 1 ms 584 KB Output is correct
70 Correct 1 ms 584 KB Output is correct
71 Correct 3 ms 584 KB Output is correct
72 Correct 2 ms 584 KB Output is correct
73 Correct 3 ms 584 KB Output is correct
74 Correct 2 ms 584 KB Output is correct
75 Correct 3 ms 584 KB Output is correct
76 Correct 1 ms 584 KB Output is correct
77 Correct 0 ms 584 KB Output is correct
78 Correct 2 ms 584 KB Output is correct
79 Correct 2 ms 584 KB Output is correct
80 Correct 3 ms 584 KB Output is correct
81 Correct 2 ms 584 KB Output is correct
82 Correct 3 ms 584 KB Output is correct
83 Correct 2 ms 584 KB Output is correct
84 Correct 1 ms 584 KB Output is correct
85 Correct 3 ms 584 KB Output is correct
86 Correct 16 ms 1096 KB Output is correct
87 Correct 20 ms 1096 KB Output is correct
88 Correct 11 ms 1096 KB Output is correct
89 Correct 19 ms 1096 KB Output is correct
90 Correct 17 ms 1096 KB Output is correct
91 Correct 1 ms 584 KB Output is correct
92 Correct 1 ms 712 KB Output is correct
93 Correct 18 ms 1096 KB Output is correct
94 Correct 18 ms 1096 KB Output is correct
95 Correct 24 ms 1096 KB Output is correct
96 Correct 22 ms 1096 KB Output is correct
97 Correct 18 ms 1096 KB Output is correct
98 Correct 1 ms 584 KB Output is correct
99 Correct 61 ms 49564 KB Output is correct
100 Correct 60 ms 49544 KB Output is correct
101 Correct 59 ms 50828 KB Output is correct
102 Correct 60 ms 49544 KB Output is correct
103 Correct 57 ms 50352 KB Output is correct
104 Correct 57 ms 51216 KB Output is correct
105 Correct 0 ms 584 KB Output is correct
106 Correct 34 ms 29048 KB Output is correct
107 Correct 75 ms 49672 KB Output is correct
108 Correct 56 ms 50992 KB Output is correct
109 Correct 63 ms 49588 KB Output is correct
110 Correct 58 ms 50332 KB Output is correct
111 Correct 56 ms 51120 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 584 KB Output is correct
2 Correct 1 ms 584 KB Output is correct
3 Correct 154 ms 41040 KB Output is correct
4 Correct 1020 ms 51216 KB Output is correct
5 Correct 1046 ms 26168 KB Output is correct
6 Correct 1097 ms 51168 KB Output is correct
7 Correct 895 ms 35244 KB Output is correct
8 Correct 1219 ms 51224 KB Output is correct
9 Correct 1 ms 584 KB Output is correct
10 Correct 0 ms 584 KB Output is correct
11 Correct 1 ms 584 KB Output is correct
12 Correct 1 ms 584 KB Output is correct
13 Correct 2 ms 584 KB Output is correct
14 Incorrect 3 ms 584 KB Output isn't correct
15 Halted 0 ms 0 KB -