oj.uz

Submission #739880

# Submission time Handle Problem Language Result Execution time Memory
739880 2023-05-11T13:50:38 Z MODDI Feast (NOI19_feast) C++14
63 / 100
 118 ms 63700 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;
vl 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){
		ll left = 0, right = 0, flag = 0, pos = -1;
		for(int i = 0; i < n; i++){
			if(arr[i] < 0){
				pos = i;
				flag = 1;
				continue;
			}
			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 102 ms 2516 KB Output is correct
2 Correct 111 ms 2516 KB Output is correct
3 Correct 104 ms 2644 KB Output is correct
4 Correct 104 ms 2644 KB Output is correct
5 Correct 107 ms 2612 KB Output is correct
6 Correct 100 ms 2576 KB Output is correct
7 Correct 105 ms 2584 KB Output is correct
8 Correct 108 ms 2516 KB Output is correct
9 Correct 109 ms 2580 KB Output is correct
10 Correct 108 ms 2516 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 2592 KB Output is correct
2 Correct 60 ms 2644 KB Output is correct
3 Correct 55 ms 2516 KB Output is correct
4 Incorrect 57 ms 2600 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 118 ms 2516 KB Output is correct
2 Correct 111 ms 2588 KB Output is correct
3 Correct 116 ms 2620 KB Output is correct
4 Correct 113 ms 2596 KB Output is correct
5 Correct 117 ms 2612 KB Output is correct
6 Correct 112 ms 2656 KB Output is correct
7 Correct 112 ms 2644 KB Output is correct
8 Correct 114 ms 2516 KB Output is correct
9 Correct 116 ms 2644 KB Output is correct
10 Correct 117 ms 2644 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 26 ms 63508 KB Output is correct
3 Correct 25 ms 63532 KB Output is correct
4 Correct 25 ms 63556 KB Output is correct
5 Correct 26 ms 63480 KB Output is correct
6 Correct 26 ms 63484 KB Output is correct
7 Correct 26 ms 63552 KB Output is correct
8 Correct 26 ms 63444 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 25 ms 63516 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 26 ms 63508 KB Output is correct
3 Correct 25 ms 63532 KB Output is correct
4 Correct 25 ms 63556 KB Output is correct
5 Correct 26 ms 63480 KB Output is correct
6 Correct 26 ms 63484 KB Output is correct
7 Correct 26 ms 63552 KB Output is correct
8 Correct 26 ms 63444 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 25 ms 63516 KB Output is correct
11 Correct 26 ms 63448 KB Output is correct
12 Correct 25 ms 63488 KB Output is correct
13 Correct 26 ms 63460 KB Output is correct
14 Correct 26 ms 63468 KB Output is correct
15 Correct 26 ms 63572 KB Output is correct
16 Correct 25 ms 63444 KB Output is correct
17 Correct 28 ms 63488 KB Output is correct
18 Correct 25 ms 63436 KB Output is correct
19 Correct 25 ms 63560 KB Output is correct
20 Correct 26 ms 63568 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 26 ms 63508 KB Output is correct
3 Correct 25 ms 63532 KB Output is correct
4 Correct 25 ms 63556 KB Output is correct
5 Correct 26 ms 63480 KB Output is correct
6 Correct 26 ms 63484 KB Output is correct
7 Correct 26 ms 63552 KB Output is correct
8 Correct 26 ms 63444 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 25 ms 63516 KB Output is correct
11 Correct 26 ms 63448 KB Output is correct
12 Correct 25 ms 63488 KB Output is correct
13 Correct 26 ms 63460 KB Output is correct
14 Correct 26 ms 63468 KB Output is correct
15 Correct 26 ms 63572 KB Output is correct
16 Correct 25 ms 63444 KB Output is correct
17 Correct 28 ms 63488 KB Output is correct
18 Correct 25 ms 63436 KB Output is correct
19 Correct 25 ms 63560 KB Output is correct
20 Correct 26 ms 63568 KB Output is correct
21 Correct 37 ms 63700 KB Output is correct
22 Correct 64 ms 63692 KB Output is correct
23 Correct 48 ms 63700 KB Output is correct
24 Correct 39 ms 63644 KB Output is correct
25 Correct 50 ms 63700 KB Output is correct
26 Correct 36 ms 63668 KB Output is correct
27 Correct 42 ms 63692 KB Output is correct
28 Correct 28 ms 63572 KB Output is correct
29 Correct 28 ms 63648 KB Output is correct
30 Correct 27 ms 63696 KB Output is correct

Subtask #7
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 102 ms 2516 KB Output is correct
2 Correct 111 ms 2516 KB Output is correct
3 Correct 104 ms 2644 KB Output is correct
4 Correct 104 ms 2644 KB Output is correct
5 Correct 107 ms 2612 KB Output is correct
6 Correct 100 ms 2576 KB Output is correct
7 Correct 105 ms 2584 KB Output is correct
8 Correct 108 ms 2516 KB Output is correct
9 Correct 109 ms 2580 KB Output is correct
10 Correct 108 ms 2516 KB Output is correct
11 Correct 56 ms 2592 KB Output is correct
12 Correct 60 ms 2644 KB Output is correct
13 Correct 55 ms 2516 KB Output is correct
14 Incorrect 57 ms 2600 KB Output isn't correct
15 Halted 0 ms 0 KB -