Submission #1017662

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1017662	2024-07-09T09:24:08 Z	vjudge1	Feast (NOI19_feast)	C++17	53 / 100	40 ms	18316 KB

feast

#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 = 1e10;
	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	31 ms	18008 KB	Output is correct
2	Correct	28 ms	18268 KB	Output is correct
3	Correct	37 ms	18264 KB	Output is correct
4	Correct	23 ms	18316 KB	Output is correct
5	Correct	23 ms	18268 KB	Output is correct
6	Correct	23 ms	18012 KB	Output is correct
7	Correct	22 ms	18012 KB	Output is correct
8	Correct	23 ms	18268 KB	Output is correct
9	Correct	23 ms	18268 KB	Output is correct
10	Correct	25 ms	18268 KB	Output is correct

Subtask #2
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	22 ms	16220 KB	Output is correct
2	Correct	21 ms	16276 KB	Output is correct
3	Correct	21 ms	15960 KB	Output is correct
4	Correct	21 ms	16216 KB	Output is correct
5	Correct	24 ms	18264 KB	Output is correct
6	Correct	22 ms	16220 KB	Output is correct
7	Correct	22 ms	16220 KB	Output is correct
8	Correct	32 ms	18268 KB	Output is correct
9	Correct	23 ms	18008 KB	Output is correct
10	Correct	21 ms	16220 KB	Output is correct

Subtask #3
0 / 18.0

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

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	0 ms	4444 KB	Output is correct
4	Correct	1 ms	4440 KB	Output is correct
5	Correct	1 ms	4444 KB	Output is correct
6	Correct	1 ms	4444 KB	Output is correct
7	Correct	1 ms	4444 KB	Output is correct
8	Correct	1 ms	4444 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	0 ms	4444 KB	Output is correct
4	Correct	1 ms	4440 KB	Output is correct
5	Correct	1 ms	4444 KB	Output is correct
6	Correct	1 ms	4444 KB	Output is correct
7	Correct	1 ms	4444 KB	Output is correct
8	Correct	1 ms	4444 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	4444 KB	Output is correct
12	Correct	1 ms	4444 KB	Output is correct
13	Correct	1 ms	4440 KB	Output is correct
14	Correct	1 ms	4444 KB	Output is correct
15	Correct	1 ms	4440 KB	Output is correct
16	Correct	1 ms	4440 KB	Output is correct
17	Correct	1 ms	4444 KB	Output is correct
18	Correct	1 ms	4444 KB	Output is correct
19	Correct	1 ms	4444 KB	Output is correct
20	Correct	1 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	0 ms	4444 KB	Output is correct
4	Correct	1 ms	4440 KB	Output is correct
5	Correct	1 ms	4444 KB	Output is correct
6	Correct	1 ms	4444 KB	Output is correct
7	Correct	1 ms	4444 KB	Output is correct
8	Correct	1 ms	4444 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	4444 KB	Output is correct
12	Correct	1 ms	4444 KB	Output is correct
13	Correct	1 ms	4440 KB	Output is correct
14	Correct	1 ms	4444 KB	Output is correct
15	Correct	1 ms	4440 KB	Output is correct
16	Correct	1 ms	4440 KB	Output is correct
17	Correct	1 ms	4444 KB	Output is correct
18	Correct	1 ms	4444 KB	Output is correct
19	Correct	1 ms	4444 KB	Output is correct
20	Correct	1 ms	4444 KB	Output is correct
21	Correct	1 ms	4440 KB	Output is correct
22	Correct	1 ms	4440 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	4444 KB	Output is correct
29	Correct	1 ms	4444 KB	Output is correct
30	Correct	1 ms	4444 KB	Output is correct

Subtask #7
0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	31 ms	18008 KB	Output is correct
2	Correct	28 ms	18268 KB	Output is correct
3	Correct	37 ms	18264 KB	Output is correct
4	Correct	23 ms	18316 KB	Output is correct
5	Correct	23 ms	18268 KB	Output is correct
6	Correct	23 ms	18012 KB	Output is correct
7	Correct	22 ms	18012 KB	Output is correct
8	Correct	23 ms	18268 KB	Output is correct
9	Correct	23 ms	18268 KB	Output is correct
10	Correct	25 ms	18268 KB	Output is correct
11	Correct	22 ms	16220 KB	Output is correct
12	Correct	21 ms	16276 KB	Output is correct
13	Correct	21 ms	15960 KB	Output is correct
14	Correct	21 ms	16216 KB	Output is correct
15	Correct	24 ms	18264 KB	Output is correct
16	Correct	22 ms	16220 KB	Output is correct
17	Correct	22 ms	16220 KB	Output is correct
18	Correct	32 ms	18268 KB	Output is correct
19	Correct	23 ms	18008 KB	Output is correct
20	Correct	21 ms	16220 KB	Output is correct
21	Incorrect	40 ms	18268 KB	Output isn't correct
22	Halted	0 ms	0 KB	-

Submission #1017662

Compilation message

Subtask #1 4.0 / 4.0

Subtask #2 8.0 / 8.0

Subtask #3 0 / 18.0

Subtask #4 10.0 / 10.0

Subtask #5 11.0 / 11.0

Subtask #6 20.0 / 20.0

Subtask #7 0 / 29.0

Subtask #1
4.0 / 4.0

Subtask #2
8.0 / 8.0

Subtask #3
0 / 18.0

Subtask #4
10.0 / 10.0

Subtask #5
11.0 / 11.0

Subtask #6
20.0 / 20.0

Subtask #7
0 / 29.0