# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
96405 | mohammad | 쌀 창고 (IOI11_ricehub) | C++14 | 5 ms | 632 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 ;
cost[0] = 0 ;
for(int i = 1 ; i < R ; ++i){
cost[i] = cost[i - 1] + (X[i] - X[i - 1]) + (X[i] - X[i - 1]) * (i / 3) ;
}
for(int i = 1 ; i < R ; ++i){
int lo = i , hi = R - 1 , md , best;
while(lo <= hi){
md = (lo + hi) / 2 ;
if(B > (cost[md] - cost[i - 1])){
lo = md + 1 ;
best = md + 1 - (i - 1) ;
}else{
hi = md - 1 ;
}
}
ans = max(ans , best);
}
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |