| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 743270 | vjudge1 | Rice Hub (IOI11_ricehub) | C++17 | 6 ms | 1728 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;
vector<long long> vec;
map<int,int> mp;
int besthub(int R, int L, int X[], long long B)
{
int ans = 0;
for(int i=0;i<R;i++) mp[X[i]]++;
int pos = 0 , maxx = 0;
for(auto [p,v]:mp) {
if (v>maxx) {
maxx = v;
pos = p;
}
}
// for(int i=max(0, (R/2)-550);i<min(R, (R/2)+550);i++) {
int now = 0;
vec.clear();
for(int j=0;j<R;j++) {
vec.push_back(abs(X[j] - pos));
}
sort(vec.begin(), vec.end());
long long cou = 0;
for(auto t:vec) {
cou += t;
if (cou>B) break;
now++;
}
// ans = max(ans, now);
// }
return now;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
