Submission #1013853

#TimeUsernameProblemLanguageResultExecution timeMemory
1013853MuhammetBoxes with souvenirs (IOI15_boxes)C++17
10 / 100
1 ms604 KiB
#include <bits/stdc++.h> #include "boxes.h" #define ll long long using namespace std; ll delivery(int n, int k, int x, int a[]) { int l = 0, r = n-1; sort(a,a+n); ll ans = 0; while(l <= r){ int y = 1e9; y = min(y,a[min(l+k-1,r)] + min(a[min(l+k-1,r)],x-a[min(l+k-1,r)])); y = min(y,x-a[max(r-k+1,l)] + min(a[max(r-k+1,l)],x-a[max(r-k+1,l)])); ans += y; if(y == a[min(l+k-1,r)] + min(a[min(l+k-1,r)],x-a[min(l+k-1,r)]+1)){ l += k; } else { r -= k; } } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...