| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 336559 |
2020-12-15T17:02:44 Z |
super_j6 |
Feast (NOI19_feast) |
C++14 |
|
116 ms |
8832 KB |
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
#define endl '\n'
#define ll long long
#define pi pair<ll, ll>
#define f first
#define s second
const int mxn = 300001;
int n, k;
ll a[mxn];
pi dp[mxn];
pi sol(ll x){
pi p = dp[0];
for(int i = 1; i <= n; i++){
dp[i] = dp[i - 1];
if(p.f + a[i] - x > dp[i].f) dp[i] = {p.f + a[i] - x, p.s + 1};
if(dp[i].f - a[i] > p.f) p = {dp[i].f - a[i], dp[i].s};
}
return dp[n];
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n >> k;
for(int i = 1; i <= n; i++) cin >> a[i], a[i] += a[i - 1];
ll l = -1, r = 0x3f3f3f3f;
while(r - l > 1){
ll mid = (l + r) / 2;
if(sol(mid).s <= k) r = mid;
else l = mid;
}
pi p = sol(r);
cout << (p.f + p.s * r) << endl;
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
60 ms |
8832 KB |
Output is correct |
| 2 |
Correct |
59 ms |
8556 KB |
Output is correct |
| 3 |
Correct |
61 ms |
8556 KB |
Output is correct |
| 4 |
Correct |
59 ms |
8556 KB |
Output is correct |
| 5 |
Correct |
59 ms |
8556 KB |
Output is correct |
| 6 |
Correct |
58 ms |
8428 KB |
Output is correct |
| 7 |
Correct |
60 ms |
8428 KB |
Output is correct |
| 8 |
Correct |
59 ms |
8556 KB |
Output is correct |
| 9 |
Correct |
58 ms |
8556 KB |
Output is correct |
| 10 |
Correct |
61 ms |
8428 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
52 ms |
8300 KB |
Output is correct |
| 2 |
Correct |
57 ms |
8684 KB |
Output is correct |
| 3 |
Correct |
49 ms |
8300 KB |
Output is correct |
| 4 |
Correct |
50 ms |
8428 KB |
Output is correct |
| 5 |
Correct |
59 ms |
8428 KB |
Output is correct |
| 6 |
Correct |
49 ms |
8320 KB |
Output is correct |
| 7 |
Correct |
50 ms |
8556 KB |
Output is correct |
| 8 |
Correct |
62 ms |
8556 KB |
Output is correct |
| 9 |
Correct |
59 ms |
8428 KB |
Output is correct |
| 10 |
Correct |
49 ms |
8428 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
116 ms |
8812 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
384 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
384 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
384 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
60 ms |
8832 KB |
Output is correct |
| 2 |
Correct |
59 ms |
8556 KB |
Output is correct |
| 3 |
Correct |
61 ms |
8556 KB |
Output is correct |
| 4 |
Correct |
59 ms |
8556 KB |
Output is correct |
| 5 |
Correct |
59 ms |
8556 KB |
Output is correct |
| 6 |
Correct |
58 ms |
8428 KB |
Output is correct |
| 7 |
Correct |
60 ms |
8428 KB |
Output is correct |
| 8 |
Correct |
59 ms |
8556 KB |
Output is correct |
| 9 |
Correct |
58 ms |
8556 KB |
Output is correct |
| 10 |
Correct |
61 ms |
8428 KB |
Output is correct |
| 11 |
Correct |
52 ms |
8300 KB |
Output is correct |
| 12 |
Correct |
57 ms |
8684 KB |
Output is correct |
| 13 |
Correct |
49 ms |
8300 KB |
Output is correct |
| 14 |
Correct |
50 ms |
8428 KB |
Output is correct |
| 15 |
Correct |
59 ms |
8428 KB |
Output is correct |
| 16 |
Correct |
49 ms |
8320 KB |
Output is correct |
| 17 |
Correct |
50 ms |
8556 KB |
Output is correct |
| 18 |
Correct |
62 ms |
8556 KB |
Output is correct |
| 19 |
Correct |
59 ms |
8428 KB |
Output is correct |
| 20 |
Correct |
49 ms |
8428 KB |
Output is correct |
| 21 |
Incorrect |
116 ms |
8812 KB |
Output isn't correct |
| 22 |
Halted |
0 ms |
0 KB |
- |
