oj.uz

Submission #1026320

# Submission time Handle Problem Language Result Execution time Memory
1026320 2024-07-17T22:18:36 Z fv3 Feast (NOI19_feast) C++14
12 / 100
 26 ms 4812 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;
			mx_res = max(mx_res, res + last);

			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 16 ms 2648 KB Output is correct
2 Correct 18 ms 2648 KB Output is correct
3 Correct 18 ms 2648 KB Output is correct
4 Correct 16 ms 2648 KB Output is correct
5 Correct 16 ms 2652 KB Output is correct
6 Correct 17 ms 2652 KB Output is correct
7 Correct 16 ms 2652 KB Output is correct
8 Correct 23 ms 2652 KB Output is correct
9 Correct 17 ms 2652 KB Output is correct
10 Correct 16 ms 2652 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 2648 KB Output is correct
2 Correct 11 ms 2652 KB Output is correct
3 Correct 10 ms 2652 KB Output is correct
4 Correct 11 ms 2652 KB Output is correct
5 Correct 16 ms 2652 KB Output is correct
6 Correct 11 ms 2652 KB Output is correct
7 Correct 11 ms 2652 KB Output is correct
8 Correct 17 ms 2652 KB Output is correct
9 Correct 17 ms 2648 KB Output is correct
10 Correct 11 ms 2652 KB Output is correct

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 26 ms 4812 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 16 ms 2648 KB Output is correct
2 Correct 18 ms 2648 KB Output is correct
3 Correct 18 ms 2648 KB Output is correct
4 Correct 16 ms 2648 KB Output is correct
5 Correct 16 ms 2652 KB Output is correct
6 Correct 17 ms 2652 KB Output is correct
7 Correct 16 ms 2652 KB Output is correct
8 Correct 23 ms 2652 KB Output is correct
9 Correct 17 ms 2652 KB Output is correct
10 Correct 16 ms 2652 KB Output is correct
11 Correct 11 ms 2648 KB Output is correct
12 Correct 11 ms 2652 KB Output is correct
13 Correct 10 ms 2652 KB Output is correct
14 Correct 11 ms 2652 KB Output is correct
15 Correct 16 ms 2652 KB Output is correct
16 Correct 11 ms 2652 KB Output is correct
17 Correct 11 ms 2652 KB Output is correct
18 Correct 17 ms 2652 KB Output is correct
19 Correct 17 ms 2648 KB Output is correct
20 Correct 11 ms 2652 KB Output is correct
21 Incorrect 26 ms 4812 KB Output isn't correct
22 Halted 0 ms 0 KB -