oj.uz

Submission #1017569

# Submission time Handle Problem Language Result Execution time Memory
1017569 2024-07-09T08:54:32 Z vjudge1 Feast (NOI19_feast) C++17
12 / 100
 93 ms 12200 KB 
#include<bits/stdc++.h>
using namespace std;
#ifdef ONPC
#include"debug.h"
#else
#define debug(...) 42
#endif
#define endl '\n'
#define ll long long
#define pii pair<int,int>
#define F first
#define S second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
#define int long long
template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
const int mod = 1e9 + 7;
const int MAXN = 3e5 + 15;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
int a[MAXN], n, k;
pair<ll, int> dp[MAXN][2];
pii solve(ll lampda){
	dp[0][1] = {-lampda, 1};
	dp[0][0] = {0, 0};
	for (int i = 1; i <= n; i++){
		dp[i][0] = max(dp[i - 1][0], dp[i - 1][1]);
		dp[i][1] = max(make_pair(dp[i - 1][0].F + a[i] - lampda, dp[i - 1][0].S + 1), 
				make_pair(dp[i - 1][1].F + a[i], dp[i - 1][1].S));
	}
	return max(dp[n][0], dp[n][1]);
}

int32_t main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> k;
	for (int i = 1; i <= n; i++){
		cin >> a[i];
	}
	ll lo = 0, hi = 1e9;
	while (hi - lo > 1){
		ll mi = (lo + hi) >> 1;
		if (solve(mi).second >= k){
			lo = mi;
		} else {
			hi = mi;
		}
	}
	cout << solve(lo).F + k * lo;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 11868 KB Output is correct
2 Correct 43 ms 12144 KB Output is correct
3 Correct 36 ms 12124 KB Output is correct
4 Correct 38 ms 12164 KB Output is correct
5 Correct 51 ms 12088 KB Output is correct
6 Correct 38 ms 12112 KB Output is correct
7 Correct 36 ms 12124 KB Output is correct
8 Correct 41 ms 12124 KB Output is correct
9 Correct 43 ms 12108 KB Output is correct
10 Correct 35 ms 11988 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 12032 KB Output is correct
2 Correct 40 ms 12168 KB Output is correct
3 Correct 36 ms 12144 KB Output is correct
4 Correct 34 ms 12132 KB Output is correct
5 Correct 56 ms 12036 KB Output is correct
6 Correct 31 ms 12128 KB Output is correct
7 Correct 28 ms 12200 KB Output is correct
8 Correct 41 ms 12168 KB Output is correct
9 Correct 43 ms 12092 KB Output is correct
10 Correct 30 ms 12028 KB Output is correct

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 93 ms 12128 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 2408 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 2408 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 2408 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 11868 KB Output is correct
2 Correct 43 ms 12144 KB Output is correct
3 Correct 36 ms 12124 KB Output is correct
4 Correct 38 ms 12164 KB Output is correct
5 Correct 51 ms 12088 KB Output is correct
6 Correct 38 ms 12112 KB Output is correct
7 Correct 36 ms 12124 KB Output is correct
8 Correct 41 ms 12124 KB Output is correct
9 Correct 43 ms 12108 KB Output is correct
10 Correct 35 ms 11988 KB Output is correct
11 Correct 34 ms 12032 KB Output is correct
12 Correct 40 ms 12168 KB Output is correct
13 Correct 36 ms 12144 KB Output is correct
14 Correct 34 ms 12132 KB Output is correct
15 Correct 56 ms 12036 KB Output is correct
16 Correct 31 ms 12128 KB Output is correct
17 Correct 28 ms 12200 KB Output is correct
18 Correct 41 ms 12168 KB Output is correct
19 Correct 43 ms 12092 KB Output is correct
20 Correct 30 ms 12028 KB Output is correct
21 Incorrect 93 ms 12128 KB Output isn't correct
22 Halted 0 ms 0 KB -