Submission #433126

#	Time	Username	Problem	Language	Result	Execution time	Memory
433126		SuhaibSawalha1	쌀 창고 (IOI11_ricehub)	C++17	49 / 100	22 ms	2624 KiB

ricehub

#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;

int besthub(int n, int L, int a[], long long B){
	int l = 0, r = 0, ans = 0;
	long long pref[n];
	for (int i = 0; i < n; ++i) {
		pref[i] = a[i];
		if (i) {
			pref[i] += pref[i - 1];
		}
	}
	auto get = [&] (int l, int r) {
		return pref[r] - (l ? pref[l - 1] : 0);
	};
	while (r < n) {
		int mid = (l + r) / 2;
		if ((mid - l + 1) * 1LL * a[mid] - get(l, mid) + get(mid + 1, r) - (r - mid) * 1LL * a[mid] < B) {
			ans = max(ans, r - l + 1);
			++r;
		}
		else {
			++l;
		}
	}
  return ans;
}

• Subtask 1: 17 / 17
• Subtask 2: 0 / 25
• Subtask 3: 0 / 26
• Subtask 4: 32 / 32