답안 #1104092

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1104092 2024-10-22T17:36:48 Z ridarfx Feast (NOI19_feast) C++14
100 / 100
223 ms 13896 KB
#include <bits/stdc++.h>
using namespace std;

#define ll long long

int main() {
	int n, k;
	cin >> n >> k;
    long long rk = 0;
	int a[n];
	for (int &i : a) { cin >> i; if(i>0){
	    rk++;
	} }
    if(k>rk){
        k = rk;
    }
	/**
	 * @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 126 ms 10520 KB Output is correct
2 Correct 129 ms 11324 KB Output is correct
3 Correct 153 ms 11080 KB Output is correct
4 Correct 128 ms 11080 KB Output is correct
5 Correct 128 ms 12332 KB Output is correct
6 Correct 126 ms 10572 KB Output is correct
7 Correct 125 ms 10568 KB Output is correct
8 Correct 140 ms 10804 KB Output is correct
9 Correct 130 ms 10528 KB Output is correct
10 Correct 150 ms 10568 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 88 ms 10572 KB Output is correct
2 Correct 90 ms 10808 KB Output is correct
3 Correct 99 ms 10580 KB Output is correct
4 Correct 88 ms 10824 KB Output is correct
5 Correct 121 ms 11684 KB Output is correct
6 Correct 86 ms 10568 KB Output is correct
7 Correct 91 ms 11080 KB Output is correct
8 Correct 136 ms 13080 KB Output is correct
9 Correct 118 ms 10512 KB Output is correct
10 Correct 87 ms 10804 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 152 ms 10824 KB Output is correct
2 Correct 152 ms 12616 KB Output is correct
3 Correct 159 ms 12296 KB Output is correct
4 Correct 150 ms 12616 KB Output is correct
5 Correct 150 ms 12104 KB Output is correct
6 Correct 151 ms 10836 KB Output is correct
7 Correct 163 ms 12184 KB Output is correct
8 Correct 153 ms 12104 KB Output is correct
9 Correct 155 ms 12220 KB Output is correct
10 Correct 172 ms 13484 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 508 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 508 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 508 KB Output is correct
20 Correct 1 ms 524 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 508 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 508 KB Output is correct
20 Correct 1 ms 524 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 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 126 ms 10520 KB Output is correct
2 Correct 129 ms 11324 KB Output is correct
3 Correct 153 ms 11080 KB Output is correct
4 Correct 128 ms 11080 KB Output is correct
5 Correct 128 ms 12332 KB Output is correct
6 Correct 126 ms 10572 KB Output is correct
7 Correct 125 ms 10568 KB Output is correct
8 Correct 140 ms 10804 KB Output is correct
9 Correct 130 ms 10528 KB Output is correct
10 Correct 150 ms 10568 KB Output is correct
11 Correct 88 ms 10572 KB Output is correct
12 Correct 90 ms 10808 KB Output is correct
13 Correct 99 ms 10580 KB Output is correct
14 Correct 88 ms 10824 KB Output is correct
15 Correct 121 ms 11684 KB Output is correct
16 Correct 86 ms 10568 KB Output is correct
17 Correct 91 ms 11080 KB Output is correct
18 Correct 136 ms 13080 KB Output is correct
19 Correct 118 ms 10512 KB Output is correct
20 Correct 87 ms 10804 KB Output is correct
21 Correct 152 ms 10824 KB Output is correct
22 Correct 152 ms 12616 KB Output is correct
23 Correct 159 ms 12296 KB Output is correct
24 Correct 150 ms 12616 KB Output is correct
25 Correct 150 ms 12104 KB Output is correct
26 Correct 151 ms 10836 KB Output is correct
27 Correct 163 ms 12184 KB Output is correct
28 Correct 153 ms 12104 KB Output is correct
29 Correct 155 ms 12220 KB Output is correct
30 Correct 172 ms 13484 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 508 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 508 KB Output is correct
50 Correct 1 ms 524 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 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 192 ms 13696 KB Output is correct
62 Correct 195 ms 13896 KB Output is correct
63 Correct 186 ms 13456 KB Output is correct
64 Correct 223 ms 13896 KB Output is correct
65 Correct 204 ms 13860 KB Output is correct
66 Correct 212 ms 13640 KB Output is correct
67 Correct 210 ms 13640 KB Output is correct
68 Correct 169 ms 13860 KB Output is correct
69 Correct 166 ms 13672 KB Output is correct
70 Correct 176 ms 13396 KB Output is correct