Submission #319533

#TimeUsernameProblemLanguageResultExecution timeMemory
319533tjdgus4384Boxes with souvenirs (IOI15_boxes)C++14
10 / 100
1 ms364 KiB
#include<bits/stdc++.h> #include "boxes.h" using namespace std; long long delivery(int N, int K, int L, int positions[]){ int i, ans = 0; for(i = 0;i + K - 1 < N;i += K){ if(positions[i] > L/2) ans += (L-positions[i])*2; else if(positions[i + K - 1] < L/2) ans += (positions[i + K - 1])*2; else{ for(int j = i+1;j <= i + K - 1;j++){ if(positions[j+1]-positions[j] > L/2){ ans += (L-positions[j+1]+positions[j])*2; goto next; } } ans += L; } next:; } 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...