# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
420180 | ismoilov | Boxes with souvenirs (IOI15_boxes) | C++14 | 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<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define all(x) (x).begin(), (x).end()
#define fp(a,i,c) for(int (a) = (i); (a) < (c); (a)++)
#define fpp(a,i,c) for(int (a) = (i); (a) <= (c); (a)++)
#define fm(a,i,c) for(int (a) = (i); (a) > (c); (a)--)
#define fmm(a,i,c) for(int (a) = (i); (a) >= (c); (a)--)
ll delivery(int n, int k, int L, int p[]) {
vector <ll> a, b;
ll ans = 0, l = L;
fp(i,0,n){
if(p[i] <= l-p[i])
a.push_back(p[i]*2);
else
b.push_back((l-p[i])*2);
}
sort(all(a));
sort(all(b));
ll aa = 0, bb = 0;
if(a.size() % k != 0)
aa = a[a.size()-1];
if(b.size() % k != 0)
bb = b[b.size()-1];
if(l >= aa + bb){
int x = k-1;
while(x < a.size())
ans += a[x], x += k;
x = k-1;
while(x < b.size())
ans += b[x], x += k;
if(a.size() % k > 0)
ans += a[a.size()-1];
if(b.size() % k > 0)
ans += b[b.size()-1];
return ans;
}
else{
fp(i,0,k){
if(a.empty()){
if(!b.empty())
b.pop_back();
continue;
}
if(b.empty()){
if(!a.empty())
a.pop_back();
continue;
}
if(a.back() > b.back())
a.pop_back();
else
b.pop_back();
}
int x = k-1;
while(x < a.size())
ans += a[x], x += k;
x = k-1;
while(x < b.size())
ans += b[x], x += k;
if(a.size() % k > 0)
ans += a[a.size()-1];
if(b.size() % k > 0)
ans += b[b.size()-1];
return ans+l;
}
}
int main()
{
IOS;
int n, k, l;
cin >> n >> k >> l;
int p[n];
fp(i,0,n)
cin >> p[i];
cout << delivery(n, k, l, p);
}