| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1305175 | mary-_-bogdanova | Boxes with souvenirs (IOI15_boxes) | C++20 | 1 ms | 576 KiB |
#include "boxes.h"
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll delivery(int N, int K, int L, int p[]) {
if (K == 1) {
ll ans = 0;
for (ll i = 0; i < N; i++) {
ans += min(p[i], L - p[i]);
}
return 2 * ans;
}
return 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... | ||||
