Submission #1199002

#TimeUsernameProblemLanguageResultExecution timeMemory
1199002TroySerBoxes with souvenirs (IOI15_boxes)C++20
0 / 100
0 ms328 KiB
#include "boxes.h" #include <bits/stdc++.h> using namespace std; using ll = long long; ll delivery(int N, int K, int L, int p[]) { ll farthestClockwise = p[N - 1]; ll farthestAClockwise = L - p[0]; ll minBetween = min(farthestAClockwise, farthestClockwise); return 2 * minBetween; }
#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...