Submission #804981

#TimeUsernameProblemLanguageResultExecution timeMemory
804981GangstaRice Hub (IOI11_ricehub)C++14
17 / 100
1086 ms1572 KiB
// a >> b = a / pow(2,b) // a << b = a * pow(2,b) #include <bits/stdc++.h> #define ll long long int #define pb push_back #define sz size() #define ss second #define ff first #define N 200001 #define pll pair<ll,ll> using namespace std; ll besthub(int r, int l, int x[N], ll b){ ll tmp, md, ans, mx = 0; for(int i = 1; i <= l; i++){ ans = 0; tmp = b; md = i; vector <ll> v; for(int i = 0; i < r; i++){ v.pb(abs(md - x[i])); } sort(v.begin(), v.end()); for(auto i : v){ if(tmp <= i) break; ans++; tmp -= i; } mx = max(mx,ans); } return mx; } //int main(){ // ll r, l, x[N], b; // cin >> r >> l; // for(int i = 0; i < r; i++) cin >> x[i]; // cin >> b; // cout << besthub(r,l,x,b); //}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...