| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1345428 | enzy | Boxes with souvenirs (IOI15_boxes) | C++20 | 0 ms | 344 KiB |
#include "boxes.h"
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll delivery(int N, int K, int L, int p[]){
int l=0, r=N-1, at=0;
sort(p,p+N);
ll resp=0;
auto dist=[&](int a, int b){
ll c1=abs(a-b), c2=L-c1;
return min(c1,c2);
};
for(int i=0;i<N;i++){
if((i%K==0)){
resp+=dist(at,0);
at=0;
}
if(dist(at,l)<dist(at,r)){
resp+=dist(at,p[l]);
at=p[l];
l++;
}else{
resp+=dist(at,p[r]);
at=p[r];
r--;
}
}
return resp+dist(at,0);
}
| # | 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... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
