oj.uz

Submission #1017661

# Submission time Handle Problem Language Result Execution time Memory
1017661 2024-07-09T09:23:42 Z vjudge1 Feast (NOI19_feast) C++17
100 / 100
 83 ms 18308 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;
int dp[4 * MAXN]; // i * 0 + 0, i * 0 + 1, i * 0 * 2, i * 0 + 3

char buf[1 << 25 | 1], *p1, *p2;
#define gc() ((p1==p2)?(p2=(p1=buf)+fread(buf,1,1<<25,stdin),p1==p2?EOF:*p1++):*p1++)
//#define gc() getchar()
ll R(){
	int x = 0, f = 0;
	char c = gc();
	while (!isdigit(c)){
		if (c == '-') f = 1;
		c = gc();
	}
	while (isdigit(c)){
		x = x * 10 + (c ^ 48);
		c = gc();
	}
	return f ? -x : x;
}

pii solve(ll lampda){
	dp[0 * 4 + 0] = 0;
	dp[0 * 4 + 1] = 0;
	dp[0 * 4 + 2] = -lampda;
	dp[0 * 4 + 3] = 1;
	for (int i = 1; i <= n; i++){
		dp[i * 4 + 0] = max(dp[(i - 1) * 4 + 0], dp[(i - 1) * 4 + 2]);
		dp[i * 4 + 1] = (dp[(i - 1) * 4 + 0] > dp[(i - 1) * 4 + 2] ? dp[(i - 1) * 4 + 1] : dp[(i - 1) * 4 + 3]);
		dp[i * 4 + 2] = max(dp[(i - 1) * 4 + 0] + a[i] - lampda, dp[(i - 1) * 4 + 2] + a[i]);
		dp[i * 4 + 3] = (dp[(i - 1) * 4 + 0] + a[i] - lampda > dp[(i - 1) * 4 + 2] + a[i] ? dp[(i - 1) * 4 + 1] + 1 : dp[(i - 1) * 4 + 3]);

		//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(pii(dp[n * 4 + 0], dp[n * 4 + 1]), pii(dp[n * 4 + 2], dp[n * 4 + 3]));
}

int32_t main(){
	n = R(), k = R();
	//cin >> n >> k;
	for (int i = 1; i <= n; i++){
		a[i] = R();
		//cin >> a[i];
	}
	ll lo = 0, hi = 1e14;
	while (hi - lo > 1){
		ll mi = (lo + hi) >> 1;
		if (solve(mi).S >= 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 29 ms 18276 KB Output is correct
2 Correct 30 ms 18268 KB Output is correct
3 Correct 37 ms 18308 KB Output is correct
4 Correct 30 ms 18268 KB Output is correct
5 Correct 51 ms 18268 KB Output is correct
6 Correct 29 ms 18012 KB Output is correct
7 Correct 32 ms 18268 KB Output is correct
8 Correct 30 ms 18308 KB Output is correct
9 Correct 30 ms 18264 KB Output is correct
10 Correct 42 ms 18268 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 15960 KB Output is correct
2 Correct 29 ms 16220 KB Output is correct
3 Correct 28 ms 16216 KB Output is correct
4 Correct 28 ms 16008 KB Output is correct
5 Correct 30 ms 18268 KB Output is correct
6 Correct 27 ms 16220 KB Output is correct
7 Correct 28 ms 16256 KB Output is correct
8 Correct 55 ms 18268 KB Output is correct
9 Correct 45 ms 18260 KB Output is correct
10 Correct 33 ms 16216 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 18264 KB Output is correct
2 Correct 46 ms 18264 KB Output is correct
3 Correct 47 ms 18264 KB Output is correct
4 Correct 48 ms 18268 KB Output is correct
5 Correct 46 ms 18268 KB Output is correct
6 Correct 46 ms 18292 KB Output is correct
7 Correct 49 ms 18268 KB Output is correct
8 Correct 45 ms 18268 KB Output is correct
9 Correct 46 ms 18264 KB Output is correct
10 Correct 46 ms 18268 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 0 ms 4444 KB Output is correct
7 Correct 0 ms 4444 KB Output is correct
8 Correct 1 ms 4440 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 0 ms 4444 KB Output is correct
7 Correct 0 ms 4444 KB Output is correct
8 Correct 1 ms 4440 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4440 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4440 KB Output is correct
19 Correct 1 ms 4440 KB Output is correct
20 Correct 0 ms 4444 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 0 ms 4444 KB Output is correct
7 Correct 0 ms 4444 KB Output is correct
8 Correct 1 ms 4440 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4440 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4440 KB Output is correct
19 Correct 1 ms 4440 KB Output is correct
20 Correct 0 ms 4444 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 1 ms 4444 KB Output is correct
25 Correct 1 ms 4444 KB Output is correct
26 Correct 1 ms 4444 KB Output is correct
27 Correct 1 ms 4444 KB Output is correct
28 Correct 1 ms 4696 KB Output is correct
29 Correct 1 ms 4444 KB Output is correct
30 Correct 1 ms 4564 KB Output is correct

Subtask #7
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 18276 KB Output is correct
2 Correct 30 ms 18268 KB Output is correct
3 Correct 37 ms 18308 KB Output is correct
4 Correct 30 ms 18268 KB Output is correct
5 Correct 51 ms 18268 KB Output is correct
6 Correct 29 ms 18012 KB Output is correct
7 Correct 32 ms 18268 KB Output is correct
8 Correct 30 ms 18308 KB Output is correct
9 Correct 30 ms 18264 KB Output is correct
10 Correct 42 ms 18268 KB Output is correct
11 Correct 28 ms 15960 KB Output is correct
12 Correct 29 ms 16220 KB Output is correct
13 Correct 28 ms 16216 KB Output is correct
14 Correct 28 ms 16008 KB Output is correct
15 Correct 30 ms 18268 KB Output is correct
16 Correct 27 ms 16220 KB Output is correct
17 Correct 28 ms 16256 KB Output is correct
18 Correct 55 ms 18268 KB Output is correct
19 Correct 45 ms 18260 KB Output is correct
20 Correct 33 ms 16216 KB Output is correct
21 Correct 47 ms 18264 KB Output is correct
22 Correct 46 ms 18264 KB Output is correct
23 Correct 47 ms 18264 KB Output is correct
24 Correct 48 ms 18268 KB Output is correct
25 Correct 46 ms 18268 KB Output is correct
26 Correct 46 ms 18292 KB Output is correct
27 Correct 49 ms 18268 KB Output is correct
28 Correct 45 ms 18268 KB Output is correct
29 Correct 46 ms 18264 KB Output is correct
30 Correct 46 ms 18268 KB Output is correct
31 Correct 1 ms 4444 KB Output is correct
32 Correct 1 ms 4444 KB Output is correct
33 Correct 1 ms 4444 KB Output is correct
34 Correct 1 ms 4444 KB Output is correct
35 Correct 1 ms 4444 KB Output is correct
36 Correct 0 ms 4444 KB Output is correct
37 Correct 0 ms 4444 KB Output is correct
38 Correct 1 ms 4440 KB Output is correct
39 Correct 1 ms 4444 KB Output is correct
40 Correct 1 ms 4444 KB Output is correct
41 Correct 1 ms 4440 KB Output is correct
42 Correct 1 ms 4444 KB Output is correct
43 Correct 1 ms 4444 KB Output is correct
44 Correct 1 ms 4444 KB Output is correct
45 Correct 1 ms 4444 KB Output is correct
46 Correct 1 ms 4444 KB Output is correct
47 Correct 1 ms 4444 KB Output is correct
48 Correct 1 ms 4440 KB Output is correct
49 Correct 1 ms 4440 KB Output is correct
50 Correct 0 ms 4444 KB Output is correct
51 Correct 1 ms 4444 KB Output is correct
52 Correct 1 ms 4444 KB Output is correct
53 Correct 1 ms 4444 KB Output is correct
54 Correct 1 ms 4444 KB Output is correct
55 Correct 1 ms 4444 KB Output is correct
56 Correct 1 ms 4444 KB Output is correct
57 Correct 1 ms 4444 KB Output is correct
58 Correct 1 ms 4696 KB Output is correct
59 Correct 1 ms 4444 KB Output is correct
60 Correct 1 ms 4564 KB Output is correct
61 Correct 82 ms 18268 KB Output is correct
62 Correct 72 ms 18264 KB Output is correct
63 Correct 63 ms 18012 KB Output is correct
64 Correct 83 ms 18292 KB Output is correct
65 Correct 79 ms 18268 KB Output is correct
66 Correct 80 ms 18268 KB Output is correct
67 Correct 83 ms 18264 KB Output is correct
68 Correct 48 ms 18264 KB Output is correct
69 Correct 49 ms 18008 KB Output is correct
70 Correct 58 ms 18012 KB Output is correct