oj.uz

Submission #739793

# Submission time Handle Problem Language Result Execution time Memory
739793 2023-05-11T10:03:49 Z NeroZein Feast (NOI19_feast) C++17
18 / 100
 112 ms 10956 KB 
#include "bits/stdc++.h"
using namespace std;
 
#ifdef Nero
#include "Deb.h"
#else
#define deb(...)
#endif
 
const int N = 300005;
 
int n, k;
int a[N];
pair<long long,int> dp[N][2];
pair<long long,int> solve (long long cost) {
	dp[0][0] = {0LL, 0};
	dp[0][1] = {-1e15, -N};
	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] - cost, dp[i - 1][0].second + 1), 
									 make_pair(dp[i - 1][1].first + a[i], dp[i - 1][1].second)); 
	}
	return max(dp[n][0], dp[n][1]); 
}
 
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cin >> n >> k;
	for (int i = 1; i <= n; ++i) {
		cin >> a[i];
	}
	long long l = 0, r = (long long) N * 1e9;
	while (l < r) {
		long long mid = (l + r) >> 1;
		if (solve(mid).second >= k) {
			l = mid + 1;
		} else {
			r = mid;
		}
	}
	cout << solve(l - 1).first + (l - 1) * k << '\n';
	return 0;
}

Subtask #1
0 / 4.0

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

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 10592 KB Output is correct
2 Correct 81 ms 10792 KB Output is correct
3 Correct 77 ms 10616 KB Output is correct
4 Incorrect 77 ms 10640 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 104 ms 10760 KB Output is correct
2 Correct 101 ms 10508 KB Output is correct
3 Correct 112 ms 10608 KB Output is correct
4 Correct 103 ms 10632 KB Output is correct
5 Correct 103 ms 10644 KB Output is correct
6 Correct 104 ms 10788 KB Output is correct
7 Correct 102 ms 10824 KB Output is correct
8 Correct 102 ms 10632 KB Output is correct
9 Correct 101 ms 10956 KB Output is correct
10 Correct 99 ms 10832 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 89 ms 10544 KB Output isn't correct
2 Halted 0 ms 0 KB -