# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
441308 | julian33 | 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;
#ifdef LOCAL
#define deb(...) logger(#__VA_ARGS__, __VA_ARGS__)
template<typename ...Args>
void logger(string vars, Args&&... values) {
cerr<<vars<<" = ";
string delim="";
(...,(cerr<<delim<<values,delim=", "));
cerr<<"\n";
}
#else
#define deb(...) logger(#__VA_ARGS__, __VA_ARGS__)
template<typename ...Args>
void logger(string vars, Args&&... values) {}
#endif
#define pb push_back
#define sz(x) (int)(x.size())
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<typename T> inline void maxa(T& a,T b){a=max(a,b);}
template<typename T> inline void mina(T& a,T b){a=min(a,b);}
int delivery(int N, int K, int L, int positions[]){
//subtask 1 and 2
if(K==1){
ll ans=0;
for(int i=0;i<N;i++){
ans+=2*min(positions[i],L-positions[i]);
}
return ans;
}
sort(positions,positions+N);
ll ans=2LL*positions[N-1];
for(int i=0;i<N-1;i++){
mina(ans,2LL*positions[i]+2LL*(L-positions[i+1]));
}
mina(ans,2LL*(L-positions[0]));
for(int i=N-1;i;i--){
mina(ans,2LL*positions[i-1]+)
}
return ans;
}