Submission #1185375

#TimeUsernameProblemLanguageResultExecution timeMemory
1185375stdfloatBoxes with souvenirs (IOI15_boxes)C++20
25 / 100
0 ms328 KiB
#include <bits/stdc++.h> #include "boxes.h" // #include "grader.cpp" using namespace std; using ll = long long; ll delivery(int n, int K, int L, int p[]) { vector<ll> a(n), b(n); for (int i = 0; i < n; i++) a[i] = (p[i] << 1) + (K <= i ? a[i - K] : 0); for (int i = n - 1; i >= 0; i--) b[i] = (L - p[i] << 1) + (i + K < n ? b[i + K] : 0); ll mn = min(a[n - 1], b[0]); for (int i = 0; i < n; i++) mn = min({mn, a[i] + (i + 1 < n ? b[i + 1] : 0), a[i] + L + (i + K + 1 < n ? b[i + K + 1] : 0)}); return mn; }
#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...