Submission #743252

#TimeUsernameProblemLanguageResultExecution timeMemory
743252vjudge1Rice Hub (IOI11_ricehub)C++17
42 / 100
1068 ms724 KiB
#include "ricehub.h" #include <bits/stdc++.h> using namespace std; vector<long long> vec; int besthub(int R, int L, int X[], long long B) { int ans = 0; for(int i=max(0, (R/2)-500);i<min(R, (R/2)+500);i++) { int now = 0; vec.clear(); for(int j=0;j<R;j++) { vec.push_back(abs(X[j] - X[i])); } sort(vec.begin(), vec.end()); long long cou = 0; for(auto t:vec) { cou += t; if (cou>B) break; now++; } ans = max(ans, now); } 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...