Submission #1015162

#TimeUsernameProblemLanguageResultExecution timeMemory
1015162KasymKRice Hub (IOI11_ricehub)C++17
17 / 100
1081 ms856 KiB
#include "bits/stdc++.h" using namespace std; #define ll long long #define ff first #define ss second #define all(v) v.begin(), v.end() int besthub(int r, int l, int x[], ll b){ ll b_ = b; int answer = 0; deque<int> diff; for(int cor = 1; cor <= l; ++cor){ diff.clear(); int sm = 0; for(int i = 0; i < r; ++i) diff.push_back(abs(cor-x[i])); sort(all(diff)); while(1){ if(b-diff[0] >= 0) b -= diff[0], diff.pop_front(), sm++; else break; } answer = max(answer, sm); b = b_; } return answer; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...