oj.uz

답안 #1104095

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1104095 2024-10-22T17:38:44 Z ridarfx Feast (NOI19_feast) C++14
30 / 100
 1000 ms 11052 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;
        while(true){
            
        }
    }
	/**
	 * @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;
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 114 ms 10520 KB Output is correct
2 Correct 119 ms 10796 KB Output is correct
3 Correct 118 ms 10816 KB Output is correct
4 Correct 117 ms 10824 KB Output is correct
5 Correct 122 ms 10800 KB Output is correct
6 Correct 139 ms 10576 KB Output is correct
7 Correct 115 ms 10568 KB Output is correct
8 Correct 117 ms 11052 KB Output is correct
9 Correct 113 ms 10524 KB Output is correct
10 Correct 127 ms 10568 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 86 ms 10568 KB Output is correct
2 Correct 85 ms 10824 KB Output is correct
3 Correct 86 ms 10568 KB Output is correct
4 Correct 85 ms 10792 KB Output is correct
5 Correct 121 ms 10516 KB Output is correct
6 Correct 89 ms 10508 KB Output is correct
7 Correct 88 ms 10844 KB Output is correct
8 Correct 134 ms 10824 KB Output is correct
9 Correct 115 ms 10568 KB Output is correct
10 Correct 85 ms 10808 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 173 ms 10824 KB Output is correct
2 Correct 147 ms 10568 KB Output is correct
3 Correct 153 ms 10796 KB Output is correct
4 Correct 148 ms 10572 KB Output is correct
5 Correct 164 ms 10796 KB Output is correct
6 Correct 152 ms 10808 KB Output is correct
7 Correct 159 ms 10824 KB Output is correct
8 Correct 154 ms 10824 KB Output is correct
9 Correct 161 ms 10812 KB Output is correct
10 Correct 148 ms 10824 KB Output is correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Execution timed out 1081 ms 336 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Execution timed out 1081 ms 336 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Execution timed out 1081 ms 336 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #7
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 114 ms 10520 KB Output is correct
2 Correct 119 ms 10796 KB Output is correct
3 Correct 118 ms 10816 KB Output is correct
4 Correct 117 ms 10824 KB Output is correct
5 Correct 122 ms 10800 KB Output is correct
6 Correct 139 ms 10576 KB Output is correct
7 Correct 115 ms 10568 KB Output is correct
8 Correct 117 ms 11052 KB Output is correct
9 Correct 113 ms 10524 KB Output is correct
10 Correct 127 ms 10568 KB Output is correct
11 Correct 86 ms 10568 KB Output is correct
12 Correct 85 ms 10824 KB Output is correct
13 Correct 86 ms 10568 KB Output is correct
14 Correct 85 ms 10792 KB Output is correct
15 Correct 121 ms 10516 KB Output is correct
16 Correct 89 ms 10508 KB Output is correct
17 Correct 88 ms 10844 KB Output is correct
18 Correct 134 ms 10824 KB Output is correct
19 Correct 115 ms 10568 KB Output is correct
20 Correct 85 ms 10808 KB Output is correct
21 Correct 173 ms 10824 KB Output is correct
22 Correct 147 ms 10568 KB Output is correct
23 Correct 153 ms 10796 KB Output is correct
24 Correct 148 ms 10572 KB Output is correct
25 Correct 164 ms 10796 KB Output is correct
26 Correct 152 ms 10808 KB Output is correct
27 Correct 159 ms 10824 KB Output is correct
28 Correct 154 ms 10824 KB Output is correct
29 Correct 161 ms 10812 KB Output is correct
30 Correct 148 ms 10824 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Execution timed out 1081 ms 336 KB Time limit exceeded
33 Halted 0 ms 0 KB -