oj.uz

Submission #950094

# Submission time Handle Problem Language Result Execution time Memory
950094 2024-03-20T05:17:12 Z vjudge1 Triple Jump (JOI19_jumps) C++17
19 / 100
 4000 ms 154868 KB 
#include<bits/stdc++.h>

using namespace std;

const int N = (int)5e5+7;

int n, q, a[N];
int dp[5003][5003], mx[5003][5003];

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cin >> n;
	for(int i = 1; i <= n; ++i) {
		cin >> a[i];
	} 
	for(int i = 1; i <= n; ++i) {
		for(int j = i; j <= n; ++j) {
			mx[i][j] = max(mx[i][j-1], a[j]);
		}
	}
	for(int len = 3; len <= n; ++len) {
		for(int i = 1; i <= n-len+1; ++i) {
			int j = i+len-1;
			dp[i][j]=max(dp[i+1][j], dp[i][j-1]);
			int cur = a[i]+a[j];
			int m = (i+j)/2;
			cur += mx[i+1][m];
			dp[i][j] = max(dp[i][j], cur);
		}
	}
	cin >> q;
	while(q--) {
		int l, r;
		cin >> l >> r;
		cout << dp[l][r] << "\n";
	}
    return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 3164 KB Output is correct
3 Correct 2 ms 3164 KB Output is correct
4 Correct 1 ms 3164 KB Output is correct
5 Correct 1 ms 3164 KB Output is correct
6 Correct 1 ms 3164 KB Output is correct
7 Correct 1 ms 3164 KB Output is correct
8 Correct 1 ms 3164 KB Output is correct
9 Correct 1 ms 3164 KB Output is correct
10 Correct 2 ms 3164 KB Output is correct
11 Correct 435 ms 154708 KB Output is correct
12 Correct 408 ms 154868 KB Output is correct
13 Correct 399 ms 154628 KB Output is correct
14 Correct 433 ms 154708 KB Output is correct
15 Correct 405 ms 154744 KB Output is correct
16 Correct 416 ms 154080 KB Output is correct
17 Correct 408 ms 153968 KB Output is correct
18 Correct 409 ms 153940 KB Output is correct
19 Correct 397 ms 154544 KB Output is correct

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4041 ms 134048 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 54.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 3164 KB Output is correct
3 Correct 2 ms 3164 KB Output is correct
4 Correct 1 ms 3164 KB Output is correct
5 Correct 1 ms 3164 KB Output is correct
6 Correct 1 ms 3164 KB Output is correct
7 Correct 1 ms 3164 KB Output is correct
8 Correct 1 ms 3164 KB Output is correct
9 Correct 1 ms 3164 KB Output is correct
10 Correct 2 ms 3164 KB Output is correct
11 Correct 435 ms 154708 KB Output is correct
12 Correct 408 ms 154868 KB Output is correct
13 Correct 399 ms 154628 KB Output is correct
14 Correct 433 ms 154708 KB Output is correct
15 Correct 405 ms 154744 KB Output is correct
16 Correct 416 ms 154080 KB Output is correct
17 Correct 408 ms 153968 KB Output is correct
18 Correct 409 ms 153940 KB Output is correct
19 Correct 397 ms 154544 KB Output is correct
20 Execution timed out 4041 ms 134048 KB Time limit exceeded
21 Halted 0 ms 0 KB -