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