| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1122400 | heey | Boxes with souvenirs (IOI15_boxes) | C++17 | 0 ms | 0 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>
#define int long long
#define f first
#define s second
#define all(x) (x).begin(), (x).end()
#define mod 1'000'000'007
#define inf 1'000'000'000'000'00
#define pb push_back
#define vvi vector<vi>
#define fst cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(false);
using namespace std;
int delivery(int n, int k, int l, int a[]){
int res = 0;
int d = 0;
int i = 0;
int j = n-1;
while(i <= j){
//start at zero
//cout << i << ' ' << j << ' ' << res << '\n';
int c = k;
int prev = 0;
//march left
while(i <= j && i < n && c > 0){
res += 2*(a[i] - prev);
d++;
c--;
prev = a[i];
i++;
if(i != n && a[i] - prev > l - a[i]) break;
}
//right
c = k;
prev = l;
while(i <= j && j >= 0 && c > 0){
res += 2*(prev - a[j]);
d++;
c--;
prev = a[j];
j--;
if(j > 0 && prev - a[j] > a[j]) break;
}
}
return res;
}