Submission #96397

#	Time	Username	Problem	Language	Result	Execution time	Memory
96397		mohammad	쌀 창고 (IOI11_ricehub)	C++14	0 / 100	5 ms	504 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[100010];

int besthub(int R, int L, int X[], long long B){
	int ans = 1 ;
	for(int i = 1 ; i < R ; ++i){
		cost[i] = X[i] - X[i - 1] ;
	}
	int co = 1 ;
	ll c = 0 ;
	for(int i = 0 ; i < R - 1 ; ++i){
		c += cost[i];
		if(c > B){
			ans = max(ans , co);
			c = cost[i] ;
			co = 1 ;
			if(c > B){
				ans = max(ans , co);
				c = 0 ;
				co = 0 ;
			}
		}
		co++;
	}
	ans = max(ans , co);
	return ans;
}

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