답안 #1107095

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1107095 2024-10-31T16:08:23 Z vnedu Feast (NOI19_feast) C++11
100 / 100
206 ms 10836 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 * solve_lambda(lo).second << endl;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 122 ms 10568 KB Output is correct
2 Correct 124 ms 10824 KB Output is correct
3 Correct 126 ms 10828 KB Output is correct
4 Correct 125 ms 10824 KB Output is correct
5 Correct 125 ms 10804 KB Output is correct
6 Correct 118 ms 10516 KB Output is correct
7 Correct 125 ms 10568 KB Output is correct
8 Correct 142 ms 10828 KB Output is correct
9 Correct 123 ms 10568 KB Output is correct
10 Correct 135 ms 10796 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 87 ms 10568 KB Output is correct
2 Correct 92 ms 10812 KB Output is correct
3 Correct 86 ms 10568 KB Output is correct
4 Correct 85 ms 10800 KB Output is correct
5 Correct 117 ms 10568 KB Output is correct
6 Correct 85 ms 10568 KB Output is correct
7 Correct 92 ms 10828 KB Output is correct
8 Correct 120 ms 10804 KB Output is correct
9 Correct 116 ms 10520 KB Output is correct
10 Correct 89 ms 10804 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 152 ms 10796 KB Output is correct
2 Correct 151 ms 10568 KB Output is correct
3 Correct 151 ms 10828 KB Output is correct
4 Correct 156 ms 10568 KB Output is correct
5 Correct 159 ms 10828 KB Output is correct
6 Correct 154 ms 10824 KB Output is correct
7 Correct 152 ms 10804 KB Output is correct
8 Correct 158 ms 10796 KB Output is correct
9 Correct 160 ms 10824 KB Output is correct
10 Correct 157 ms 10824 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 592 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 564 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 592 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 564 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 2 ms 336 KB Output is correct
22 Correct 2 ms 336 KB Output is correct
23 Correct 2 ms 336 KB Output is correct
24 Correct 2 ms 336 KB Output is correct
25 Correct 3 ms 336 KB Output is correct
26 Correct 2 ms 336 KB Output is correct
27 Correct 2 ms 336 KB Output is correct
28 Correct 2 ms 336 KB Output is correct
29 Correct 2 ms 336 KB Output is correct
30 Correct 2 ms 336 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 122 ms 10568 KB Output is correct
2 Correct 124 ms 10824 KB Output is correct
3 Correct 126 ms 10828 KB Output is correct
4 Correct 125 ms 10824 KB Output is correct
5 Correct 125 ms 10804 KB Output is correct
6 Correct 118 ms 10516 KB Output is correct
7 Correct 125 ms 10568 KB Output is correct
8 Correct 142 ms 10828 KB Output is correct
9 Correct 123 ms 10568 KB Output is correct
10 Correct 135 ms 10796 KB Output is correct
11 Correct 87 ms 10568 KB Output is correct
12 Correct 92 ms 10812 KB Output is correct
13 Correct 86 ms 10568 KB Output is correct
14 Correct 85 ms 10800 KB Output is correct
15 Correct 117 ms 10568 KB Output is correct
16 Correct 85 ms 10568 KB Output is correct
17 Correct 92 ms 10828 KB Output is correct
18 Correct 120 ms 10804 KB Output is correct
19 Correct 116 ms 10520 KB Output is correct
20 Correct 89 ms 10804 KB Output is correct
21 Correct 152 ms 10796 KB Output is correct
22 Correct 151 ms 10568 KB Output is correct
23 Correct 151 ms 10828 KB Output is correct
24 Correct 156 ms 10568 KB Output is correct
25 Correct 159 ms 10828 KB Output is correct
26 Correct 154 ms 10824 KB Output is correct
27 Correct 152 ms 10804 KB Output is correct
28 Correct 158 ms 10796 KB Output is correct
29 Correct 160 ms 10824 KB Output is correct
30 Correct 157 ms 10824 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 336 KB Output is correct
36 Correct 1 ms 336 KB Output is correct
37 Correct 1 ms 336 KB Output is correct
38 Correct 1 ms 336 KB Output is correct
39 Correct 1 ms 336 KB Output is correct
40 Correct 1 ms 336 KB Output is correct
41 Correct 1 ms 336 KB Output is correct
42 Correct 1 ms 336 KB Output is correct
43 Correct 1 ms 592 KB Output is correct
44 Correct 1 ms 336 KB Output is correct
45 Correct 1 ms 564 KB Output is correct
46 Correct 1 ms 336 KB Output is correct
47 Correct 1 ms 336 KB Output is correct
48 Correct 1 ms 336 KB Output is correct
49 Correct 1 ms 336 KB Output is correct
50 Correct 1 ms 336 KB Output is correct
51 Correct 2 ms 336 KB Output is correct
52 Correct 2 ms 336 KB Output is correct
53 Correct 2 ms 336 KB Output is correct
54 Correct 2 ms 336 KB Output is correct
55 Correct 3 ms 336 KB Output is correct
56 Correct 2 ms 336 KB Output is correct
57 Correct 2 ms 336 KB Output is correct
58 Correct 2 ms 336 KB Output is correct
59 Correct 2 ms 336 KB Output is correct
60 Correct 2 ms 336 KB Output is correct
61 Correct 193 ms 10568 KB Output is correct
62 Correct 194 ms 10836 KB Output is correct
63 Correct 170 ms 10528 KB Output is correct
64 Correct 203 ms 10824 KB Output is correct
65 Correct 197 ms 10824 KB Output is correct
66 Correct 206 ms 10792 KB Output is correct
67 Correct 194 ms 10576 KB Output is correct
68 Correct 157 ms 10824 KB Output is correct
69 Correct 177 ms 10568 KB Output is correct
70 Correct 150 ms 10568 KB Output is correct