oj.uz

Submission #518806

# Submission time Handle Problem Language Result Execution time Memory
518806 2022-01-24T19:02:12 Z sliviu Rice Hub (IOI11_ricehub) C++17
0 / 100
 2 ms 460 KB 
#include <bits/stdc++.h>
#include "ricehub.h"

using namespace std;

int besthub(int n, int L, int a[], long long cmax) {
	vector<int> s(n + 1);
	for (int i = 1; i < n; ++i)
		s[i] = s[i - 1] + a[i - 1];
	int ans = 0;
	for (int i = 1, j = 1; i <= n; ++i) {
		auto cost = [&](int l, int r) {
			int m = (l + r) / 2;
			return 1LL * (m - l) * a[m - 1] - (s[m - 1] - s[i - 1]) + s[r] - s[m] - 1LL * (r - m) * a[m - 1];
		};
		while (j + 1 <= n && cost(i, j + 1) <= cmax)
			++j;
		ans = max(ans, j - i + 1);
	}
	return ans;
}

Subtask #1
0 / 17.0

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

Subtask #2
0 / 25.0

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

Subtask #3
0 / 26.0

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

Subtask #4
0 / 32.0

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