Submission #981159

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
981159	2024-05-13T00:28:37 Z	Darren0724	Rainforest Jumps (APIO21_jumps)	C++17	0 / 100	4000 ms	5436 KB

jumps

#include "jumps.h"
#include <bits/stdc++.h>
using namespace std;
int n;
vector<int> v,a,b;
void init(int N, vector<int> H) {
	n=N;
	v=H;
	a.resize(n,-1);
	b.resize(n,-1);
	vector<int> st;
	for(int i=0;i<n;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);
	}
}
int f(int A, int C) {
    int ans=0;
	int now=A;
	while(now!=C){
		if(v[now]>v[C])return -1;
		if(a[now]==-1&&b[now]==-1){
			return -1;
		}
		if(a[now]==-1)now=b[now];
		else if(b[now]==-1)now=a[now];
		else{
			int g1=a[now],g2=b[now];
			if(v[g1]<v[g2])swap(g1,g2);
			if(v[g1]<=v[C])now=g1;
			else if(v[g2]<=v[C])now=g2;
			else return -1;
		}
		ans++;
	}
	return ans;
}
int minimum_jumps(int A, int B, int C, int D) {
    int ans=1e9;
	for(int i=A;i<=B;i++){
		for(int j=C;j<=D;j++){
			ans=min(ans,f(i,j));
		}
	}
	if(ans==1e9)ans=-1;
	return ans;
}

Subtask #1

0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	596 KB	Output is correct
3	Execution timed out	4056 ms	4508 KB	Time limit exceeded
4	Halted	0 ms	0 KB	-

Subtask #2

0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	348 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #3

0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	348 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #4

0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	344 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #5

0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	131 ms	2076 KB	Output is correct
5	Correct	570 ms	4300 KB	Output is correct
6	Correct	387 ms	1084 KB	Output is correct
7	Correct	568 ms	4288 KB	Output is correct
8	Correct	338 ms	1624 KB	Output is correct
9	Correct	602 ms	4292 KB	Output is correct
10	Execution timed out	4005 ms	5436 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	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	131 ms	2076 KB	Output is correct
5	Correct	570 ms	4300 KB	Output is correct
6	Correct	387 ms	1084 KB	Output is correct
7	Correct	568 ms	4288 KB	Output is correct
8	Correct	338 ms	1624 KB	Output is correct
9	Correct	602 ms	4292 KB	Output is correct
10	Execution timed out	4005 ms	5436 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	344 KB	Output is correct
2	Correct	0 ms	596 KB	Output is correct
3	Execution timed out	4056 ms	4508 KB	Time limit exceeded
4	Halted	0 ms	0 KB	-