oj.uz

Submission #604269

# Submission time Handle Problem Language Result Execution time Memory
604269 2022-07-25T02:27:02 Z super_j6 Feast (NOI19_feast) C++14
12 / 100
 90 ms 10200 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 = 0x3f3f3f3f;
	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 + k * r) << endl;
 
	return 0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 7116 KB Output is correct
2 Correct 50 ms 10068 KB Output is correct
3 Correct 44 ms 10200 KB Output is correct
4 Correct 49 ms 10196 KB Output is correct
5 Correct 50 ms 10064 KB Output is correct
6 Correct 49 ms 9888 KB Output is correct
7 Correct 47 ms 9936 KB Output is correct
8 Correct 44 ms 10120 KB Output is correct
9 Correct 44 ms 9840 KB Output is correct
10 Correct 62 ms 10052 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 7072 KB Output is correct
2 Correct 42 ms 7216 KB Output is correct
3 Correct 40 ms 7168 KB Output is correct
4 Correct 36 ms 7236 KB Output is correct
5 Correct 49 ms 9944 KB Output is correct
6 Correct 37 ms 8284 KB Output is correct
7 Correct 40 ms 8404 KB Output is correct
8 Correct 45 ms 10176 KB Output is correct
9 Correct 45 ms 9788 KB Output is correct
10 Correct 36 ms 8504 KB Output is correct

Subtask #3
0 / 18.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 11.0

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

Subtask #6
0 / 20.0

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

Subtask #7
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 7116 KB Output is correct
2 Correct 50 ms 10068 KB Output is correct
3 Correct 44 ms 10200 KB Output is correct
4 Correct 49 ms 10196 KB Output is correct
5 Correct 50 ms 10064 KB Output is correct
6 Correct 49 ms 9888 KB Output is correct
7 Correct 47 ms 9936 KB Output is correct
8 Correct 44 ms 10120 KB Output is correct
9 Correct 44 ms 9840 KB Output is correct
10 Correct 62 ms 10052 KB Output is correct
11 Correct 50 ms 7072 KB Output is correct
12 Correct 42 ms 7216 KB Output is correct
13 Correct 40 ms 7168 KB Output is correct
14 Correct 36 ms 7236 KB Output is correct
15 Correct 49 ms 9944 KB Output is correct
16 Correct 37 ms 8284 KB Output is correct
17 Correct 40 ms 8404 KB Output is correct
18 Correct 45 ms 10176 KB Output is correct
19 Correct 45 ms 9788 KB Output is correct
20 Correct 36 ms 8504 KB Output is correct
21 Incorrect 90 ms 7252 KB Output isn't correct
22 Halted 0 ms 0 KB -