| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1352731 | ElayV13 | Boxes with souvenirs (IOI15_boxes) | C++20 | 0 ms | 344 KiB |
#include "boxes.h"
#include "bits/stdc++.h"
using namespace std;
#define ll long long
const ll INF=1e18;
ll delivery(int N,int K,int L,int p[])
{
ll res=min((ll)L,((L-1)-p[0]+1)*2ll);
res=min(res,p[N-1]*2ll);
for(int i=0;i<N-1;i++){
ll cost1=p[i]*2ll;
ll cost2=((L-1)-p[i+1]+1)*2ll;
res=min(res,cost1+cost2);
}
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... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
