oj.uz

Submission #739875

# Submission time Handle Problem Language Result Execution time Memory
739875 2023-05-11T13:47:14 Z MODDI Feast (NOI19_feast) C++14
63 / 100
 148 ms 63712 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<long long, long long> pll;
typedef pair<int,int> pii;
typedef vector<long long> vl;
typedef vector<int> vi;
int n, k;
vi arr;
ll dp[2010][2010][2];
ll f(int at, int segments, int taken){
	if(at >= n)
		return 0;
	if(segments > k)
		return 0;
	if(dp[at][segments][taken] != -1)
		return dp[at][segments][taken];
		
	ll best = 0;
	best = max(best, arr[at] + f(at + 1, segments, 1));
	if(taken == 0)
		best = max(best, f(at + 1, segments, 0));
	if(segments + 1 < k && taken == 1)
		best = max(best, f(at + 1, segments + 1, 0));
	return dp[at][segments][taken] = best;
}
int main(){
	cin>>n>>k;
	arr.resize(n);
	int cnt = 0;
	for(int i = 0; i < n; i++){
		cin>>arr[i];
		if(arr[i] < 0)	cnt++;
	}
	if(cnt == 0){
		ll ans = 0;
		for(int i = 0; i < n; i++)	ans += arr[i];
		
		cout<<ans<<endl;
	}
	else if(cnt == 1){
		int left = 0, right = 0, flag = 0, pos = -1;
		for(int i = 0; i < n; i++){
			if(arr[i] < 0){
				pos = i;
				flag = 1;
			}
			else if(flag == 0)	left += arr[i];
			else right += arr[i];
		}
		cout<<max(max(left, right), left + right - arr[pos]);
	}
	else if(k == 1){
		ll ans = 0, help = 0;
		for(int i = 0; i < n; i++){
			help += arr[i];
			if(ans < help)	ans = help;
			if(help < 0)	help = 0;
		}
		cout<<ans<<endl;
	}
	else{
		memset(dp, -1, sizeof dp);
		cout<<f(0, 0, 0)<<endl;
	}
	return 0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 4112 KB Output is correct
2 Correct 107 ms 4260 KB Output is correct
3 Correct 106 ms 4272 KB Output is correct
4 Correct 105 ms 4264 KB Output is correct
5 Correct 106 ms 4292 KB Output is correct
6 Correct 102 ms 4236 KB Output is correct
7 Correct 104 ms 4228 KB Output is correct
8 Correct 106 ms 4260 KB Output is correct
9 Correct 105 ms 4244 KB Output is correct
10 Correct 107 ms 4172 KB Output is correct

Subtask #2
0 / 8.0

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

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 119 ms 4524 KB Output is correct
2 Correct 113 ms 4368 KB Output is correct
3 Correct 114 ms 4376 KB Output is correct
4 Correct 118 ms 4408 KB Output is correct
5 Correct 110 ms 4428 KB Output is correct
6 Correct 148 ms 4392 KB Output is correct
7 Correct 111 ms 4400 KB Output is correct
8 Correct 110 ms 4396 KB Output is correct
9 Correct 113 ms 4528 KB Output is correct
10 Correct 111 ms 4412 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 26 ms 63424 KB Output is correct
3 Correct 25 ms 63500 KB Output is correct
4 Correct 27 ms 63528 KB Output is correct
5 Correct 26 ms 63468 KB Output is correct
6 Correct 28 ms 63536 KB Output is correct
7 Correct 25 ms 63440 KB Output is correct
8 Correct 24 ms 63456 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 25 ms 63540 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 26 ms 63424 KB Output is correct
3 Correct 25 ms 63500 KB Output is correct
4 Correct 27 ms 63528 KB Output is correct
5 Correct 26 ms 63468 KB Output is correct
6 Correct 28 ms 63536 KB Output is correct
7 Correct 25 ms 63440 KB Output is correct
8 Correct 24 ms 63456 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 25 ms 63540 KB Output is correct
11 Correct 26 ms 63556 KB Output is correct
12 Correct 26 ms 63572 KB Output is correct
13 Correct 26 ms 63504 KB Output is correct
14 Correct 25 ms 63492 KB Output is correct
15 Correct 26 ms 63532 KB Output is correct
16 Correct 27 ms 63528 KB Output is correct
17 Correct 26 ms 63444 KB Output is correct
18 Correct 26 ms 63460 KB Output is correct
19 Correct 26 ms 63484 KB Output is correct
20 Correct 25 ms 63476 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 26 ms 63424 KB Output is correct
3 Correct 25 ms 63500 KB Output is correct
4 Correct 27 ms 63528 KB Output is correct
5 Correct 26 ms 63468 KB Output is correct
6 Correct 28 ms 63536 KB Output is correct
7 Correct 25 ms 63440 KB Output is correct
8 Correct 24 ms 63456 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 25 ms 63540 KB Output is correct
11 Correct 26 ms 63556 KB Output is correct
12 Correct 26 ms 63572 KB Output is correct
13 Correct 26 ms 63504 KB Output is correct
14 Correct 25 ms 63492 KB Output is correct
15 Correct 26 ms 63532 KB Output is correct
16 Correct 27 ms 63528 KB Output is correct
17 Correct 26 ms 63444 KB Output is correct
18 Correct 26 ms 63460 KB Output is correct
19 Correct 26 ms 63484 KB Output is correct
20 Correct 25 ms 63476 KB Output is correct
21 Correct 38 ms 63592 KB Output is correct
22 Correct 61 ms 63664 KB Output is correct
23 Correct 47 ms 63708 KB Output is correct
24 Correct 37 ms 63692 KB Output is correct
25 Correct 43 ms 63700 KB Output is correct
26 Correct 37 ms 63648 KB Output is correct
27 Correct 44 ms 63712 KB Output is correct
28 Correct 27 ms 63692 KB Output is correct
29 Correct 30 ms 63704 KB Output is correct
30 Correct 24 ms 63584 KB Output is correct

Subtask #7
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 4112 KB Output is correct
2 Correct 107 ms 4260 KB Output is correct
3 Correct 106 ms 4272 KB Output is correct
4 Correct 105 ms 4264 KB Output is correct
5 Correct 106 ms 4292 KB Output is correct
6 Correct 102 ms 4236 KB Output is correct
7 Correct 104 ms 4228 KB Output is correct
8 Correct 106 ms 4260 KB Output is correct
9 Correct 105 ms 4244 KB Output is correct
10 Correct 107 ms 4172 KB Output is correct
11 Incorrect 56 ms 2456 KB Output isn't correct
12 Halted 0 ms 0 KB -