Submission #375879

#TimeUsernameProblemLanguageResultExecution timeMemory
375879MilosMilutinovicBoxes with souvenirs (IOI15_boxes)C++14
10 / 100
1 ms364 KiB
#include "boxes.h" #include <bits/stdc++.h> using namespace std; #define ll long long ll delivery(int n,int k,int l,int*a){ if(k==1){ ll ans=0; for(int i=0;i<n;i++)ans+=min(a[i]*2,(l-a[i])*2); return ans; } if(k==n){ ll ans=min(l,2*a[n-1]); for(int i=0;i<n-1;i++){ ans=min(ans,(ll)a[i]*2+(ll)2*(l-a[i+1])); } return ans; } return 0LL; }
#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...