Submission #96423

#	Time	Username	Problem	Language	Result	Execution time	Memory
96423		mohammad	쌀 창고 (IOI11_ricehub)	C++14	68 / 100	275 ms	204960 KiB

ricehub

#include "ricehub.h"
#include "iostream"
#include "vector"
#include "map"
#include "math.h"
#include "string"
#include "algorithm"
#include "set"
#include <iterator>
#include <string.h>
#include <queue>
#include <list>

using namespace	std;

typedef long long ll ;
const ll M = 998244353  ;
const ll oo = 1e13 ;

int cost[5010][5010];

int besthub(int R, int L, int X[], long long B){
	int ans = 1 ;
	for(int i = 1 ; i < R ; ++i){
		cost[i][0] = 0 ;
		for(int j = 1 ; j < R - i + 1 ; ++j){
			cost[i][j] = cost[i][j - 1] + (X[j + i - 1] - X[j / 2 + (i - 1)]) ;
		}
	}
	for(int i = 1 ; i < R ; ++i){
		int lo = 1 , hi = R - i , md , best = 1;
		while(lo <= hi){
			md = (lo + hi) / 2 ;
			if(B >= cost[i][md]){
				lo = md + 1 ;
				best = md + 1 ;
			}else{
				hi = md - 1 ;
			}
		}
		ans = max(ans , best);
	}
	return ans;
}

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