Submission #751858

#TimeUsernameProblemLanguageResultExecution timeMemory
751858Seb선물상자 (IOI15_boxes)C++17
10 / 100
1 ms340 KiB
#include "boxes.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; long long delivery(int N, int K, int L, int p[]) { ll ans=0; int l=0,r; sort(p,p+N); while (l<N && p[l]==0) l++; for (;l<N;l+=K) { r = min(l+K-1,N-1); ans += min({L,2*p[r],2*(L-p[l])}); } return ans; }
#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...