Submission #484730

#TimeUsernameProblemLanguageResultExecution timeMemory
484730imachugBoxes with souvenirs (IOI15_boxes)C++17
20 / 100
1 ms204 KiB
#include "boxes.h" #include <bits/stdc++.h> using namespace std; long long delivery(int n, int k, int l, int p[]) { if(k == 1) { long long ans = 0; for(int i = 0; i < n; i++) { ans += min(p[i] * 2, (l - p[i]) * 2); } return ans; } if(k == n) { long long ans = l; for(int i = -1; i < n; i++) { ans = min(ans, (long long)(i == -1 ? 0 : p[i] * 2) + (long long)(i == n - 1 ? 0 : (l - p[i + 1]) * 2)); } return ans; } return 0; }
#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...