Submission #444580

#TimeUsernameProblemLanguageResultExecution timeMemory
444580osmanallazovBoxes with souvenirs (IOI15_boxes)C++14
20 / 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; vector<ll>v; for(int i=0;i<N;i++){ v.push_back(p[i]); } 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; v.push_back(0); v.push_back(L); sort(v.begin(),v.end()); for(int i=0;i<N+1;i++){ res=min(res,(v[i]+L-v[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...