# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1026031 |
2024-07-17T13:00:59 Z |
fv3 |
Feast (NOI19_feast) |
C++14 |
|
33 ms |
7888 KB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<ll> a, b;
ll res;
ll solve(ll pun)
{
res = 0;
ll last = -pun;
ll seg_cnt = 0;
for (auto n : b)
{
if (n > 0)
{
last += n;
continue;
}
if (n < -pun)
{
if (last > 0)
{
res += last;
seg_cnt++;
}
last = -pun;
}
else
{
last += n;
}
if (last < -pun)
last = -pun;
}
if (last > 0)
{
res += last;
seg_cnt++;
}
return seg_cnt;
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
ll N, K;
cin >> N >> K;
a = vector<ll>(N);
for (int i = 0; i < N; i++)
cin >> a[i];
{
ll sum = a[0];
for (int i = 1; i < N; i++)
{
if ((a[i-1] ^ a[i]) < 0)
{
b.push_back(sum);
sum = 0;
}
sum += a[i];
}
if (sum != 0)
b.push_back(sum);
}
if (b.back() <= 0)
b.pop_back();
ll l = 0ll;
ll r = 1000000000000000000ll;
while (l < r)
{
ll c = (l + r) / 2ll;
if (solve(c) > K)
l = c + 1;
else
r = c;
}
solve(l);
cout << res + K * l << '\n';
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
20 ms |
5296 KB |
Output is correct |
2 |
Correct |
20 ms |
5464 KB |
Output is correct |
3 |
Correct |
21 ms |
5468 KB |
Output is correct |
4 |
Correct |
21 ms |
5468 KB |
Output is correct |
5 |
Correct |
22 ms |
5556 KB |
Output is correct |
6 |
Correct |
20 ms |
5424 KB |
Output is correct |
7 |
Correct |
26 ms |
5336 KB |
Output is correct |
8 |
Correct |
21 ms |
5468 KB |
Output is correct |
9 |
Correct |
21 ms |
5524 KB |
Output is correct |
10 |
Correct |
22 ms |
5448 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
12 ms |
3676 KB |
Output is correct |
2 |
Correct |
14 ms |
3932 KB |
Output is correct |
3 |
Correct |
18 ms |
3636 KB |
Output is correct |
4 |
Correct |
18 ms |
3672 KB |
Output is correct |
5 |
Correct |
20 ms |
5420 KB |
Output is correct |
6 |
Correct |
20 ms |
3764 KB |
Output is correct |
7 |
Correct |
13 ms |
3932 KB |
Output is correct |
8 |
Correct |
21 ms |
5468 KB |
Output is correct |
9 |
Correct |
28 ms |
5468 KB |
Output is correct |
10 |
Correct |
13 ms |
3804 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
33 ms |
7888 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
604 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
9 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
604 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
9 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
604 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
9 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
20 ms |
5296 KB |
Output is correct |
2 |
Correct |
20 ms |
5464 KB |
Output is correct |
3 |
Correct |
21 ms |
5468 KB |
Output is correct |
4 |
Correct |
21 ms |
5468 KB |
Output is correct |
5 |
Correct |
22 ms |
5556 KB |
Output is correct |
6 |
Correct |
20 ms |
5424 KB |
Output is correct |
7 |
Correct |
26 ms |
5336 KB |
Output is correct |
8 |
Correct |
21 ms |
5468 KB |
Output is correct |
9 |
Correct |
21 ms |
5524 KB |
Output is correct |
10 |
Correct |
22 ms |
5448 KB |
Output is correct |
11 |
Correct |
12 ms |
3676 KB |
Output is correct |
12 |
Correct |
14 ms |
3932 KB |
Output is correct |
13 |
Correct |
18 ms |
3636 KB |
Output is correct |
14 |
Correct |
18 ms |
3672 KB |
Output is correct |
15 |
Correct |
20 ms |
5420 KB |
Output is correct |
16 |
Correct |
20 ms |
3764 KB |
Output is correct |
17 |
Correct |
13 ms |
3932 KB |
Output is correct |
18 |
Correct |
21 ms |
5468 KB |
Output is correct |
19 |
Correct |
28 ms |
5468 KB |
Output is correct |
20 |
Correct |
13 ms |
3804 KB |
Output is correct |
21 |
Incorrect |
33 ms |
7888 KB |
Output isn't correct |
22 |
Halted |
0 ms |
0 KB |
- |