| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1298291 | the_commando_x | Boxes with souvenirs (IOI15_boxes) | C++17 | 0 ms | 576 KiB |
#include "boxes.h"
#include <algorithm>
long long delivery(int N, int K, int L, int p[])
{
long long ans = 0;
if (K == 1)
for (int i = 0; i < N; ++i)
ans += 2LL * std::min((long long)p[i], std::max(0LL,(long long)L - p[i]));
return ans;
}
| # | 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... | ||||
