Submission #660287

#	Time	Username	Problem	Language	Result	Execution time	Memory
660287		Trisanu_Das	Rice Hub (IOI11_ricehub)	C++17	100 / 100	13 ms	1752 KiB

ricehub

#include <bits/stdc++.h>
#include "ricehub.h"
using namespace std;
 
int besthub(int n, int L, int x[], long long b){
	int ans = 0; long long curr_cost = 0;
	for(int l = 0, r = 0; l < n; l++){
		while(r + 1 < n && curr_cost + x[r + 1] - x[(l + r + 1) / 2] <= b){
			curr_cost += x[r + 1] - x[(l + r + 1) / 2]; r++; ans = max(ans, r - l + 1);
		}
		curr_cost += x[l] - x[(r + l + 1) / 2];
	}
	return ans;
}

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