| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1365931 | Charizard2021 | Boxes with souvenirs (IOI15_boxes) | C++20 | 61 ms | 444 KiB |
#include "boxes.h"
#include<bits/stdc++.h>
using namespace std;
long long delivery(int n, int k, int l, int p[]){
vector<long long> L;
vector<long long> R;
for(long long i = 0; i < n; i++){
if(p[i] < l/2){
L.push_back(p[i]);
}
else{
R.push_back(p[i]);
}
}
long long ans = 1e18;
for(long long i = (long long)L.size(); i >= 0; i--){
for(long long j = 0; j <= (long long)R.size(); j++){
long long val = ((long long)L.size() - i) + j;
val = (val + (k - 1))/k;
val *= l;
long long val2 = 0;
for(long long x = i - 1; x >= 0; x -= k){
val2 += 2 * L[x];
}
for(long long x = j; x < (long long)R.size(); x += k){
val2 += 2 * R[x];
}
ans = min(ans, val + val2);
}
}
return ans;
}
// int main(){
// int n, k, l;
// cin >> n >> k >> l;
// int p[n];
// for(int i = 0; i < n; i++){
// cin >> p[i];
// }
// cout << delivery(n, k, l, p) << "\n";
// }| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
