oj.uz

Submission #1026318

# Submission time Handle Problem Language Result Execution time Memory
1026318 2024-07-17T22:15:43 Z fv3 Feast (NOI19_feast) C++14
12 / 100
 34 ms 7792 KB 
#include <bits/stdc++.h>
 
using namespace std;
typedef long long ll;
 
vector<ll> a, b;
 
ll mx_res;
ll solve(ll pun)
{
	ll seg_cnt = 0;
	mx_res = 0;

	ll res = -pun;
	ll last = 0;
	for (ll n : b)
	{
		if (n > 0)
		{
			last += n;
			continue;
		}

		if (n < -pun)
		{
			if (last > 0)
			{
				res += last;
				mx_res = max(mx_res, res);
				seg_cnt++;
			}
 
			last = -pun;
		}
		else
		{
			last += n;
		}
 
		if (last < -pun)
			last = -pun;
	}

	if (last > 0)
	{
		res += last;
		mx_res = max(mx_res, res);
		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);
	}
 
	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 << mx_res + K * l << '\n';
	return 0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 5464 KB Output is correct
2 Correct 20 ms 5588 KB Output is correct
3 Correct 20 ms 5476 KB Output is correct
4 Correct 21 ms 5452 KB Output is correct
5 Correct 20 ms 5464 KB Output is correct
6 Correct 20 ms 5468 KB Output is correct
7 Correct 20 ms 5468 KB Output is correct
8 Correct 23 ms 5580 KB Output is correct
9 Correct 20 ms 5468 KB Output is correct
10 Correct 25 ms 5568 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 3676 KB Output is correct
2 Correct 18 ms 3932 KB Output is correct
3 Correct 13 ms 3632 KB Output is correct
4 Correct 16 ms 3656 KB Output is correct
5 Correct 20 ms 5292 KB Output is correct
6 Correct 13 ms 3676 KB Output is correct
7 Correct 13 ms 3828 KB Output is correct
8 Correct 21 ms 5468 KB Output is correct
9 Correct 23 ms 5460 KB Output is correct
10 Correct 13 ms 3932 KB Output is correct

Subtask #3
0 / 18.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 11.0

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

Subtask #6
0 / 20.0

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

Subtask #7
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 5464 KB Output is correct
2 Correct 20 ms 5588 KB Output is correct
3 Correct 20 ms 5476 KB Output is correct
4 Correct 21 ms 5452 KB Output is correct
5 Correct 20 ms 5464 KB Output is correct
6 Correct 20 ms 5468 KB Output is correct
7 Correct 20 ms 5468 KB Output is correct
8 Correct 23 ms 5580 KB Output is correct
9 Correct 20 ms 5468 KB Output is correct
10 Correct 25 ms 5568 KB Output is correct
11 Correct 18 ms 3676 KB Output is correct
12 Correct 18 ms 3932 KB Output is correct
13 Correct 13 ms 3632 KB Output is correct
14 Correct 16 ms 3656 KB Output is correct
15 Correct 20 ms 5292 KB Output is correct
16 Correct 13 ms 3676 KB Output is correct
17 Correct 13 ms 3828 KB Output is correct
18 Correct 21 ms 5468 KB Output is correct
19 Correct 23 ms 5460 KB Output is correct
20 Correct 13 ms 3932 KB Output is correct
21 Incorrect 34 ms 7792 KB Output isn't correct
22 Halted 0 ms 0 KB -