제출 #785179

#제출 시각아이디문제언어결과실행 시간메모리
785179alexander707070Boxes with souvenirs (IOI15_boxes)C++14
0 / 100
1 ms212 KiB
#include<bits/stdc++.h> #define MAXN 10000007 using namespace std; int n,k,a[MAXN]; long long l,r,len; long long ans; long long delivery(int N, int K, int L,int P[]){ n=N; k=K; for(int i=1;i<=n;i++){ a[i]=P[i]; } sort(a+1,a+n+1); for(int i=1;i<=n;i+=k){ l=a[i]; r=L-a[min(i+k-1,n)]; len=a[min(i+k-1,n)]-a[i]; if(l>r)swap(l,r); ans+=min(l+len+r,2*l+2*len); } return ans; } /* int main(){ cout<<delivery(3,2,8,{1,2,5})<<"\n"; } */
#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...