| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 61742 | nvmdava | Boxes with souvenirs (IOI15_boxes) | C++17 | 2 ms | 376 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "boxes.h"
#include<bits/stdc++.h>
using namespace std;
long long delivery(int n, int k, int l, int p[]) {
vector<int> v;
int i = 0;
while(p[i] == 0){
i++;
}
v.insert(v.begin(),p + i, p + n);
long long ans = 0;
n = v.size();
int le = n;
i = k - 1;
while( i < n && p[i] * 2 < l){
ans += (long long)p[i];
le -= k;
i += k;
}
int j = i - k;
i = n - k;
while(i > 0 && p[i] * 2 > l){
ans += (long long)l - p[i];
i -= k;
le -= k;
}
i += k;
ans *= 2;
ans += le / k * l;
le %= k;
if(le != 0){
le = k - l;
for(int t = 0; t <= le ;t++){
if(t > j || i +le - t >= n){
break;
}
ans = min(ans , ans - p[j] * 2 - (l - p[i]) * 2 + p[j - t] * 2 + (l - p[i + le - t]) * 2);
}
}
return ans;
}
Compilation message (stderr)
| # | 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... | ||||
