# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
796721 | vjudge1 | Bitaro's travel (JOI23_travel) | 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.
for(; cr_l != -1 && cr_r != n;) {
if(s - a[cr_l] > a[cr_r] - s) {
l = cr_r, r = n;
for(; l + 1 < r;) {
m = (l + r) / 2;
(a[m] - s < s - a[cr_l] ? l : r) = m;
}
ans += a[l] - s;
s = a[l];
cr_r = r;
} else {
l = -1, r = cr_l;
for(; l + 1 < r;) {
m = (l + r) / 2;
(a[cr_r] - s < s - a[l] ? l : r) = m;
}
ans += s - a[r];
s = a[r];
cr_l = l;
}
}
if(cr_r < n) {
ans += a[n - 1] - s;
} else if(cr_l > -1) {
ans += s - a[0];
}
cout << ans << '\n';
}
}