| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1129246 | coolavy999 | Boxes with souvenirs (IOI15_boxes) | C++20 | 0 ms | 328 KiB |
// Problem: https://oj.uz/problem/view/IOI15_boxes
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
ll delivery(int n, int k, int l, int pos[]) {
if (k == 1) { // subtask 1
return n * l;
} else if (k == n) { // subtask 2
return l;
} else { // subtask 3-7
return 47;
}
}| # | 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... | ||||
