# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
813166 | OrazB | Boxes with souvenirs (IOI15_boxes) | C++14 | 1 ms | 212 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 <bits/stdc++.h>
// #include "boxes.h"
using namespace std;
#define all(x) (x).begin(), (x).end()
#define ll long long int
#define pii pair <int, int>
#define pb push_back
#define ff first
#define ss second
// const int N = 1e5+5;
ll delivery(int n, int K, int L, int p[]){
if (K == 1){
ll sum = 0;
for (int i = 0; i < n; i++){
sum += min(p[i], L-p[i])*2;
}
return sum;
}
const ll inf = 1e18;
ll mn = min({n, p[n-1]*2, (L-p[0])*2});
for (int i = 0; i < n-1; i++){
ll sum = min(n, p[i]*2)*1LL+min(n, (L-p[i+1])*2)*1LL;
mn = min(mn, sum);
}
return mn;
}
// int main ()
// {
// ios::sync_with_stdio(false);
// cin.tie(0);
// cin >> t;
// while (t--){
// }
// }
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... |