Submission #1264262

#TimeUsernameProblemLanguageResultExecution timeMemory
1264262liangjeremyRice Hub (IOI11_ricehub)C++20
42 / 100
1094 ms424 KiB
#include "ricehub.h" #include<bits/stdc++.h> #define fi first #define se second //#define int long long using namespace std; using db=double; using ll=int64_t; using sll=__int128; using lb=long double; int besthub(int r, int l, int x[], long long b){ int ans=0; for(int i=1; i<=l; i++){ vector<int>v; ll rem=b; int cur=0; for(int j=0; j<r; j++){ v.push_back(abs(i-x[j])); } sort(v.begin(),v.end()); for(auto x:v){ if(rem>=x){ rem-=x; cur++; } } ans=max(ans,cur); } 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...