oj.uz

Submission #539028

# Submission time Handle Problem Language Result Execution time Memory
539028 2022-03-18T09:50:46 Z _karan_gandhi Feast (NOI19_feast) C++17
43 / 100
 1000 ms 262144 KB 
#include <bits/stdc++.h>
using namespace std;

#define all(v) v.begin(), v.end()
#define endl '\n'
#define pl(var) " [" << #var << ": " << (var) << "] "
#define ll long long

void solve() {
	// dp[i][j] = the max sum that can be obtained if j subsegments are chosen and last subsegment ends at i

	// dp[i][j] = dp[0..i][j-1]
	int n, k; cin >> n >> k;
	vector<ll int> arr(n); for (int i = 0; i < n; i++) {
		cin >> arr[i];
	}

	bool good = 1;
	for (int i = 0; i < n; i++) {
		if (arr[i] < 0) good = 0;
	}

	if (good) {
		ll int cur = 0;
		for (int i = 0; i < n; i++) {
			cur += arr[i];
		}

		cout << cur << endl;
		return;
	}

	vector<vector<ll int>> dp(n + 1, vector<ll int>(k + 1, 0));

	ll int ans = 0;
	ll int mn = 0;
	ll int pref = 0;
	for (int i = 0; i < n; i++) {
		pref += arr[i];
		mn = min(pref, mn);
		dp[i][1] = max(pref - mn, pref);
		ans = max(ans, dp[i][1]);
		if (arr[i] < 0) good = 0;
	}

	for (int i = 2; i <= k; i++) {
		for (int j = i - 1; j < n; j++) {
			ll int cur = arr[j]; 
			ll int best = arr[j];
			for (int k = j - 1; k >= 0; k--) {
				dp[j][i] = max(dp[k][i - 1] + best, dp[j][i]);
				cur += arr[k];
				best = max(best, cur);
			}
			ans = max(ans, dp[j][i]);
		}
	}

	cout << ans << endl;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	int T = 1;
	// cin >> T;
	while (T--)
		solve();
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 2640 KB Output is correct
2 Correct 34 ms 5440 KB Output is correct
3 Correct 46 ms 5468 KB Output is correct
4 Correct 33 ms 5448 KB Output is correct
5 Correct 35 ms 5440 KB Output is correct
6 Correct 31 ms 5392 KB Output is correct
7 Correct 31 ms 5276 KB Output is correct
8 Correct 44 ms 5444 KB Output is correct
9 Correct 37 ms 5460 KB Output is correct
10 Correct 29 ms 5424 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 18644 KB Output is correct
2 Correct 35 ms 19060 KB Output is correct
3 Correct 52 ms 18508 KB Output is correct
4 Runtime error 139 ms 262144 KB Execution killed with signal 9
5 Halted 0 ms 0 KB -

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 18900 KB Output is correct
2 Correct 48 ms 18612 KB Output is correct
3 Correct 50 ms 18756 KB Output is correct
4 Correct 49 ms 18604 KB Output is correct
5 Correct 67 ms 18724 KB Output is correct
6 Correct 48 ms 19020 KB Output is correct
7 Correct 49 ms 18916 KB Output is correct
8 Correct 48 ms 18764 KB Output is correct
9 Correct 48 ms 19048 KB Output is correct
10 Correct 49 ms 19012 KB Output is correct

Subtask #4
10.0 / 10.0

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

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 5 ms 340 KB Output is correct
12 Correct 3 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 3 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 4 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 5 ms 340 KB Output is correct
12 Correct 3 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 3 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 4 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 695 ms 3432 KB Output is correct
22 Execution timed out 1086 ms 25940 KB Time limit exceeded
23 Halted 0 ms 0 KB -

Subtask #7
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 2640 KB Output is correct
2 Correct 34 ms 5440 KB Output is correct
3 Correct 46 ms 5468 KB Output is correct
4 Correct 33 ms 5448 KB Output is correct
5 Correct 35 ms 5440 KB Output is correct
6 Correct 31 ms 5392 KB Output is correct
7 Correct 31 ms 5276 KB Output is correct
8 Correct 44 ms 5444 KB Output is correct
9 Correct 37 ms 5460 KB Output is correct
10 Correct 29 ms 5424 KB Output is correct
11 Correct 36 ms 18644 KB Output is correct
12 Correct 35 ms 19060 KB Output is correct
13 Correct 52 ms 18508 KB Output is correct
14 Runtime error 139 ms 262144 KB Execution killed with signal 9
15 Halted 0 ms 0 KB -