| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 1097187 |
2024-10-06T11:52:55 Z |
crafticat |
Feast (NOI19_feast) |
C++17 |
|
1000 ms |
26920 KB |
#include "bits/stdc++.h"
using namespace std;
template<typename T>
using V = vector<T>;
using ll = long long;
using pi = pair<ll, ll>;
#define ckmax(a,b) a= max(a,b)
std::pair<long long, long long> operator-(const std::pair<long long, long long>& p1, const std::pair<long long, long long>& p2) {
return {p1.first - p2.first, p1.second - p2.second};
}
pi solve(V<ll>&arr, ll k, ll p) {
V<V<pi>> dp(arr.size() + 1, V<pi>(2, {-1e18,0}));
dp[0][0] = {0,0};
for (ll i = 1; i <= arr.size(); ++i) {
dp[i][0] = {0,0};
for (ll l = 0; l < 2; ++l) {
ckmax(dp[i][l], max(dp[i - 1][1] - make_pair(p,-1), dp[i - 1][1]));
if (l == 0) ckmax(dp[i][l], dp[i - 1][0]);
ckmax(dp[i][l], dp[i - 1][0] - make_pair(p,-1));
if (l == 1) dp[i][l].first += arr[i - 1];
}
}
return max(dp[arr.size()][0], dp[arr.size()][1]);
}
int main() {
ll n, k; cin >> n >> k;
V<ll> arr(n);
for (ll i = 0; i < n; ++i) {
cin >> arr[i];
}
ll l = 0, r = 1e18;
int iter = 0;
while (r > l) {
ll mid = l + (r - l + 1) / 2;
if (solve(arr, k, mid).second >= k)
l = mid;
else
r = mid - 1;
iter++;
if (iter > 62) exit(5);
}
cout << solve(arr,k,l).first + l * k << "\n";
}
Compilation message
feast.cpp: In function 'pi solve(V<long long int>&, ll, ll)':
feast.cpp:18:22: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int, std::allocator<long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
18 | for (ll i = 1; i <= arr.size(); ++i) {
| ~~^~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
917 ms |
25780 KB |
Output is correct |
| 2 |
Correct |
941 ms |
26360 KB |
Output is correct |
| 3 |
Execution timed out |
1025 ms |
26920 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
978 ms |
24568 KB |
Output is correct |
| 2 |
Execution timed out |
1035 ms |
25192 KB |
Time limit exceeded |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1040 ms |
26444 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
604 KB |
Output is correct |
| 2 |
Correct |
1 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
1 ms |
344 KB |
Output is correct |
| 6 |
Correct |
1 ms |
348 KB |
Output is correct |
| 7 |
Correct |
1 ms |
348 KB |
Output is correct |
| 8 |
Correct |
1 ms |
348 KB |
Output is correct |
| 9 |
Correct |
1 ms |
344 KB |
Output is correct |
| 10 |
Correct |
1 ms |
344 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
604 KB |
Output is correct |
| 2 |
Correct |
1 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
1 ms |
344 KB |
Output is correct |
| 6 |
Correct |
1 ms |
348 KB |
Output is correct |
| 7 |
Correct |
1 ms |
348 KB |
Output is correct |
| 8 |
Correct |
1 ms |
348 KB |
Output is correct |
| 9 |
Correct |
1 ms |
344 KB |
Output is correct |
| 10 |
Correct |
1 ms |
344 KB |
Output is correct |
| 11 |
Correct |
1 ms |
432 KB |
Output is correct |
| 12 |
Correct |
1 ms |
348 KB |
Output is correct |
| 13 |
Correct |
1 ms |
348 KB |
Output is correct |
| 14 |
Correct |
1 ms |
348 KB |
Output is correct |
| 15 |
Correct |
1 ms |
348 KB |
Output is correct |
| 16 |
Correct |
1 ms |
348 KB |
Output is correct |
| 17 |
Correct |
1 ms |
348 KB |
Output is correct |
| 18 |
Correct |
1 ms |
436 KB |
Output is correct |
| 19 |
Correct |
1 ms |
348 KB |
Output is correct |
| 20 |
Correct |
1 ms |
348 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
604 KB |
Output is correct |
| 2 |
Correct |
1 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
1 ms |
344 KB |
Output is correct |
| 6 |
Correct |
1 ms |
348 KB |
Output is correct |
| 7 |
Correct |
1 ms |
348 KB |
Output is correct |
| 8 |
Correct |
1 ms |
348 KB |
Output is correct |
| 9 |
Correct |
1 ms |
344 KB |
Output is correct |
| 10 |
Correct |
1 ms |
344 KB |
Output is correct |
| 11 |
Correct |
1 ms |
432 KB |
Output is correct |
| 12 |
Correct |
1 ms |
348 KB |
Output is correct |
| 13 |
Correct |
1 ms |
348 KB |
Output is correct |
| 14 |
Correct |
1 ms |
348 KB |
Output is correct |
| 15 |
Correct |
1 ms |
348 KB |
Output is correct |
| 16 |
Correct |
1 ms |
348 KB |
Output is correct |
| 17 |
Correct |
1 ms |
348 KB |
Output is correct |
| 18 |
Correct |
1 ms |
436 KB |
Output is correct |
| 19 |
Correct |
1 ms |
348 KB |
Output is correct |
| 20 |
Correct |
1 ms |
348 KB |
Output is correct |
| 21 |
Correct |
5 ms |
348 KB |
Output is correct |
| 22 |
Correct |
5 ms |
604 KB |
Output is correct |
| 23 |
Correct |
5 ms |
348 KB |
Output is correct |
| 24 |
Correct |
5 ms |
608 KB |
Output is correct |
| 25 |
Correct |
5 ms |
604 KB |
Output is correct |
| 26 |
Correct |
5 ms |
604 KB |
Output is correct |
| 27 |
Correct |
5 ms |
604 KB |
Output is correct |
| 28 |
Correct |
5 ms |
604 KB |
Output is correct |
| 29 |
Correct |
5 ms |
616 KB |
Output is correct |
| 30 |
Correct |
4 ms |
604 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
917 ms |
25780 KB |
Output is correct |
| 2 |
Correct |
941 ms |
26360 KB |
Output is correct |
| 3 |
Execution timed out |
1025 ms |
26920 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
