oj.uz

Submission #336562

# Submission time Handle Problem Language Result Execution time Memory
336562 2020-12-15T17:06:19 Z super_j6 Feast (NOI19_feast) C++14
12 / 100
 78 ms 7532 KB 
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
#define endl '\n'
#define ll long long
#define pi pair<ll, ll>
#define f first
#define s second

const int mxn = 300001;
int n, k;
ll a[mxn];
pi dp[mxn];

pi sol(ll x){
	pi p = dp[0];
	for(int i = 1; i <= n; i++){
		dp[i] = dp[i - 1];
		if(p.f + a[i] - x > dp[i].f) dp[i] = {p.f + a[i] - x, p.s + 1};
		if(dp[i].f - a[i] > p.f) p = {dp[i].f - a[i], dp[i].s};
	}
	return dp[n];
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n >> k;
	
	for(int i = 1; i <= n; i++) cin >> a[i], a[i] += a[i - 1];
	
	ll l = -1, r = a[n];
	while(r - l > 1){
		ll mid = (l + r) / 2;
		if(sol(mid).s <= k) r = mid; 
		else l = mid;
	}
	
	pi p = sol(r);
	
	cout << (p.f + p.s * r) << endl;

	return 0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 7276 KB Output is correct
2 Correct 71 ms 7404 KB Output is correct
3 Correct 78 ms 7404 KB Output is correct
4 Correct 74 ms 7532 KB Output is correct
5 Correct 72 ms 7276 KB Output is correct
6 Correct 70 ms 7276 KB Output is correct
7 Correct 70 ms 7148 KB Output is correct
8 Correct 71 ms 7276 KB Output is correct
9 Correct 73 ms 7148 KB Output is correct
10 Correct 71 ms 7276 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 7276 KB Output is correct
2 Correct 49 ms 7404 KB Output is correct
3 Correct 47 ms 7148 KB Output is correct
4 Correct 46 ms 7276 KB Output is correct
5 Correct 71 ms 7148 KB Output is correct
6 Correct 45 ms 7148 KB Output is correct
7 Correct 45 ms 7532 KB Output is correct
8 Correct 74 ms 7276 KB Output is correct
9 Correct 72 ms 7148 KB Output is correct
10 Correct 46 ms 7276 KB Output is correct

Subtask #3
0 / 18.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 11.0

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

Subtask #6
0 / 20.0

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

Subtask #7
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 7276 KB Output is correct
2 Correct 71 ms 7404 KB Output is correct
3 Correct 78 ms 7404 KB Output is correct
4 Correct 74 ms 7532 KB Output is correct
5 Correct 72 ms 7276 KB Output is correct
6 Correct 70 ms 7276 KB Output is correct
7 Correct 70 ms 7148 KB Output is correct
8 Correct 71 ms 7276 KB Output is correct
9 Correct 73 ms 7148 KB Output is correct
10 Correct 71 ms 7276 KB Output is correct
11 Correct 50 ms 7276 KB Output is correct
12 Correct 49 ms 7404 KB Output is correct
13 Correct 47 ms 7148 KB Output is correct
14 Correct 46 ms 7276 KB Output is correct
15 Correct 71 ms 7148 KB Output is correct
16 Correct 45 ms 7148 KB Output is correct
17 Correct 45 ms 7532 KB Output is correct
18 Correct 74 ms 7276 KB Output is correct
19 Correct 72 ms 7148 KB Output is correct
20 Correct 46 ms 7276 KB Output is correct
21 Incorrect 41 ms 7276 KB Output isn't correct
22 Halted 0 ms 0 KB -