| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1354863 | Charizard2021 | 쌀 창고 (IOI11_ricehub) | C++20 | 1095 ms | 1324 KiB |
#include "ricehub.h"
#include<bits/stdc++.h>
using namespace std;
int besthub(int R, int L, int X[], long long B){
int res = 0;
for(int i = 0; i < R; i++){
vector<long long> dist;
for(int j = 0; j < R; j++){
dist.push_back(abs(X[i] - X[j]));
}
sort(dist.begin(), dist.end());
long long cur = 0;
int cnt = 0;
for(int j = 0; j < R; j++){
if(cur + dist[j] <= B){
cur += dist[j];
cnt++;
}
}
res = max(res, cnt);
}
return res;
}| # | 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... | ||||
