Submission #1246389

#TimeUsernameProblemLanguageResultExecution timeMemory
1246389SpyrosAlivBoxes with souvenirs (IOI15_boxes)C++20
10 / 100
1 ms328 KiB
#include "boxes.h" #include <bits/stdc++.h> using namespace std; #define ll long long int n, k, l; long long delivery(int N, int K, int L, int p[]) { n = N; k = K; l = L; assert(k == 1); ll ans = 0; for (int i = 0; i < n; i++) { ll minDis = min(p[i], L - p[i]); ans += 2 * minDis; } return ans; }
#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...