oj.uz

Submission #817800

# Submission time Handle Problem Language Result Execution time Memory
817800 2023-08-09T16:33:49 Z vjudge1 Feast (NOI19_feast) C++17
18 / 100
 230 ms 14620 KB 
#include <bits/stdc++.h>
using namespace std;

void main_program();

signed main(){
	ios_base::sync_with_stdio(0); cin.tie(0);
	main_program();
}

#define int long long

using ii = pair<int, int>;

int n, k;
vector<int> v, pfx;

ii better(ii a, ii b){
	if (a.first != b.first){
		return (a.first > b.first) ? a : b;
	}
	return (a.second < b.second) ? a : b;
}

ii f(int lambda){
	vector<ii> dp_closed(n+1), dp_open(n+1);
	dp_closed[0] = {0, 0};
	dp_open[0] = {0, 0};

	for (int i = 1; i <= n; i++){
		dp_closed[i] = better(dp_closed[i-1],
			{dp_open[i-1].first + pfx[i] - lambda, dp_open[i-1].second + 1});
		dp_open[i] = better(dp_open[i-1],
			{dp_closed[i].first - pfx[i-1], dp_closed[i].second});
	}

	return dp_closed[n];
}

void main_program(){
	cin >> n >> k;

	v.resize(n+1);
	for (int i = 1; i <= n; i++) cin >> v[i];
	pfx = v;
	for (int i = 1; i <= n; i++) pfx[i] += pfx[i-1];

	int l = 0, r = 3e14;
	int final = 0;
	while (l <= r){
		int mid = (l + r) >> 1;
		auto res = f(mid);
		if (res.second <= k){
			r = mid - 1;
			final = max(final, res.first + mid * res.second);
		}
		else l = mid + 1;
	}

	cout << final << "\n";
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 202 ms 14136 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 203 ms 14228 KB Output is correct
2 Correct 188 ms 14472 KB Output is correct
3 Correct 187 ms 14180 KB Output is correct
4 Incorrect 195 ms 14428 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 208 ms 14400 KB Output is correct
2 Correct 203 ms 14200 KB Output is correct
3 Correct 230 ms 14356 KB Output is correct
4 Correct 197 ms 14232 KB Output is correct
5 Correct 202 ms 14340 KB Output is correct
6 Correct 207 ms 14380 KB Output is correct
7 Correct 228 ms 14620 KB Output is correct
8 Correct 203 ms 14288 KB Output is correct
9 Correct 209 ms 14540 KB Output is correct
10 Correct 226 ms 14520 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 202 ms 14136 KB Output isn't correct
2 Halted 0 ms 0 KB -