Submission #96405

#TimeUsernameProblemLanguageResultExecution timeMemory
96405mohammad쌀 창고 (IOI11_ricehub)C++14
0 / 100
5 ms632 KiB
#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)

ricehub.cpp: In function 'int besthub(int, int, int*, long long int)':
ricehub.cpp:29:35: warning: 'best' may be used uninitialized in this function [-Wmaybe-uninitialized]
   int lo = i  , hi = R - 1 , md , best;
                                   ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...