Submission #224663

#TimeUsernameProblemLanguageResultExecution timeMemory
224663Amy313Rice Hub (IOI11_ricehub)C++14
0 / 100
1093 ms384 KiB
#include "ricehub.h" #include<bits/stdc++.h> int besthub(int R, int L, int X[], long long B) { int maxi= 0, c, a; long long cp = B; for(int i=1; i<=L; i++) { c = 0; cp = B; for(int j=0; j<R; j++) { a = abs(i-X[j]); if(a<=cp) { cp-=a; c++; } if(cp<=0) { break; } } if(c>maxi) { maxi = c; } } return maxi; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...