oj.uz

Submission #942703

# Submission time Handle Problem Language Result Execution time Memory
942703 2024-03-11T03:11:36 Z penguin133 Triple Jump (JOI19_jumps) C++17
0 / 100
 21 ms 6748 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

int n, A[500005], S[500005], q;
int ans;
void dnc(int l, int r, int optl, int optr){
	if(l > r)return;
	int mid = (l + r) >> 1;
	int mx = -1e18, opt = max(optl, mid * 2 - n);
	for(int i = max(optl, mid * 2 - n); i <= min(optr, mid - 1); i++){
		if(A[i] + A[mid] + S[mid * 2 - i] > mx){
			mx = A[i] + A[mid] + S[mid * 2 - i];
			opt = i;
		}
	}
	ans = max(ans, mx);
	dnc(l, mid - 1, optl, opt);
	dnc(mid + 1, r, opt, optr);
}

void solve(){
	cin >> n;
	for(int i = 1; i <= n; i++)cin >> A[i];
	S[n] = A[n];
	for(int i = n - 1; i >= 1; i--)S[i] = max(S[i + 1], A[i]);
	cin >> q;
	while(q--){
		int l, r; cin >> l >> r;
	}
	dnc(1, n, 1, n);
	cout << ans;
}

main(){
	ios::sync_with_stdio(0);cin.tie(0);
	int tc = 1;
	//cin >> tc;
	for(int tc1=1;tc1<=tc;tc1++){
		// cout << "Case #" << tc1 << ": ";
		solve();
	}
}

Compilation message

jumps.cpp:44:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   44 | main(){
      | ^~~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Incorrect 1 ms 2396 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Incorrect 1 ms 2396 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 6744 KB Output is correct
2 Correct 17 ms 6744 KB Output is correct
3 Correct 19 ms 6748 KB Output is correct
4 Correct 19 ms 6748 KB Output is correct
5 Correct 19 ms 6612 KB Output is correct
6 Correct 21 ms 6748 KB Output is correct
7 Incorrect 16 ms 6748 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #4
0 / 54.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Incorrect 1 ms 2396 KB Output isn't correct
3 Halted 0 ms 0 KB -