oj.uz

Submission #981211

# Submission time Handle Problem Language Result Execution time Memory
981211 2024-05-13T02:24:19 Z Darren0724 Rainforest Jumps (APIO21_jumps) C++17
33 / 100
 4000 ms 38072 KB 
#include "jumps.h"
#include <bits/stdc++.h>
using namespace std;
int n;
vector<int> v,a,b,pl,mark;
int jump[20][200005];
int jump1[20][200005];
void init(int N, vector<int> H) {
	n=N;
	v=H;
	a.resize(n,-1);
	b.resize(n,-1);
	pl.resize(n+1);
	mark.resize(n+1);
	vector<int> st;
	for(int i=0;i<n;i++){
		pl[v[i]]=i;
		while(st.size()&&v[st.back()]<v[i]){
			st.pop_back();
		}
		a[i]=(st.size()?st.back():-1);
		st.push_back(i);
	}
	st.clear();
	for(int i=n-1;i>=0;i--){
		while(st.size()&&v[st.back()]<v[i]){
			st.pop_back();
		}
		b[i]=(st.size()?st.back():-1);
		st.push_back(i);
	}
	for(int i=0;i<n;i++){
		if(a[i]==-1){
			swap(a[i],b[i]);
			mark[i]=1;
		}
		else if(b[i]==-1){
			continue;
		}
		else {
			if(v[a[i]]<v[b[i]]){
				swap(a[i],b[i]);
				mark[i]=1;
			}
		}
	}
	for(int j=n;j>=1;j--){
		int i=pl[j];
		int now=a[i];
		jump[0][i]=now;
		for(int k=1;k<20;k++){
			if(now==-1){
				jump[k][i]=-1;
				continue;
			}
			else{
				now=jump[k][i]=jump[k-1][now];
			}
		}
		now=b[i];
		jump1[0][i]=now;
		for(int k=1;k<20;k++){
			if(now==-1){
				jump1[k][i]=-1;
				continue;
			}
			else{
				now=jump1[k][i]=jump1[k-1][now];
			}
		}
	}
	for(int i=0;i<n;i++){
		if(mark[i]){
			swap(a[i],b[i]);
		}
	}
}
int f(int A, int C) {
    int ans=0;
	int now=A;
	for(int k=19;k>=0;k--){
		int tmp=jump[k][now];
		if(tmp!=-1&&v[tmp]<=v[C]){
			ans+=(1<<k);
			now=tmp;
		}
	}
	for(int k=19;k>=0;k--){
		int tmp=jump1[k][now];
		if(tmp!=-1&&v[tmp]<=v[C]){
			ans+=(1<<k);
			now=tmp;
		}
	}
	if(now!=C)ans=1e9;
	return ans;
}
int minimum_jumps(int A, int B, int C, int D) {
    int ans=1e9;
	vector<int> t(n+1);
	for(int i=A;i<=B;i++){
		if(b[i]!=-1&&b[i]<=B)continue;
		t[i]=1;
	}
	for(int j=C;j<=D;j++){
		if(a[j]!=-1&&a[j]>=C)continue;
		t[j]=1;
	}
	int tmp=-1;
	for(int i=1;i<=n;i++){
		if(!t[pl[i]])continue;
		if(pl[i]<=B){
			tmp=pl[i];
		}
		else{
			ans=min(ans,f(tmp,pl[i]));
		}
	}
	if(ans==1e9)ans=-1;
	return ans;
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 31064 KB Output is correct
2 Correct 4 ms 31064 KB Output is correct
3 Execution timed out 4050 ms 36500 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 31064 KB Output is correct
2 Correct 5 ms 31064 KB Output is correct
3 Correct 4 ms 31064 KB Output is correct
4 Correct 4 ms 31136 KB Output is correct
5 Correct 5 ms 31064 KB Output is correct
6 Correct 5 ms 31324 KB Output is correct
7 Correct 4 ms 31064 KB Output is correct
8 Correct 5 ms 31172 KB Output is correct
9 Correct 4 ms 31064 KB Output is correct
10 Correct 5 ms 31064 KB Output is correct
11 Correct 5 ms 31064 KB Output is correct
12 Correct 5 ms 31064 KB Output is correct
13 Correct 6 ms 31064 KB Output is correct
14 Correct 5 ms 31064 KB Output is correct
15 Correct 5 ms 31064 KB Output is correct
16 Correct 5 ms 31064 KB Output is correct
17 Correct 5 ms 31064 KB Output is correct
18 Correct 4 ms 31156 KB Output is correct
19 Correct 4 ms 31060 KB Output is correct
20 Correct 6 ms 31064 KB Output is correct
21 Correct 4 ms 31064 KB Output is correct
22 Correct 5 ms 31088 KB Output is correct
23 Correct 4 ms 31064 KB Output is correct
24 Correct 5 ms 31064 KB Output is correct
25 Correct 4 ms 31064 KB Output is correct
26 Correct 4 ms 31064 KB Output is correct
27 Correct 4 ms 31192 KB Output is correct
28 Correct 5 ms 31064 KB Output is correct
29 Correct 4 ms 31064 KB Output is correct
30 Correct 4 ms 31064 KB Output is correct
31 Correct 5 ms 31064 KB Output is correct
32 Correct 4 ms 31064 KB Output is correct
33 Correct 3 ms 31196 KB Output is correct
34 Correct 4 ms 31064 KB Output is correct
35 Correct 4 ms 31064 KB Output is correct
36 Correct 4 ms 31064 KB Output is correct
37 Correct 4 ms 31064 KB Output is correct
38 Correct 4 ms 31064 KB Output is correct
39 Correct 4 ms 31064 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 31064 KB Output is correct
2 Correct 5 ms 31064 KB Output is correct
3 Correct 4 ms 31064 KB Output is correct
4 Correct 4 ms 31136 KB Output is correct
5 Correct 5 ms 31064 KB Output is correct
6 Correct 5 ms 31324 KB Output is correct
7 Correct 4 ms 31064 KB Output is correct
8 Correct 5 ms 31172 KB Output is correct
9 Correct 4 ms 31064 KB Output is correct
10 Correct 5 ms 31064 KB Output is correct
11 Correct 5 ms 31064 KB Output is correct
12 Correct 5 ms 31064 KB Output is correct
13 Correct 6 ms 31064 KB Output is correct
14 Correct 5 ms 31064 KB Output is correct
15 Correct 5 ms 31064 KB Output is correct
16 Correct 5 ms 31064 KB Output is correct
17 Correct 5 ms 31064 KB Output is correct
18 Correct 4 ms 31156 KB Output is correct
19 Correct 4 ms 31060 KB Output is correct
20 Correct 6 ms 31064 KB Output is correct
21 Correct 4 ms 31064 KB Output is correct
22 Correct 5 ms 31088 KB Output is correct
23 Correct 4 ms 31064 KB Output is correct
24 Correct 5 ms 31064 KB Output is correct
25 Correct 4 ms 31064 KB Output is correct
26 Correct 4 ms 31064 KB Output is correct
27 Correct 4 ms 31192 KB Output is correct
28 Correct 5 ms 31064 KB Output is correct
29 Correct 4 ms 31064 KB Output is correct
30 Correct 4 ms 31064 KB Output is correct
31 Correct 5 ms 31064 KB Output is correct
32 Correct 4 ms 31064 KB Output is correct
33 Correct 3 ms 31196 KB Output is correct
34 Correct 4 ms 31064 KB Output is correct
35 Correct 4 ms 31064 KB Output is correct
36 Correct 4 ms 31064 KB Output is correct
37 Correct 4 ms 31064 KB Output is correct
38 Correct 4 ms 31064 KB Output is correct
39 Correct 4 ms 31064 KB Output is correct
40 Correct 4 ms 31376 KB Output is correct
41 Correct 3 ms 31064 KB Output is correct
42 Correct 4 ms 31064 KB Output is correct
43 Correct 4 ms 31064 KB Output is correct
44 Correct 4 ms 31064 KB Output is correct
45 Correct 5 ms 31064 KB Output is correct
46 Correct 4 ms 31180 KB Output is correct
47 Correct 4 ms 31064 KB Output is correct
48 Correct 4 ms 31172 KB Output is correct
49 Correct 5 ms 31064 KB Output is correct
50 Correct 5 ms 31064 KB Output is correct
51 Correct 5 ms 31064 KB Output is correct
52 Correct 5 ms 31064 KB Output is correct
53 Correct 4 ms 31064 KB Output is correct
54 Correct 5 ms 31064 KB Output is correct
55 Correct 5 ms 31064 KB Output is correct
56 Correct 4 ms 31212 KB Output is correct
57 Correct 4 ms 31064 KB Output is correct
58 Correct 14 ms 31064 KB Output is correct
59 Correct 19 ms 31064 KB Output is correct
60 Correct 7 ms 31064 KB Output is correct
61 Correct 19 ms 31064 KB Output is correct
62 Correct 10 ms 31064 KB Output is correct
63 Correct 17 ms 31064 KB Output is correct
64 Correct 51 ms 31064 KB Output is correct
65 Correct 53 ms 31064 KB Output is correct
66 Correct 48 ms 31064 KB Output is correct
67 Correct 20 ms 31064 KB Output is correct
68 Correct 46 ms 31064 KB Output is correct
69 Correct 30 ms 31064 KB Output is correct
70 Correct 76 ms 31064 KB Output is correct
71 Correct 4 ms 31064 KB Output is correct
72 Correct 4 ms 31064 KB Output is correct
73 Correct 5 ms 31212 KB Output is correct
74 Correct 5 ms 31320 KB Output is correct
75 Correct 5 ms 31064 KB Output is correct
76 Correct 5 ms 31064 KB Output is correct
77 Correct 5 ms 31064 KB Output is correct
78 Correct 4 ms 31064 KB Output is correct
79 Correct 4 ms 31188 KB Output is correct
80 Correct 4 ms 31064 KB Output is correct
81 Correct 4 ms 31064 KB Output is correct
82 Correct 4 ms 31064 KB Output is correct
83 Correct 4 ms 31064 KB Output is correct
84 Correct 4 ms 31064 KB Output is correct
85 Correct 4 ms 31064 KB Output is correct
86 Correct 4 ms 31064 KB Output is correct
87 Correct 5 ms 31064 KB Output is correct
88 Correct 4 ms 31064 KB Output is correct
89 Correct 4 ms 31064 KB Output is correct
90 Correct 4 ms 31064 KB Output is correct
91 Correct 4 ms 31064 KB Output is correct
92 Correct 4 ms 31064 KB Output is correct
93 Correct 3 ms 31216 KB Output is correct
94 Correct 5 ms 31064 KB Output is correct
95 Correct 16 ms 31064 KB Output is correct
96 Correct 17 ms 31064 KB Output is correct
97 Correct 20 ms 31064 KB Output is correct
98 Correct 18 ms 31248 KB Output is correct
99 Correct 16 ms 31064 KB Output is correct
100 Correct 4 ms 31064 KB Output is correct
101 Correct 4 ms 31064 KB Output is correct
102 Correct 16 ms 31060 KB Output is correct
103 Correct 18 ms 31064 KB Output is correct
104 Correct 16 ms 31064 KB Output is correct
105 Correct 15 ms 31064 KB Output is correct
106 Correct 18 ms 31064 KB Output is correct
107 Correct 4 ms 31064 KB Output is correct
108 Correct 4 ms 31064 KB Output is correct
109 Correct 4 ms 31232 KB Output is correct
110 Correct 4 ms 31064 KB Output is correct
111 Correct 4 ms 31064 KB Output is correct
112 Correct 4 ms 31064 KB Output is correct
113 Correct 4 ms 31064 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 31064 KB Output is correct
2 Correct 4 ms 31064 KB Output is correct
3 Correct 4 ms 31064 KB Output is correct
4 Correct 3 ms 31064 KB Output is correct
5 Correct 75 ms 36012 KB Output is correct
6 Correct 100 ms 37068 KB Output is correct
7 Correct 38 ms 34128 KB Output is correct
8 Correct 105 ms 37228 KB Output is correct
9 Correct 10 ms 32288 KB Output is correct
10 Correct 97 ms 37244 KB Output is correct
11 Correct 48 ms 37952 KB Output is correct
12 Correct 61 ms 37952 KB Output is correct
13 Correct 49 ms 37692 KB Output is correct
14 Correct 76 ms 37064 KB Output is correct
15 Correct 54 ms 37700 KB Output is correct
16 Correct 67 ms 37932 KB Output is correct
17 Correct 51 ms 37912 KB Output is correct
18 Correct 4 ms 31064 KB Output is correct
19 Correct 4 ms 31148 KB Output is correct
20 Correct 4 ms 31064 KB Output is correct
21 Correct 3 ms 31064 KB Output is correct
22 Correct 4 ms 31064 KB Output is correct
23 Correct 4 ms 31064 KB Output is correct
24 Correct 3 ms 31064 KB Output is correct
25 Correct 4 ms 31064 KB Output is correct
26 Correct 3 ms 31064 KB Output is correct
27 Correct 4 ms 31064 KB Output is correct
28 Correct 4 ms 31064 KB Output is correct
29 Correct 4 ms 31128 KB Output is correct
30 Correct 4 ms 31236 KB Output is correct
31 Correct 4 ms 31064 KB Output is correct
32 Correct 4 ms 31064 KB Output is correct
33 Correct 96 ms 37204 KB Output is correct
34 Correct 98 ms 37240 KB Output is correct
35 Correct 41 ms 37952 KB Output is correct
36 Correct 78 ms 37064 KB Output is correct
37 Correct 49 ms 37700 KB Output is correct
38 Correct 38 ms 37952 KB Output is correct
39 Correct 4 ms 31064 KB Output is correct
40 Correct 46 ms 34608 KB Output is correct
41 Correct 101 ms 37232 KB Output is correct
42 Correct 42 ms 37848 KB Output is correct
43 Correct 75 ms 37176 KB Output is correct
44 Correct 46 ms 37560 KB Output is correct
45 Correct 42 ms 38072 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 31064 KB Output is correct
2 Correct 4 ms 31064 KB Output is correct
3 Correct 4 ms 31212 KB Output is correct
4 Correct 2164 ms 33880 KB Output is correct
5 Execution timed out 4011 ms 37168 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 31064 KB Output is correct
2 Correct 4 ms 31064 KB Output is correct
3 Correct 4 ms 31212 KB Output is correct
4 Correct 2164 ms 33880 KB Output is correct
5 Execution timed out 4011 ms 37168 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 31064 KB Output is correct
2 Correct 4 ms 31064 KB Output is correct
3 Execution timed out 4050 ms 36500 KB Time limit exceeded
4 Halted 0 ms 0 KB -