Submission #954723

#TimeUsernameProblemLanguageResultExecution timeMemory
954723SmuggingSpunBoxes with souvenirs (IOI15_boxes)C++14
10 / 100
1 ms500 KiB
#include "boxes.h" #include<bits/stdc++.h> using namespace std; typedef long long ll; ll delivery(int n, int k, int l, int p[]){ assert(n <= 1000); if(k == 1){ ll ans = 0; for(int i = 0; i < n; i++){ ans += min(p[i], l - p[i]) << 1; } return ans; } else if(k == n){ return min(l, min(l - p[0], p[n - 1]) << 1); } assert(false); }
#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...