제출 #262444

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
262444		c4ts0up	쌀 창고 (IOI11_ricehub)	C++17	100 / 100	21 ms	3572 KiB

ricehub

#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
 
ll n;
vector <ll> arr, costos;

ll Cost(ll s, ll t, ll p) {
	return (p-s)*arr[p] - (costos[p]-costos[s]) + (costos[t+1]-costos[p+1]) - (t-p)*arr[p];
}
 
 
int besthub(int R, int L, int X[], ll B) {
	n = R;
	ll lb = 0, ub = n, mid, p;
	
	for (ll i=0; i<R; i++) arr.push_back((ll)X[i]);
	
	
	// precalculamos los costos
	costos.resize(n+1);
	costos[0] = 0LL;
	for (int i=1; i<=n; i++) costos[i] = costos[i-1] + arr[i-1];
	
	
	// O(log R)
	while (lb <= ub) {
		// sacamos el medio
		mid = (lb+ub)/2;
		
		//cerr << "lb = " << lb << ", ub = " << ub << ", mid = " << mid << endl;
		
		bool success = false;
		
		for (int i=0; i+mid<n; i++) {
			
			p = (2LL*i+mid)/2;
			//cerr << "El costo de [" << i << ", " << i+mid << "] es " << Cost(i, i+mid, p) << endl;
			//cerr << "p = " << p << endl;
			if (Cost(i, i+mid, p) <= B) {
				success = true;
				break;
			}
		}
		
		if (success) lb = mid+1;
		else ub = mid-1;
	}
	//cerr << "lb = " << lb << ", ub = " << ub << ", mid = " << mid << endl;
	return ub+1;
}

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