Submission #401993

# Submission time Handle Problem Language Result Execution time Memory
401993 2021-05-11T06:42:42 Z ronnith Feast (NOI19_feast) C++14
100 / 100
202 ms 11516 KB
#include <bits/stdc++.h>

using namespace std;

const int N = (int)3e5, K = (int)3e5;
int n, k;
int a[N];
int64_t dp[N][2];
int cnt[N][2];

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);

	cin >> n >> k;
	for (int i = 0;i < n;i ++)
		cin >> a[i];

	auto check = [&](int64_t penalty) -> pair<int, int64_t> {
		for (int i = 0;i < n;i ++) {
			for (int pr = 0;pr < 2;pr ++) {
				dp[i][pr] = LLONG_MIN;
				cnt[i][pr] = INT_MAX;
			}
		}

		if (0 >= a[0] - penalty) {
			dp[0][0] = 0;
			cnt[0][0] = 0;
		} else {
			dp[0][0] = a[0] - penalty;
			cnt[0][0] = 1;
		}

		dp[0][1] = a[0] - penalty;
		cnt[0][1] = 1;
		for (int i = 1;i < n;i ++) {
			if (dp[i - 1][0] + a[i] - penalty > dp[i][0] || (dp[i - 1][0] + a[i] - penalty == dp[i][0] && cnt[i - 1][0] + 1 < cnt[i][0])) {
				dp[i][0] = dp[i - 1][0] + a[i] - penalty;
				cnt[i][0] = cnt[i - 1][0] + 1;
			}

			if (dp[i - 1][0] > dp[i][0] || (dp[i - 1][0] == dp[i][0] && cnt[i - 1][0] < cnt[i][0])) {
				dp[i][0] = dp[i - 1][0];
				cnt[i][0] = cnt[i - 1][0];
			}

			if (dp[i - 1][1] + a[i] > dp[i][0] || (dp[i - 1][1] + a[i] == dp[i][0] && cnt[i - 1][1] < cnt[i][0])) {
				dp[i][0] = dp[i - 1][1] + a[i];
				cnt[i][0] = cnt[i - 1][1];
			}

			if (dp[i - 1][1] + a[i] > dp[i][1] || (dp[i - 1][1] + a[i] == dp[i][1] && cnt[i - 1][1] < cnt[i][1])) {
				dp[i][1] = dp[i - 1][1] + a[i];
				cnt[i][1] = cnt[i - 1][1];
			}

			if (dp[i - 1][0] + a[i] - penalty > dp[i][1] || (dp[i - 1][0] + a[i] - penalty == dp[i][1] && cnt[i - 1][0] + 1 < cnt[i][1])) {
				dp[i][1] = dp[i - 1][0] + a[i] - penalty;
				cnt[i][1] = cnt[i - 1][0] + 1;
			}
		}

		return {cnt[n - 1][0], dp[n - 1][0]};
	};

	int64_t lx = 0, rx = (int64_t)1e15;

	while (lx < rx) {
		int64_t g = lx + (rx - lx) / 2;
		if (check(g).first <= k)
			rx = g;
		else
			lx = g + 1;
	}


	pair<int, int64_t> res = check(lx);
	int64_t ans = res.second + (k - res.first) * lx + lx * k;

	cout << ans << '\n';

	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 141 ms 8260 KB Output is correct
2 Correct 137 ms 11248 KB Output is correct
3 Correct 160 ms 11472 KB Output is correct
4 Correct 142 ms 11316 KB Output is correct
5 Correct 143 ms 11228 KB Output is correct
6 Correct 138 ms 11076 KB Output is correct
7 Correct 135 ms 11072 KB Output is correct
8 Correct 149 ms 11296 KB Output is correct
9 Correct 136 ms 11092 KB Output is correct
10 Correct 136 ms 11180 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 115 ms 8216 KB Output is correct
2 Correct 122 ms 9640 KB Output is correct
3 Correct 123 ms 9320 KB Output is correct
4 Correct 128 ms 9508 KB Output is correct
5 Correct 151 ms 11180 KB Output is correct
6 Correct 121 ms 9420 KB Output is correct
7 Correct 126 ms 9548 KB Output is correct
8 Correct 150 ms 10732 KB Output is correct
9 Correct 141 ms 10436 KB Output is correct
10 Correct 125 ms 9588 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 167 ms 8424 KB Output is correct
2 Correct 149 ms 11308 KB Output is correct
3 Correct 160 ms 11500 KB Output is correct
4 Correct 151 ms 11316 KB Output is correct
5 Correct 149 ms 11300 KB Output is correct
6 Correct 152 ms 11484 KB Output is correct
7 Correct 157 ms 11480 KB Output is correct
8 Correct 149 ms 11380 KB Output is correct
9 Correct 167 ms 11464 KB Output is correct
10 Correct 151 ms 11456 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 2 ms 332 KB Output is correct
22 Correct 2 ms 332 KB Output is correct
23 Correct 2 ms 332 KB Output is correct
24 Correct 2 ms 332 KB Output is correct
25 Correct 2 ms 332 KB Output is correct
26 Correct 2 ms 332 KB Output is correct
27 Correct 2 ms 332 KB Output is correct
28 Correct 2 ms 332 KB Output is correct
29 Correct 2 ms 332 KB Output is correct
30 Correct 2 ms 332 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 141 ms 8260 KB Output is correct
2 Correct 137 ms 11248 KB Output is correct
3 Correct 160 ms 11472 KB Output is correct
4 Correct 142 ms 11316 KB Output is correct
5 Correct 143 ms 11228 KB Output is correct
6 Correct 138 ms 11076 KB Output is correct
7 Correct 135 ms 11072 KB Output is correct
8 Correct 149 ms 11296 KB Output is correct
9 Correct 136 ms 11092 KB Output is correct
10 Correct 136 ms 11180 KB Output is correct
11 Correct 115 ms 8216 KB Output is correct
12 Correct 122 ms 9640 KB Output is correct
13 Correct 123 ms 9320 KB Output is correct
14 Correct 128 ms 9508 KB Output is correct
15 Correct 151 ms 11180 KB Output is correct
16 Correct 121 ms 9420 KB Output is correct
17 Correct 126 ms 9548 KB Output is correct
18 Correct 150 ms 10732 KB Output is correct
19 Correct 141 ms 10436 KB Output is correct
20 Correct 125 ms 9588 KB Output is correct
21 Correct 167 ms 8424 KB Output is correct
22 Correct 149 ms 11308 KB Output is correct
23 Correct 160 ms 11500 KB Output is correct
24 Correct 151 ms 11316 KB Output is correct
25 Correct 149 ms 11300 KB Output is correct
26 Correct 152 ms 11484 KB Output is correct
27 Correct 157 ms 11480 KB Output is correct
28 Correct 149 ms 11380 KB Output is correct
29 Correct 167 ms 11464 KB Output is correct
30 Correct 151 ms 11456 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 1 ms 204 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 1 ms 332 KB Output is correct
43 Correct 1 ms 332 KB Output is correct
44 Correct 1 ms 332 KB Output is correct
45 Correct 1 ms 332 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 1 ms 332 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 1 ms 332 KB Output is correct
50 Correct 1 ms 332 KB Output is correct
51 Correct 2 ms 332 KB Output is correct
52 Correct 2 ms 332 KB Output is correct
53 Correct 2 ms 332 KB Output is correct
54 Correct 2 ms 332 KB Output is correct
55 Correct 2 ms 332 KB Output is correct
56 Correct 2 ms 332 KB Output is correct
57 Correct 2 ms 332 KB Output is correct
58 Correct 2 ms 332 KB Output is correct
59 Correct 2 ms 332 KB Output is correct
60 Correct 2 ms 332 KB Output is correct
61 Correct 198 ms 11212 KB Output is correct
62 Correct 195 ms 11460 KB Output is correct
63 Correct 167 ms 11188 KB Output is correct
64 Correct 201 ms 11488 KB Output is correct
65 Correct 202 ms 11476 KB Output is correct
66 Correct 191 ms 11460 KB Output is correct
67 Correct 192 ms 11516 KB Output is correct
68 Correct 154 ms 11460 KB Output is correct
69 Correct 149 ms 11280 KB Output is correct
70 Correct 148 ms 11332 KB Output is correct