답안 #1017363

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1017363 2024-07-09T07:35:43 Z _shr104 Feast (NOI19_feast) C++14
100 / 100
223 ms 12960 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 110 ms 10576 KB Output is correct
2 Correct 114 ms 10776 KB Output is correct
3 Correct 129 ms 10832 KB Output is correct
4 Correct 115 ms 10804 KB Output is correct
5 Correct 123 ms 10796 KB Output is correct
6 Correct 115 ms 10584 KB Output is correct
7 Correct 112 ms 10500 KB Output is correct
8 Correct 114 ms 10832 KB Output is correct
9 Correct 115 ms 10576 KB Output is correct
10 Correct 113 ms 10776 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 82 ms 10576 KB Output is correct
2 Correct 100 ms 10840 KB Output is correct
3 Correct 87 ms 10696 KB Output is correct
4 Correct 79 ms 10576 KB Output is correct
5 Correct 116 ms 12024 KB Output is correct
6 Correct 80 ms 11348 KB Output is correct
7 Correct 89 ms 11644 KB Output is correct
8 Correct 118 ms 12624 KB Output is correct
9 Correct 114 ms 12048 KB Output is correct
10 Correct 80 ms 11604 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 152 ms 10796 KB Output is correct
2 Correct 148 ms 10576 KB Output is correct
3 Correct 144 ms 10576 KB Output is correct
4 Correct 145 ms 10576 KB Output is correct
5 Correct 142 ms 10772 KB Output is correct
6 Correct 168 ms 10792 KB Output is correct
7 Correct 146 ms 10836 KB Output is correct
8 Correct 147 ms 10580 KB Output is correct
9 Correct 142 ms 10840 KB Output is correct
10 Correct 143 ms 10788 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 344 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 344 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 348 KB Output is correct
12 Correct 0 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 1 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 344 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 348 KB Output is correct
12 Correct 0 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 1 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 440 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 600 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 436 KB Output is correct
28 Correct 1 ms 344 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 110 ms 10576 KB Output is correct
2 Correct 114 ms 10776 KB Output is correct
3 Correct 129 ms 10832 KB Output is correct
4 Correct 115 ms 10804 KB Output is correct
5 Correct 123 ms 10796 KB Output is correct
6 Correct 115 ms 10584 KB Output is correct
7 Correct 112 ms 10500 KB Output is correct
8 Correct 114 ms 10832 KB Output is correct
9 Correct 115 ms 10576 KB Output is correct
10 Correct 113 ms 10776 KB Output is correct
11 Correct 82 ms 10576 KB Output is correct
12 Correct 100 ms 10840 KB Output is correct
13 Correct 87 ms 10696 KB Output is correct
14 Correct 79 ms 10576 KB Output is correct
15 Correct 116 ms 12024 KB Output is correct
16 Correct 80 ms 11348 KB Output is correct
17 Correct 89 ms 11644 KB Output is correct
18 Correct 118 ms 12624 KB Output is correct
19 Correct 114 ms 12048 KB Output is correct
20 Correct 80 ms 11604 KB Output is correct
21 Correct 152 ms 10796 KB Output is correct
22 Correct 148 ms 10576 KB Output is correct
23 Correct 144 ms 10576 KB Output is correct
24 Correct 145 ms 10576 KB Output is correct
25 Correct 142 ms 10772 KB Output is correct
26 Correct 168 ms 10792 KB Output is correct
27 Correct 146 ms 10836 KB Output is correct
28 Correct 147 ms 10580 KB Output is correct
29 Correct 142 ms 10840 KB Output is correct
30 Correct 143 ms 10788 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 344 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 348 KB Output is correct
42 Correct 0 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 1 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 440 KB Output is correct
54 Correct 1 ms 348 KB Output is correct
55 Correct 1 ms 600 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 1 ms 436 KB Output is correct
58 Correct 1 ms 344 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 1 ms 348 KB Output is correct
61 Correct 179 ms 12360 KB Output is correct
62 Correct 223 ms 12960 KB Output is correct
63 Correct 163 ms 12400 KB Output is correct
64 Correct 185 ms 12624 KB Output is correct
65 Correct 180 ms 12624 KB Output is correct
66 Correct 182 ms 12584 KB Output is correct
67 Correct 184 ms 12368 KB Output is correct
68 Correct 171 ms 12536 KB Output is correct
69 Correct 142 ms 12476 KB Output is correct
70 Correct 144 ms 12368 KB Output is correct