Submission #64891

#TimeUsernameProblemLanguageResultExecution timeMemory
64891daniel_02Boxes with souvenirs (IOI15_boxes)C++17
10 / 100
3 ms504 KiB
#include "boxes.h" #include <bits/stdc++.h> long long delivery(int N, int K, int L, int p[]) { long long ans = 0; if (K == 1) { for (int i = 0; i < N; i++) { if (p[i] <= L / 2) { ans += (p[i] * 2LL); } else { ans += ((L - p[i]) * 2LL); } } } else if (K == N) { for (int i = 0; i < N; i++) { ans += p[i]; } } else { assert(0); } 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...