답안 #1093797

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1093797 2024-09-27T14:10:02 Z muhammad Feast (NOI19_feast) C++17
100 / 100
175 ms 13972 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 = solve_lambda(0).first;
	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 105 ms 13400 KB Output is correct
2 Correct 109 ms 13648 KB Output is correct
3 Correct 111 ms 13652 KB Output is correct
4 Correct 110 ms 13712 KB Output is correct
5 Correct 107 ms 13648 KB Output is correct
6 Correct 105 ms 13392 KB Output is correct
7 Correct 107 ms 13396 KB Output is correct
8 Correct 109 ms 13652 KB Output is correct
9 Correct 146 ms 13396 KB Output is correct
10 Correct 107 ms 13396 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 68 ms 11832 KB Output is correct
2 Correct 61 ms 12072 KB Output is correct
3 Correct 62 ms 11788 KB Output is correct
4 Correct 60 ms 11860 KB Output is correct
5 Correct 106 ms 13308 KB Output is correct
6 Correct 59 ms 11660 KB Output is correct
7 Correct 61 ms 12112 KB Output is correct
8 Correct 107 ms 13648 KB Output is correct
9 Correct 107 ms 13396 KB Output is correct
10 Correct 61 ms 12116 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 143 ms 13728 KB Output is correct
2 Correct 134 ms 13652 KB Output is correct
3 Correct 138 ms 13652 KB Output is correct
4 Correct 136 ms 13652 KB Output is correct
5 Correct 134 ms 13652 KB Output is correct
6 Correct 133 ms 13904 KB Output is correct
7 Correct 135 ms 13904 KB Output is correct
8 Correct 135 ms 13648 KB Output is correct
9 Correct 140 ms 13844 KB Output is correct
10 Correct 134 ms 13972 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 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 348 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 360 KB Output is correct
12 Correct 1 ms 344 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 348 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 360 KB Output is correct
12 Correct 1 ms 344 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 348 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 444 KB Output is correct
25 Correct 1 ms 348 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 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 105 ms 13400 KB Output is correct
2 Correct 109 ms 13648 KB Output is correct
3 Correct 111 ms 13652 KB Output is correct
4 Correct 110 ms 13712 KB Output is correct
5 Correct 107 ms 13648 KB Output is correct
6 Correct 105 ms 13392 KB Output is correct
7 Correct 107 ms 13396 KB Output is correct
8 Correct 109 ms 13652 KB Output is correct
9 Correct 146 ms 13396 KB Output is correct
10 Correct 107 ms 13396 KB Output is correct
11 Correct 68 ms 11832 KB Output is correct
12 Correct 61 ms 12072 KB Output is correct
13 Correct 62 ms 11788 KB Output is correct
14 Correct 60 ms 11860 KB Output is correct
15 Correct 106 ms 13308 KB Output is correct
16 Correct 59 ms 11660 KB Output is correct
17 Correct 61 ms 12112 KB Output is correct
18 Correct 107 ms 13648 KB Output is correct
19 Correct 107 ms 13396 KB Output is correct
20 Correct 61 ms 12116 KB Output is correct
21 Correct 143 ms 13728 KB Output is correct
22 Correct 134 ms 13652 KB Output is correct
23 Correct 138 ms 13652 KB Output is correct
24 Correct 136 ms 13652 KB Output is correct
25 Correct 134 ms 13652 KB Output is correct
26 Correct 133 ms 13904 KB Output is correct
27 Correct 135 ms 13904 KB Output is correct
28 Correct 135 ms 13648 KB Output is correct
29 Correct 140 ms 13844 KB Output is correct
30 Correct 134 ms 13972 KB Output is correct
31 Correct 0 ms 348 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 360 KB Output is correct
42 Correct 1 ms 344 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 348 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 444 KB Output is correct
55 Correct 1 ms 348 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 348 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 1 ms 348 KB Output is correct
61 Correct 173 ms 13456 KB Output is correct
62 Correct 165 ms 13908 KB Output is correct
63 Correct 146 ms 13436 KB Output is correct
64 Correct 175 ms 13904 KB Output is correct
65 Correct 171 ms 13904 KB Output is correct
66 Correct 170 ms 13836 KB Output is correct
67 Correct 172 ms 13432 KB Output is correct
68 Correct 140 ms 13712 KB Output is correct
69 Correct 134 ms 13560 KB Output is correct
70 Correct 140 ms 13392 KB Output is correct