Submission #639755

#TimeUsernameProblemLanguageResultExecution timeMemory
639755bonkRice Hub (IOI11_ricehub)C++14
68 / 100
1079 ms3620 KiB
#include <bits/stdc++.h> #include <ricehub.h> using namespace std; using ll = long long; int besthub(int r, int l, int x[], ll b){ ll ans = 0; for(int i = 0; i < r; i++){ priority_queue<ll>pq; ll cost = 0; ll tmp = 0; for(int j = 0; j < r; j++){ ll a = abs(x[j] - x[i]); if(cost + a <= b){ pq.push(a); cost += a; tmp++; } else if(!pq.empty() && pq.top() > a){ cost -= pq.top(); pq.pop(); cost += a; pq.push(a); } } ans = max(ans, tmp); } 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...