# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
64910 | 2018-08-06T05:59:04 Z | mirbek01 | Boxes with souvenirs (IOI15_boxes) | C++17 | 0 ms | 0 KB |
#include "boxes.h" # include <bits/stdc++.h> using namespace std; long long delivery(int N, int K, int L, int p[]) { long long ans = 0; if(K == 1){ for(int i = 0; i < N; i ++){ if((L - p[i]) > p[i]) ans += p[i] * 2; else ans += (L - p[i]) * 2; } } else { sort(p, p + N); ans = L; for(int i = 0; i < N - 1; i ++){ if(ans > ((p[i] * 2ll) + (L - p[i + 1]) * 2ll)) ans = (p[i] * 2ll) + (L - p[i + 1]) * 2ll; } if(ans > p[N - 1] * 2) ans = p[N - 1] * 2; if(ans > (L - P[N - 1]) * 2) ans = (L - P[n - 1]) * 2; } return ans; }