| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1331624 | uranhishig | Boxes with souvenirs (IOI15_boxes) | C++20 | 0 ms | 344 KiB |
// #include "boxes.h"
#include<bits/stdc++.h>
using namespace std;
// #define int long long
long long delivery(int n, int k, int l, int p[]) {
long long ans = 0;
for (int i = 0; i < n; i++) {
long long x = min(p[i], l - p[i]);
ans += x + x;
}
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... | ||||
