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