| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1352724 | ElayV13 | 선물상자 (IOI15_boxes) | C++20 | 0 ms | 344 KiB |
#include "boxes.h"
#include "bits/stdc++.h"
using namespace std;
#define ll long long
ll delivery(int N,int K,int L,int p[])
{
ll res=0;
for(int i=0;i<N;i++){
ll cost=min((L-1)-p[i]+1,p[i]);
res+=(cost*2);
}
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... | ||||
