Submission #1265677

#TimeUsernameProblemLanguageResultExecution timeMemory
1265677scalifrastico_098Boxes with souvenirs (IOI15_boxes)C++20
10 / 100
0 ms328 KiB
#include "boxes.h" #include <bits/stdc++.h> using namespace std; long long delivery(int n, int k, int l, int p[]) { long long m=0; int y=0, u=INT_MAX; for(long long i=0; i<n; i++){m+=2*(min(p[i], l-p[i]));y=max(y, p[i]); u=min(u, p[i]);} if(k==1) return m; return min(y, l-u); }
#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...