Submission #1010821

#TimeUsernameProblemLanguageResultExecution timeMemory
1010821MuhammetRice Hub (IOI11_ricehub)C++17
68 / 100
1035 ms860 KiB
#include <bits/stdc++.h> #include "ricehub.h" #define sz(s) (int)s.size() using namespace std; #define ll long long int besthub(int n, int l, int a[], ll b){ vector <ll> v; ll ans = 0; for(int i = 0; i < n; i++){ v.clear(); ll b1 = b, x = 0; for(int j = 0; j < n; j++){ if(a[i] != a[j]){ v.push_back(abs(a[i]-a[j])); } else x++; } if(sz(v) > 0){ sort(v.begin(),v.end()); for(auto j : v){ if(j > b1) break; b1 -= j; x++; } } ans = max(ans,x); } 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...