Submission #580857

#TimeUsernameProblemLanguageResultExecution timeMemory
580857benson1029Rice Hub (IOI11_ricehub)C++14
100 / 100
18 ms1620 KiB
#include "ricehub.h" #include<bits/stdc++.h> using namespace std; long long sum = 0; int besthub(int R, int L, int X[], long long B) { sort(X, X+R); int ptr = 0; int ans = 0; for(int i=0; i<R; i++) { if(ptr < i) { ptr = i; sum = 0; } while(ptr<R-1 && sum - X[(i+ptr+1)/2] + X[ptr+1] <= B) { sum = sum - X[(i+ptr+1)/2] + X[ptr+1]; ptr++; } ans = max(ans, ptr-i+1); sum = sum + X[i] - X[(i+ptr+1)/2]; } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...