oj.uz

Submission #434143

# Submission time Handle Problem Language Result Execution time Memory
434143 2021-06-20T15:37:48 Z dqhungdl Rainforest Jumps (APIO21_jumps) C++17
27 / 100
 1718 ms 66992 KB 
#include "jumps.h"

#include <bits/stdc++.h>
using namespace std;

typedef pair<int,int> ii;
const int MAX=2e5+5;
int Lg[MAX],J[MAX][20],JR[MAX][20];
ii f[MAX][20];

ii query(int l,int r) {
	int k=Lg[r-l+1];
	return max(f[l][k],f[r-(1<<k)+1][k]);
}

void init(int N, std::vector<int> H) {
	// Init log
	for(int i=1;i<=N;i++)
		Lg[i]=log2(i);
	// Init RMQ
	for(int i=0;i<N;i++)
		f[i][0]=ii(H[i],i);
	for(int k=1;(1<<k)<=N;k++)
		for(int i=0;i+(1<<k)-1<N;i++)
			f[i][k]=max(f[i][k-1],f[i+(1<<(k-1))][k-1]);
	vector<int> L(N),R(N);
	// Init left
	for(int i=0; i<N;i++) {
		int tmp=i-1;
		while(tmp>=0&&H[tmp]<=H[i])
			tmp=L[tmp];
		L[i]=tmp;
	}
	// Init right
	for(int i=N-1; i>=0;i--) {
		int tmp=i+1;
		while(tmp<N&&H[tmp]<=H[i])
			tmp=R[tmp];
		R[i]=tmp;
	}
	// Init jumps RMQ
	for(int i=0;i<N;i++) {
		if(L[i]==-1&&R[i]==N)
			J[i][0]=-1;
		else if(L[i]==-1)
			J[i][0]=R[i];
		else if(R[i]==N)
			J[i][0]=L[i];
		else if(H[L[i]]>H[R[i]])
			J[i][0]=L[i];
		else
			J[i][0]=R[i];
	}
	for(int k=1;k<20;k++)
		for(int i=0;i<N;i++)
			if(J[i][k-1]==-1)
				J[i][k]=-1;
			else
				J[i][k]=J[J[i][k-1]][k-1];
	// Init jumps right RMQ
	for(int i=0;i<N;i++)
		JR[i][0]=R[i];
	for(int k=1;k<20;k++)
		for(int i=0;i<N;i++)
			if(JR[i][k-1]==N)
				JR[i][k]=N;
			else
				JR[i][k]=JR[JR[i][k-1]][k-1];
}

int minimum_jumps(int A, int B, int C, int D) {
	// Special cases
	ii maxBC=query(B+1,C-1),maxCD=query(C,D);
	if(f[B][0].first>=maxCD.first)
		return -1;
	if(B+1==C)
		return 1;
	if(maxBC.first>=maxCD.first)
		return -1;
	// Find the starting position
	int pos=B;
	for(int i=19;i>=0;i--) {
		if((1<<i)>pos-A+1||f[pos-(1<<i)+1][i].first>=maxCD.first)
			continue;
		pos=pos-(1<<i)+1;
	}
	pos=query(pos,B).second;
	// RMQ jumps
	int rs=0;
	for(int i=19;i>=0;i--) {
		if(J[pos][i]==-1||f[J[pos][i]][0].first>=maxBC.first)
			continue;
		pos=J[pos][i];
		rs+=(1<<i);
	}
	if(J[pos][0]!=-1&&f[J[pos][0]][0].first<maxCD.first)
		return rs+2;
	// RMQ jumps right
	for(int i=19;i>=0;i--)
		if(JR[pos][i]<C) {
			rs+=(1<<i);
			pos=JR[pos][i];
		}
	return rs+1;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 332 ms 53264 KB Output is correct
4 Correct 1616 ms 66824 KB Output is correct
5 Correct 1303 ms 33696 KB Output is correct
6 Correct 1718 ms 66720 KB Output is correct
7 Correct 1134 ms 45680 KB Output is correct
8 Correct 1522 ms 66752 KB Output is correct

Subtask #2
0 / 8.0

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

Subtask #3
0 / 13.0

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

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 0 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 173 ms 53908 KB Output is correct
6 Correct 196 ms 66704 KB Output is correct
7 Correct 82 ms 34244 KB Output is correct
8 Correct 203 ms 66848 KB Output is correct
9 Correct 15 ms 10264 KB Output is correct
10 Correct 209 ms 66716 KB Output is correct
11 Correct 191 ms 66932 KB Output is correct
12 Incorrect 209 ms 66732 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 293 ms 30616 KB Output is correct
5 Correct 1225 ms 66720 KB Output is correct
6 Correct 789 ms 11288 KB Output is correct
7 Correct 1172 ms 66948 KB Output is correct
8 Correct 710 ms 23100 KB Output is correct
9 Correct 1205 ms 66756 KB Output is correct
10 Correct 1505 ms 66752 KB Output is correct
11 Correct 1312 ms 66716 KB Output is correct
12 Correct 1338 ms 66788 KB Output is correct
13 Correct 1141 ms 66732 KB Output is correct
14 Correct 1315 ms 66716 KB Output is correct
15 Correct 1265 ms 66752 KB Output is correct
16 Correct 1133 ms 66828 KB Output is correct
17 Correct 1 ms 200 KB Output is correct
18 Correct 1 ms 200 KB Output is correct
19 Correct 3 ms 200 KB Output is correct
20 Correct 3 ms 328 KB Output is correct
21 Correct 3 ms 328 KB Output is correct
22 Correct 2 ms 328 KB Output is correct
23 Correct 3 ms 328 KB Output is correct
24 Correct 3 ms 328 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 2 ms 456 KB Output is correct
27 Correct 11 ms 968 KB Output is correct
28 Correct 18 ms 968 KB Output is correct
29 Correct 24 ms 968 KB Output is correct
30 Correct 28 ms 968 KB Output is correct
31 Correct 21 ms 968 KB Output is correct
32 Correct 1 ms 200 KB Output is correct
33 Correct 102 ms 38724 KB Output is correct
34 Correct 207 ms 66828 KB Output is correct
35 Correct 195 ms 66716 KB Output is correct
36 Correct 195 ms 66752 KB Output is correct
37 Correct 197 ms 66752 KB Output is correct
38 Correct 190 ms 66732 KB Output is correct

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 293 ms 30616 KB Output is correct
5 Correct 1225 ms 66720 KB Output is correct
6 Correct 789 ms 11288 KB Output is correct
7 Correct 1172 ms 66948 KB Output is correct
8 Correct 710 ms 23100 KB Output is correct
9 Correct 1205 ms 66756 KB Output is correct
10 Correct 1505 ms 66752 KB Output is correct
11 Correct 1312 ms 66716 KB Output is correct
12 Correct 1338 ms 66788 KB Output is correct
13 Correct 1141 ms 66732 KB Output is correct
14 Correct 1315 ms 66716 KB Output is correct
15 Correct 1265 ms 66752 KB Output is correct
16 Correct 1133 ms 66828 KB Output is correct
17 Correct 1 ms 200 KB Output is correct
18 Correct 1 ms 200 KB Output is correct
19 Correct 3 ms 200 KB Output is correct
20 Correct 3 ms 328 KB Output is correct
21 Correct 3 ms 328 KB Output is correct
22 Correct 2 ms 328 KB Output is correct
23 Correct 3 ms 328 KB Output is correct
24 Correct 3 ms 328 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 2 ms 456 KB Output is correct
27 Correct 11 ms 968 KB Output is correct
28 Correct 18 ms 968 KB Output is correct
29 Correct 24 ms 968 KB Output is correct
30 Correct 28 ms 968 KB Output is correct
31 Correct 21 ms 968 KB Output is correct
32 Correct 1 ms 200 KB Output is correct
33 Correct 102 ms 38724 KB Output is correct
34 Correct 207 ms 66828 KB Output is correct
35 Correct 195 ms 66716 KB Output is correct
36 Correct 195 ms 66752 KB Output is correct
37 Correct 197 ms 66752 KB Output is correct
38 Correct 190 ms 66732 KB Output is correct
39 Correct 0 ms 200 KB Output is correct
40 Correct 0 ms 200 KB Output is correct
41 Correct 0 ms 200 KB Output is correct
42 Correct 333 ms 30608 KB Output is correct
43 Correct 1133 ms 66844 KB Output is correct
44 Correct 633 ms 11248 KB Output is correct
45 Correct 1137 ms 66712 KB Output is correct
46 Correct 614 ms 23104 KB Output is correct
47 Correct 1123 ms 66756 KB Output is correct
48 Correct 1474 ms 66748 KB Output is correct
49 Correct 1226 ms 66712 KB Output is correct
50 Correct 1450 ms 66712 KB Output is correct
51 Correct 1058 ms 66992 KB Output is correct
52 Correct 1322 ms 66796 KB Output is correct
53 Correct 1167 ms 66752 KB Output is correct
54 Correct 1093 ms 66784 KB Output is correct
55 Correct 1 ms 200 KB Output is correct
56 Correct 225 ms 66448 KB Output is correct
57 Correct 1137 ms 66880 KB Output is correct
58 Incorrect 502 ms 11968 KB Output isn't correct
59 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 332 ms 53264 KB Output is correct
4 Correct 1616 ms 66824 KB Output is correct
5 Correct 1303 ms 33696 KB Output is correct
6 Correct 1718 ms 66720 KB Output is correct
7 Correct 1134 ms 45680 KB Output is correct
8 Correct 1522 ms 66752 KB Output is correct
9 Correct 0 ms 200 KB Output is correct
10 Correct 0 ms 200 KB Output is correct
11 Correct 0 ms 200 KB Output is correct
12 Correct 0 ms 200 KB Output is correct
13 Incorrect 2 ms 200 KB Output isn't correct
14 Halted 0 ms 0 KB -