Submission #621198

#TimeUsernameProblemLanguageResultExecution timeMemory
621198M_WBoxes with souvenirs (IOI15_boxes)C++17
0 / 100
1 ms304 KiB
#include <bits/stdc++.h> #include "boxes.h" using namespace std; long long delivery(int N, int K, int L, int p[]) { sort(p, p + N); int cut = 0, mid = (L + 1) >> 1; for(; cut < N && p[cut] <= mid; cut++); long long ans = 0; int cnt = 0, last = p[cut - 1]; for(int i = cut - 1; i >= 0; i--){ if(cnt > K){ cnt = 1; ans += (last * 1ll) << 1; last = p[i]; } cnt++; } ans += (last * 1ll) << 1; cnt = 0; last = p[cut]; for(int j = cut; j < N; j++){ if(cnt > K){ cnt = 1; ans += ((L - last) * 1ll) << 1; last = p[j]; } cnt++; } ans += ((L - last) * 1ll) << 1; 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...