답안 #1107094

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1107094 2024-10-31T16:07:40 Z vnedu Feast (NOI19_feast) C++11
100 / 100
192 ms 14008 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 120 ms 11592 KB Output is correct
2 Correct 140 ms 12616 KB Output is correct
3 Correct 147 ms 12616 KB Output is correct
4 Correct 125 ms 12872 KB Output is correct
5 Correct 120 ms 13300 KB Output is correct
6 Correct 179 ms 13244 KB Output is correct
7 Correct 117 ms 13180 KB Output is correct
8 Correct 131 ms 12104 KB Output is correct
9 Correct 122 ms 11976 KB Output is correct
10 Correct 135 ms 12616 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 106 ms 11652 KB Output is correct
2 Correct 85 ms 11484 KB Output is correct
3 Correct 90 ms 10568 KB Output is correct
4 Correct 89 ms 11116 KB Output is correct
5 Correct 125 ms 11508 KB Output is correct
6 Correct 85 ms 11080 KB Output is correct
7 Correct 87 ms 11592 KB Output is correct
8 Correct 125 ms 13384 KB Output is correct
9 Correct 126 ms 13136 KB Output is correct
10 Correct 86 ms 11944 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 160 ms 12872 KB Output is correct
2 Correct 149 ms 12752 KB Output is correct
3 Correct 152 ms 13384 KB Output is correct
4 Correct 152 ms 11432 KB Output is correct
5 Correct 191 ms 12300 KB Output is correct
6 Correct 151 ms 13640 KB Output is correct
7 Correct 159 ms 11404 KB Output is correct
8 Correct 157 ms 12360 KB Output is correct
9 Correct 188 ms 11848 KB Output is correct
10 Correct 170 ms 13720 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 504 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 440 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 504 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 440 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 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 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 504 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 440 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 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 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 2 ms 336 KB Output is correct
26 Correct 2 ms 336 KB Output is correct
27 Correct 3 ms 464 KB Output is correct
28 Correct 2 ms 464 KB Output is correct
29 Correct 2 ms 336 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 120 ms 11592 KB Output is correct
2 Correct 140 ms 12616 KB Output is correct
3 Correct 147 ms 12616 KB Output is correct
4 Correct 125 ms 12872 KB Output is correct
5 Correct 120 ms 13300 KB Output is correct
6 Correct 179 ms 13244 KB Output is correct
7 Correct 117 ms 13180 KB Output is correct
8 Correct 131 ms 12104 KB Output is correct
9 Correct 122 ms 11976 KB Output is correct
10 Correct 135 ms 12616 KB Output is correct
11 Correct 106 ms 11652 KB Output is correct
12 Correct 85 ms 11484 KB Output is correct
13 Correct 90 ms 10568 KB Output is correct
14 Correct 89 ms 11116 KB Output is correct
15 Correct 125 ms 11508 KB Output is correct
16 Correct 85 ms 11080 KB Output is correct
17 Correct 87 ms 11592 KB Output is correct
18 Correct 125 ms 13384 KB Output is correct
19 Correct 126 ms 13136 KB Output is correct
20 Correct 86 ms 11944 KB Output is correct
21 Correct 160 ms 12872 KB Output is correct
22 Correct 149 ms 12752 KB Output is correct
23 Correct 152 ms 13384 KB Output is correct
24 Correct 152 ms 11432 KB Output is correct
25 Correct 191 ms 12300 KB Output is correct
26 Correct 151 ms 13640 KB Output is correct
27 Correct 159 ms 11404 KB Output is correct
28 Correct 157 ms 12360 KB Output is correct
29 Correct 188 ms 11848 KB Output is correct
30 Correct 170 ms 13720 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 504 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 440 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 336 KB Output is correct
44 Correct 1 ms 336 KB Output is correct
45 Correct 1 ms 336 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 2 ms 336 KB Output is correct
56 Correct 2 ms 336 KB Output is correct
57 Correct 3 ms 464 KB Output is correct
58 Correct 2 ms 464 KB Output is correct
59 Correct 2 ms 336 KB Output is correct
60 Correct 1 ms 336 KB Output is correct
61 Correct 179 ms 13640 KB Output is correct
62 Correct 188 ms 14008 KB Output is correct
63 Correct 172 ms 13656 KB Output is correct
64 Correct 192 ms 13896 KB Output is correct
65 Correct 191 ms 13728 KB Output is correct
66 Correct 186 ms 13640 KB Output is correct
67 Correct 185 ms 13452 KB Output is correct
68 Correct 154 ms 13796 KB Output is correct
69 Correct 155 ms 13652 KB Output is correct
70 Correct 147 ms 13704 KB Output is correct