Submission #518796

#	Time	Username	Problem	Language	Result	Execution time	Memory
518796		sliviu	Rice Hub (IOI11_ricehub)	C++17	49 / 100	16 ms	2128 KiB

ricehub

#include <bits/stdc++.h>
#include "ricehub.h"

using namespace std;

int besthub(int n, int L, int a[], long long cmax) {
	long long curcost = 0;
	int sol, cursol = 1;
	queue<int> l, r;
	l.emplace(0);
	for (int i = 1; i < n; ++i)
		r.emplace(i);
	while (!r.empty() && a[r.front()] - a[0] <= cmax - curcost) {
		++cursol, curcost += a[r.front()] - a[0];
		r.pop();
	}
	sol = cursol;
	for (int i = 1; i < n; ++i) {
		curcost += 1LL * (a[i] - a[i - 1]) * l.size();
		curcost -= 1LL * (a[i] - a[i - 1]) * (cursol - l.size());
		while (!l.empty() && curcost > cmax) {
			curcost -= a[i] - a[l.front()];
			--cursol;
			l.pop();
		}
		while (!r.empty() && a[r.front()] - a[i] <= cmax - curcost) {
			++cursol;
			curcost += a[r.front()] - a[i];
			r.pop();
		}
		while (!r.empty() && a[r.front()] - a[i] - (l.empty() ? 0 : a[i] - a[l.front()]) <= 0) {
			cursol += l.empty();
			curcost += a[r.front()] - a[i] - (l.empty() ? 0 : a[i] - a[l.front()]);
			if (!l.empty())
				l.pop();
			r.pop();
		}
		l.emplace(i);
		sol = max(sol, cursol);
	}
	return sol;
}

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