답안 #1093798

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1093798 2024-09-27T14:10:54 Z muhammad Feast (NOI19_feast) C++17
100 / 100
214 ms 10916 KB
#include <bits/stdc++.h>
using namespace std;

#define ll long long

int main() {
	int n, k;
	cin >> n >> k;

	int a[n];
	for (int &i : a) { cin >> i; }

	/**
	 * @return the maximum sum along with the number of subarrays used
	 * if creating a subarray penalizes the sum by "lmb" and
	 * there is no limit to the number of subarrays you can create
	 */
	auto solve_lambda = [&](ll lmb) {
		pair<ll, ll> dp[n][2];

		dp[0][0] = {0, 0};
		dp[0][1] = {a[0] - lmb, 1};

		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].first + a[i] - lmb, dp[i - 1][0].second + 1),
			        make_pair(dp[i - 1][1].first + a[i], dp[i - 1][1].second));
		}

		return max(dp[n - 1][0], dp[n - 1][1]);
	};

	ll lo = 0;
	ll hi = 1e18;
	while (lo < hi) {
		ll mid = (lo + hi + 1) / 2;
		solve_lambda(mid).second >= k ? lo = mid : hi = mid - 1;
	}

	cout << solve_lambda(lo).first + lo * k << endl;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 111 ms 10580 KB Output is correct
2 Correct 114 ms 10776 KB Output is correct
3 Correct 117 ms 10836 KB Output is correct
4 Correct 115 ms 10884 KB Output is correct
5 Correct 114 ms 10832 KB Output is correct
6 Correct 111 ms 10576 KB Output is correct
7 Correct 117 ms 10512 KB Output is correct
8 Correct 114 ms 10836 KB Output is correct
9 Correct 112 ms 10576 KB Output is correct
10 Correct 113 ms 10788 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 81 ms 10524 KB Output is correct
2 Correct 81 ms 10836 KB Output is correct
3 Correct 87 ms 10576 KB Output is correct
4 Correct 79 ms 10580 KB Output is correct
5 Correct 112 ms 10580 KB Output is correct
6 Correct 82 ms 10576 KB Output is correct
7 Correct 84 ms 10836 KB Output is correct
8 Correct 127 ms 10832 KB Output is correct
9 Correct 122 ms 10584 KB Output is correct
10 Correct 81 ms 10832 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 149 ms 10796 KB Output is correct
2 Correct 150 ms 10512 KB Output is correct
3 Correct 150 ms 10776 KB Output is correct
4 Correct 150 ms 10576 KB Output is correct
5 Correct 155 ms 10780 KB Output is correct
6 Correct 152 ms 10836 KB Output is correct
7 Correct 151 ms 10916 KB Output is correct
8 Correct 181 ms 10580 KB Output is correct
9 Correct 154 ms 10832 KB Output is correct
10 Correct 149 ms 10788 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 388 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 111 ms 10580 KB Output is correct
2 Correct 114 ms 10776 KB Output is correct
3 Correct 117 ms 10836 KB Output is correct
4 Correct 115 ms 10884 KB Output is correct
5 Correct 114 ms 10832 KB Output is correct
6 Correct 111 ms 10576 KB Output is correct
7 Correct 117 ms 10512 KB Output is correct
8 Correct 114 ms 10836 KB Output is correct
9 Correct 112 ms 10576 KB Output is correct
10 Correct 113 ms 10788 KB Output is correct
11 Correct 81 ms 10524 KB Output is correct
12 Correct 81 ms 10836 KB Output is correct
13 Correct 87 ms 10576 KB Output is correct
14 Correct 79 ms 10580 KB Output is correct
15 Correct 112 ms 10580 KB Output is correct
16 Correct 82 ms 10576 KB Output is correct
17 Correct 84 ms 10836 KB Output is correct
18 Correct 127 ms 10832 KB Output is correct
19 Correct 122 ms 10584 KB Output is correct
20 Correct 81 ms 10832 KB Output is correct
21 Correct 149 ms 10796 KB Output is correct
22 Correct 150 ms 10512 KB Output is correct
23 Correct 150 ms 10776 KB Output is correct
24 Correct 150 ms 10576 KB Output is correct
25 Correct 155 ms 10780 KB Output is correct
26 Correct 152 ms 10836 KB Output is correct
27 Correct 151 ms 10916 KB Output is correct
28 Correct 181 ms 10580 KB Output is correct
29 Correct 154 ms 10832 KB Output is correct
30 Correct 149 ms 10788 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 344 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 1 ms 344 KB Output is correct
52 Correct 1 ms 348 KB Output is correct
53 Correct 1 ms 348 KB Output is correct
54 Correct 1 ms 348 KB Output is correct
55 Correct 1 ms 468 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 1 ms 388 KB Output is correct
59 Correct 1 ms 344 KB Output is correct
60 Correct 1 ms 348 KB Output is correct
61 Correct 184 ms 10508 KB Output is correct
62 Correct 177 ms 10832 KB Output is correct
63 Correct 156 ms 10508 KB Output is correct
64 Correct 182 ms 10836 KB Output is correct
65 Correct 214 ms 10836 KB Output is correct
66 Correct 182 ms 10832 KB Output is correct
67 Correct 183 ms 10524 KB Output is correct
68 Correct 160 ms 10832 KB Output is correct
69 Correct 146 ms 10576 KB Output is correct
70 Correct 148 ms 10580 KB Output is correct