Submission #444577

#TimeUsernameProblemLanguageResultExecution timeMemory
444577osmanallazovBoxes with souvenirs (IOI15_boxes)C++14
10 / 100
1 ms204 KiB
#include "boxes.h" #include <bits/stdc++.h> using namespace std; #define ll long long long long delivery(int N, int K, int L, int p[]) { ll res=0; if(K==1){ for(int i=0;i<N;i++){ if(p[i]==0){ res+=0; } else if(p[i]<=L/2){ res+=(p[i]*2); } else{ res+=((L-p[i])*2); } } } else if(K==N){ res=L; sort(p,p+N); p[N]=0; p[N+1]=L; for(int i=0;i<N+1;i++){ res=min(res,2LL*(p[i]+L-p[i+1])*2); } } return res; }
#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...