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