| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1264243 | DeltaStruct | Boxes with souvenirs (IOI15_boxes) | C++20 | 312 ms | 125756 KiB |
#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
long long delivery(int n,int m,int q,int A[]){
vector<long long> R(n+1),T(m);
for (int i(0);i < n;++i) R[i+1] += (T[i%m] += min(2*A[i],q));
fill(T.begin(),T.end(),0);
for (int i(n-1);i > -1;--i) R[i] += (T[i%m] += min(2*(q-A[i]),q));
return *min_element(R.begin(),R.end());
}| # | 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... | ||||
