Submission #1210060

#TimeUsernameProblemLanguageResultExecution timeMemory
1210060sula2Boxes with souvenirs (IOI15_boxes)C++20
0 / 100
0 ms328 KiB
#include <bits/stdc++.h> #define all(a) a.begin(), a.end() #define popcount(x) __builtin_popcountll(x) using namespace std; using namespace chrono; long long delivery(int n, int k, int l, int* positions) { int mx = 0, mn = l; for (int i = 0; i < n; i++) { mx = max(mx, positions[i]); mn = min(mn, positions[i]); } return min({ mx*2, 2*(l - mn), l }); }
#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...