Submission #1199007

#TimeUsernameProblemLanguageResultExecution timeMemory
1199007TroySerBoxes 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] + min(L - p[N - 1], p[N - 1]); ll farthestAClockwise = L - p[0] + min(p[0], L - p[0]); ll minRes = min(farthestAClockwise, farthestClockwise); return minRes; }
#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...