oj.uz

Submission #941693

# Submission time Handle Problem Language Result Execution time Memory
941693 2024-03-09T09:51:48 Z emptypringlescan Triple Jump (JOI19_jumps) C++17
32 / 100
 4000 ms 8276 KB 
#include <bits/stdc++.h>
using namespace std;
int32_t main(){
    ios::sync_with_stdio(0);cin.tie(0);
    int n;
    cin >> n;
    long long arr[n];
    for(int i=0; i<n; i++) cin >> arr[i];
    int q;
    cin >> q;
	vector<pair<long long,int> > mono;
	long long suf[n];
    while(q--){
		int l,r;
		cin >> l >> r;
		l--; r--;
		mono.clear();
		suf[r]=arr[r];
		for(int i=r-1; i>=l; i--) suf[i]=max(suf[i+1],arr[i]);
		long long ans=0;
		for(int i=l; i<=r; i++){
			while(!mono.empty()&&mono.back().first<=arr[i]){
				int a=mono.back().second;
				if(i*2-a<=r) ans=max(ans,arr[a]+arr[i]+suf[i*2-a]);
				mono.pop_back();
			}
			if(!mono.empty()){
				int a=mono.back().second;
				if(i*2-a<=r) ans=max(ans,arr[a]+arr[i]+suf[i*2-a]);
			}
			mono.push_back({arr[i],i});
		}
		cout << ans << '\n';
	}
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Execution timed out 4030 ms 2408 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 3420 KB Output is correct
2 Correct 18 ms 3416 KB Output is correct
3 Correct 21 ms 8276 KB Output is correct
4 Correct 19 ms 3420 KB Output is correct
5 Correct 19 ms 3420 KB Output is correct
6 Correct 15 ms 3420 KB Output is correct
7 Correct 15 ms 3556 KB Output is correct
8 Correct 15 ms 3416 KB Output is correct
9 Correct 21 ms 3420 KB Output is correct

Subtask #4
0 / 54.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Execution timed out 4030 ms 2408 KB Time limit exceeded
12 Halted 0 ms 0 KB -